./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-51.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d436bfa6-461c-48ad-aea8-fcd5d20ccb13/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d436bfa6-461c-48ad-aea8-fcd5d20ccb13/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d436bfa6-461c-48ad-aea8-fcd5d20ccb13/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d436bfa6-461c-48ad-aea8-fcd5d20ccb13/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-51.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d436bfa6-461c-48ad-aea8-fcd5d20ccb13/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d436bfa6-461c-48ad-aea8-fcd5d20ccb13/bin/uautomizer-verify-qhAvR1uOyd --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4703bfd85786444b7063ad726d04e3dbfe77bfd14c478aa800342006bdde0646 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 13:28:04,668 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 13:28:04,791 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d436bfa6-461c-48ad-aea8-fcd5d20ccb13/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 13:28:04,802 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 13:28:04,803 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 13:28:04,829 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 13:28:04,830 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 13:28:04,830 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 13:28:04,831 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 13:28:04,831 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 13:28:04,831 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 13:28:04,831 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 13:28:04,832 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 13:28:04,832 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 13:28:04,832 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 13:28:04,832 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 13:28:04,833 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 13:28:04,833 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 13:28:04,833 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 13:28:04,833 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 13:28:04,833 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 13:28:04,833 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 13:28:04,833 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 13:28:04,833 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 13:28:04,834 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 13:28:04,834 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 13:28:04,834 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 13:28:04,834 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 13:28:04,834 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 13:28:04,834 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 13:28:04,834 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 13:28:04,835 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 13:28:04,835 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:28:04,835 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 13:28:04,835 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 13:28:04,835 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 13:28:04,835 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 13:28:04,835 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 13:28:04,835 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 13:28:04,835 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 13:28:04,836 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 13:28:04,836 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 13:28:04,836 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d436bfa6-461c-48ad-aea8-fcd5d20ccb13/bin/uautomizer-verify-qhAvR1uOyd Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4703bfd85786444b7063ad726d04e3dbfe77bfd14c478aa800342006bdde0646 [2024-11-13 13:28:05,264 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 13:28:05,279 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 13:28:05,282 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 13:28:05,286 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 13:28:05,287 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 13:28:05,288 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d436bfa6-461c-48ad-aea8-fcd5d20ccb13/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-51.i Unable to find full path for "g++" [2024-11-13 13:28:07,366 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 13:28:07,750 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 13:28:07,751 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d436bfa6-461c-48ad-aea8-fcd5d20ccb13/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-51.i [2024-11-13 13:28:07,762 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d436bfa6-461c-48ad-aea8-fcd5d20ccb13/bin/uautomizer-verify-qhAvR1uOyd/data/65fd10cf9/a42de860c74b42c283239c6a84d83eb8/FLAG2ba92107d [2024-11-13 13:28:07,783 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d436bfa6-461c-48ad-aea8-fcd5d20ccb13/bin/uautomizer-verify-qhAvR1uOyd/data/65fd10cf9/a42de860c74b42c283239c6a84d83eb8 [2024-11-13 13:28:07,786 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 13:28:07,788 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 13:28:07,789 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 13:28:07,789 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 13:28:07,793 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 13:28:07,794 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:28:07" (1/1) ... [2024-11-13 13:28:07,795 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d84824a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:28:07, skipping insertion in model container [2024-11-13 13:28:07,795 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:28:07" (1/1) ... [2024-11-13 13:28:07,828 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 13:28:08,059 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d436bfa6-461c-48ad-aea8-fcd5d20ccb13/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-51.i[913,926] [2024-11-13 13:28:08,159 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:28:08,179 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 13:28:08,194 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d436bfa6-461c-48ad-aea8-fcd5d20ccb13/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-51.i[913,926] [2024-11-13 13:28:08,264 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:28:08,298 INFO L204 MainTranslator]: Completed translation [2024-11-13 13:28:08,299 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:28:08 WrapperNode [2024-11-13 13:28:08,299 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 13:28:08,300 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 13:28:08,300 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 13:28:08,300 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 13:28:08,307 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:28:08" (1/1) ... [2024-11-13 13:28:08,323 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:28:08" (1/1) ... [2024-11-13 13:28:08,377 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 150 [2024-11-13 13:28:08,377 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 13:28:08,382 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 13:28:08,382 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 13:28:08,382 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 13:28:08,396 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:28:08" (1/1) ... [2024-11-13 13:28:08,397 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:28:08" (1/1) ... [2024-11-13 13:28:08,399 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:28:08" (1/1) ... [2024-11-13 13:28:08,427 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-13 13:28:08,428 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:28:08" (1/1) ... [2024-11-13 13:28:08,428 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:28:08" (1/1) ... [2024-11-13 13:28:08,435 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:28:08" (1/1) ... [2024-11-13 13:28:08,439 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:28:08" (1/1) ... [2024-11-13 13:28:08,441 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:28:08" (1/1) ... [2024-11-13 13:28:08,442 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:28:08" (1/1) ... [2024-11-13 13:28:08,445 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 13:28:08,446 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 13:28:08,447 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 13:28:08,447 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 13:28:08,448 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:28:08" (1/1) ... [2024-11-13 13:28:08,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:28:08,482 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d436bfa6-461c-48ad-aea8-fcd5d20ccb13/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:28:08,496 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d436bfa6-461c-48ad-aea8-fcd5d20ccb13/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 13:28:08,501 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d436bfa6-461c-48ad-aea8-fcd5d20ccb13/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 13:28:08,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 13:28:08,533 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 13:28:08,534 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 13:28:08,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 13:28:08,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 13:28:08,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 13:28:08,653 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 13:28:08,655 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 13:28:09,185 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-13 13:28:09,185 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 13:28:09,203 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 13:28:09,203 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 13:28:09,204 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:28:09 BoogieIcfgContainer [2024-11-13 13:28:09,204 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 13:28:09,210 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 13:28:09,210 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 13:28:09,217 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 13:28:09,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 01:28:07" (1/3) ... [2024-11-13 13:28:09,218 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cc77d02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:28:09, skipping insertion in model container [2024-11-13 13:28:09,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:28:08" (2/3) ... [2024-11-13 13:28:09,218 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cc77d02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:28:09, skipping insertion in model container [2024-11-13 13:28:09,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:28:09" (3/3) ... [2024-11-13 13:28:09,221 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-51.i [2024-11-13 13:28:09,244 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 13:28:09,246 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_normal_file-51.i that has 2 procedures, 67 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 13:28:09,357 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 13:28:09,380 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3cb69fc5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 13:28:09,380 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 13:28:09,385 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 44 states have internal predecessors, (60), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-13 13:28:09,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-13 13:28:09,407 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:28:09,408 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:28:09,408 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:28:09,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:28:09,418 INFO L85 PathProgramCache]: Analyzing trace with hash -2033349918, now seen corresponding path program 1 times [2024-11-13 13:28:09,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:28:09,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068603689] [2024-11-13 13:28:09,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:28:09,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:28:09,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:09,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:28:09,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:09,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 13:28:09,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:09,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:28:09,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:09,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-13 13:28:09,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:09,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:28:09,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:09,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-13 13:28:09,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:09,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-13 13:28:09,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:09,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 13:28:10,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:10,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 13:28:10,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:10,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-13 13:28:10,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:10,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-13 13:28:10,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:10,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-13 13:28:10,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:10,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-13 13:28:10,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:10,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 13:28:10,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:10,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 13:28:10,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:10,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-13 13:28:10,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:10,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-13 13:28:10,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:10,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-13 13:28:10,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:10,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-13 13:28:10,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:10,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-13 13:28:10,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:10,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 13:28:10,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:10,111 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-13 13:28:10,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:28:10,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068603689] [2024-11-13 13:28:10,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068603689] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:28:10,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:28:10,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:28:10,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160044125] [2024-11-13 13:28:10,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:28:10,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 13:28:10,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:28:10,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 13:28:10,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 13:28:10,162 INFO L87 Difference]: Start difference. First operand has 67 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 44 states have internal predecessors, (60), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-13 13:28:10,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:28:10,209 INFO L93 Difference]: Finished difference Result 127 states and 219 transitions. [2024-11-13 13:28:10,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 13:28:10,212 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 135 [2024-11-13 13:28:10,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:28:10,223 INFO L225 Difference]: With dead ends: 127 [2024-11-13 13:28:10,223 INFO L226 Difference]: Without dead ends: 63 [2024-11-13 13:28:10,227 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 13:28:10,233 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:28:10,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:28:10,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-13 13:28:10,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-11-13 13:28:10,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 40 states have (on average 1.325) internal successors, (53), 40 states have internal predecessors, (53), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-13 13:28:10,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 95 transitions. [2024-11-13 13:28:10,304 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 95 transitions. Word has length 135 [2024-11-13 13:28:10,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:28:10,306 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 95 transitions. [2024-11-13 13:28:10,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-13 13:28:10,306 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 95 transitions. [2024-11-13 13:28:10,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-13 13:28:10,310 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:28:10,313 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:28:10,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 13:28:10,314 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:28:10,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:28:10,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1732673956, now seen corresponding path program 1 times [2024-11-13 13:28:10,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:28:10,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868903289] [2024-11-13 13:28:10,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:28:10,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:28:10,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:10,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:28:10,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:11,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 13:28:11,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:11,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:28:11,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:11,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-13 13:28:11,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:11,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:28:11,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:11,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-13 13:28:11,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:11,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-13 13:28:11,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:11,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 13:28:11,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:11,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 13:28:11,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:11,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-13 13:28:11,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:11,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-13 13:28:11,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:11,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-13 13:28:11,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:11,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-13 13:28:11,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:11,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 13:28:11,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:11,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 13:28:11,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:11,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-13 13:28:11,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:11,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-13 13:28:11,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:11,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-13 13:28:11,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:11,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-13 13:28:11,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:11,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-13 13:28:11,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:11,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 13:28:11,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:11,257 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-13 13:28:11,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:28:11,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868903289] [2024-11-13 13:28:11,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868903289] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:28:11,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:28:11,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:28:11,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278558077] [2024-11-13 13:28:11,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:28:11,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:28:11,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:28:11,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:28:11,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:28:11,264 INFO L87 Difference]: Start difference. First operand 63 states and 95 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-13 13:28:11,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:28:11,614 INFO L93 Difference]: Finished difference Result 184 states and 280 transitions. [2024-11-13 13:28:11,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:28:11,617 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 135 [2024-11-13 13:28:11,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:28:11,620 INFO L225 Difference]: With dead ends: 184 [2024-11-13 13:28:11,620 INFO L226 Difference]: Without dead ends: 124 [2024-11-13 13:28:11,624 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:28:11,627 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 71 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 13:28:11,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 261 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 13:28:11,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-13 13:28:11,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 103. [2024-11-13 13:28:11,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 58 states have internal predecessors, (71), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-13 13:28:11,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 155 transitions. [2024-11-13 13:28:11,690 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 155 transitions. Word has length 135 [2024-11-13 13:28:11,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:28:11,691 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 155 transitions. [2024-11-13 13:28:11,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-13 13:28:11,691 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 155 transitions. [2024-11-13 13:28:11,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-13 13:28:11,693 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:28:11,694 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:28:11,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 13:28:11,694 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:28:11,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:28:11,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1284839648, now seen corresponding path program 1 times [2024-11-13 13:28:11,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:28:11,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004080119] [2024-11-13 13:28:11,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:28:11,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:28:11,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:12,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:28:12,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:12,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 13:28:12,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:12,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:28:12,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:12,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-13 13:28:12,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:12,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:28:12,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:12,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-13 13:28:12,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:12,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-13 13:28:12,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:12,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 13:28:12,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:12,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 13:28:12,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:12,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-13 13:28:12,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:12,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-13 13:28:12,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:12,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-13 13:28:12,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:12,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-13 13:28:12,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:12,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 13:28:12,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:12,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 13:28:12,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:12,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-13 13:28:12,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:12,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-13 13:28:12,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:12,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-13 13:28:12,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:12,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-13 13:28:12,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:12,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-13 13:28:12,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:12,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 13:28:12,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:12,649 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-13 13:28:12,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:28:12,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004080119] [2024-11-13 13:28:12,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004080119] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:28:12,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:28:12,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 13:28:12,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973902204] [2024-11-13 13:28:12,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:28:12,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:28:12,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:28:12,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:28:12,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:28:12,656 INFO L87 Difference]: Start difference. First operand 103 states and 155 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-13 13:28:13,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:28:13,112 INFO L93 Difference]: Finished difference Result 230 states and 346 transitions. [2024-11-13 13:28:13,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 13:28:13,113 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 136 [2024-11-13 13:28:13,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:28:13,120 INFO L225 Difference]: With dead ends: 230 [2024-11-13 13:28:13,120 INFO L226 Difference]: Without dead ends: 170 [2024-11-13 13:28:13,121 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-13 13:28:13,125 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 82 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 13:28:13,126 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 318 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 13:28:13,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-13 13:28:13,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 161. [2024-11-13 13:28:13,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 94 states have (on average 1.2659574468085106) internal successors, (119), 94 states have internal predecessors, (119), 63 states have call successors, (63), 3 states have call predecessors, (63), 3 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2024-11-13 13:28:13,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 245 transitions. [2024-11-13 13:28:13,200 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 245 transitions. Word has length 136 [2024-11-13 13:28:13,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:28:13,201 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 245 transitions. [2024-11-13 13:28:13,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-13 13:28:13,202 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 245 transitions. [2024-11-13 13:28:13,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-13 13:28:13,209 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:28:13,209 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:28:13,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 13:28:13,209 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:28:13,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:28:13,210 INFO L85 PathProgramCache]: Analyzing trace with hash -607065803, now seen corresponding path program 1 times [2024-11-13 13:28:13,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:28:13,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699166645] [2024-11-13 13:28:13,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:28:13,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:28:13,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:13,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:28:13,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:13,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 13:28:13,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:13,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:28:13,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:13,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-13 13:28:13,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:13,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:28:13,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:13,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-13 13:28:13,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:13,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-13 13:28:13,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:13,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 13:28:13,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:13,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 13:28:13,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:13,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-13 13:28:13,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:13,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-13 13:28:13,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:13,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-13 13:28:13,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:13,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-13 13:28:13,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:13,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 13:28:13,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:13,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 13:28:13,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:13,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-13 13:28:13,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:13,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-13 13:28:13,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:13,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-13 13:28:13,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:13,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-13 13:28:13,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:13,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-13 13:28:13,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:13,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 13:28:13,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:13,763 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-13 13:28:13,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:28:13,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699166645] [2024-11-13 13:28:13,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699166645] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:28:13,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:28:13,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:28:13,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962309419] [2024-11-13 13:28:13,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:28:13,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:28:13,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:28:13,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:28:13,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:28:13,767 INFO L87 Difference]: Start difference. First operand 161 states and 245 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-13 13:28:14,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:28:14,085 INFO L93 Difference]: Finished difference Result 397 states and 609 transitions. [2024-11-13 13:28:14,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:28:14,087 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 137 [2024-11-13 13:28:14,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:28:14,095 INFO L225 Difference]: With dead ends: 397 [2024-11-13 13:28:14,095 INFO L226 Difference]: Without dead ends: 279 [2024-11-13 13:28:14,096 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:28:14,097 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 77 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:28:14,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 244 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 13:28:14,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2024-11-13 13:28:14,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 277. [2024-11-13 13:28:14,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 166 states have (on average 1.2891566265060241) internal successors, (214), 166 states have internal predecessors, (214), 105 states have call successors, (105), 5 states have call predecessors, (105), 5 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2024-11-13 13:28:14,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 424 transitions. [2024-11-13 13:28:14,238 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 424 transitions. Word has length 137 [2024-11-13 13:28:14,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:28:14,239 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 424 transitions. [2024-11-13 13:28:14,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-13 13:28:14,243 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 424 transitions. [2024-11-13 13:28:14,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-13 13:28:14,246 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:28:14,250 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:28:14,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 13:28:14,250 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:28:14,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:28:14,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1000092813, now seen corresponding path program 1 times [2024-11-13 13:28:14,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:28:14,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134463561] [2024-11-13 13:28:14,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:28:14,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:28:14,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:14,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:28:14,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:14,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 13:28:14,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:14,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:28:14,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:14,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-13 13:28:14,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:14,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:28:14,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:14,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-13 13:28:14,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:14,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-13 13:28:14,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:14,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 13:28:14,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:14,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 13:28:14,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:14,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-13 13:28:14,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:14,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-13 13:28:14,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:14,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-13 13:28:14,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:14,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-13 13:28:14,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:14,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 13:28:14,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:14,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 13:28:14,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:14,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-13 13:28:14,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:14,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-13 13:28:14,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:14,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-13 13:28:14,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:14,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-13 13:28:14,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:14,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-13 13:28:14,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:14,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 13:28:14,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:14,560 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-13 13:28:14,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:28:14,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134463561] [2024-11-13 13:28:14,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134463561] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:28:14,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:28:14,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:28:14,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267207748] [2024-11-13 13:28:14,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:28:14,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:28:14,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:28:14,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:28:14,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:28:14,563 INFO L87 Difference]: Start difference. First operand 277 states and 424 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-13 13:28:14,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:28:14,658 INFO L93 Difference]: Finished difference Result 521 states and 802 transitions. [2024-11-13 13:28:14,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:28:14,659 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 137 [2024-11-13 13:28:14,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:28:14,666 INFO L225 Difference]: With dead ends: 521 [2024-11-13 13:28:14,666 INFO L226 Difference]: Without dead ends: 287 [2024-11-13 13:28:14,670 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:28:14,670 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 17 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:28:14,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 193 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:28:14,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-11-13 13:28:14,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 277. [2024-11-13 13:28:14,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 166 states have (on average 1.2650602409638554) internal successors, (210), 166 states have internal predecessors, (210), 105 states have call successors, (105), 5 states have call predecessors, (105), 5 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2024-11-13 13:28:14,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 420 transitions. [2024-11-13 13:28:14,761 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 420 transitions. Word has length 137 [2024-11-13 13:28:14,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:28:14,762 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 420 transitions. [2024-11-13 13:28:14,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-13 13:28:14,763 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 420 transitions. [2024-11-13 13:28:14,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-13 13:28:14,764 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:28:14,765 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:28:14,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 13:28:14,765 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:28:14,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:28:14,765 INFO L85 PathProgramCache]: Analyzing trace with hash 98405429, now seen corresponding path program 1 times [2024-11-13 13:28:14,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:28:14,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188646073] [2024-11-13 13:28:14,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:28:14,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:28:14,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:15,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:28:15,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:15,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 13:28:15,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:15,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:28:15,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:15,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-13 13:28:15,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:15,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:28:15,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:15,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-13 13:28:15,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:15,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-13 13:28:15,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:15,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 13:28:15,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:15,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 13:28:15,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:15,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-13 13:28:15,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:15,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-13 13:28:15,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:15,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-13 13:28:15,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:15,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-13 13:28:15,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:15,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 13:28:15,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:15,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 13:28:15,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:15,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-13 13:28:15,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:15,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-13 13:28:15,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:15,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-13 13:28:15,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:15,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-13 13:28:15,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:15,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-13 13:28:15,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:15,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 13:28:15,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:15,135 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 24 proven. 36 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-13 13:28:15,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:28:15,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188646073] [2024-11-13 13:28:15,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188646073] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:28:15,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888602114] [2024-11-13 13:28:15,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:28:15,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:28:15,136 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d436bfa6-461c-48ad-aea8-fcd5d20ccb13/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:28:15,138 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d436bfa6-461c-48ad-aea8-fcd5d20ccb13/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:28:15,141 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d436bfa6-461c-48ad-aea8-fcd5d20ccb13/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 13:28:15,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:15,317 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 13:28:15,329 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:28:15,571 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 420 proven. 36 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2024-11-13 13:28:15,571 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:28:15,895 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 24 proven. 36 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-13 13:28:15,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1888602114] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:28:15,896 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:28:15,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-11-13 13:28:15,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789012473] [2024-11-13 13:28:15,900 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:28:15,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 13:28:15,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:28:15,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 13:28:15,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-13 13:28:15,902 INFO L87 Difference]: Start difference. First operand 277 states and 420 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 3 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 3 states have call predecessors, (46), 3 states have call successors, (46) [2024-11-13 13:28:16,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:28:16,244 INFO L93 Difference]: Finished difference Result 425 states and 625 transitions. [2024-11-13 13:28:16,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 13:28:16,245 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 3 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 3 states have call predecessors, (46), 3 states have call successors, (46) Word has length 138 [2024-11-13 13:28:16,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:28:16,249 INFO L225 Difference]: With dead ends: 425 [2024-11-13 13:28:16,249 INFO L226 Difference]: Without dead ends: 307 [2024-11-13 13:28:16,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-11-13 13:28:16,251 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 141 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:28:16,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 149 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 13:28:16,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2024-11-13 13:28:16,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 173. [2024-11-13 13:28:16,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 103 states have (on average 1.203883495145631) internal successors, (124), 103 states have internal predecessors, (124), 63 states have call successors, (63), 6 states have call predecessors, (63), 6 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2024-11-13 13:28:16,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 250 transitions. [2024-11-13 13:28:16,318 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 250 transitions. Word has length 138 [2024-11-13 13:28:16,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:28:16,319 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 250 transitions. [2024-11-13 13:28:16,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 3 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 3 states have call predecessors, (46), 3 states have call successors, (46) [2024-11-13 13:28:16,320 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 250 transitions. [2024-11-13 13:28:16,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-13 13:28:16,322 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:28:16,323 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:28:16,346 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d436bfa6-461c-48ad-aea8-fcd5d20ccb13/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 13:28:16,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d436bfa6-461c-48ad-aea8-fcd5d20ccb13/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:28:16,527 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:28:16,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:28:16,528 INFO L85 PathProgramCache]: Analyzing trace with hash -294621581, now seen corresponding path program 1 times [2024-11-13 13:28:16,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:28:16,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333973879] [2024-11-13 13:28:16,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:28:16,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:28:16,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:16,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:28:16,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:16,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-13 13:28:16,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:16,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-13 13:28:16,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:16,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-13 13:28:16,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:16,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-13 13:28:16,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:16,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-13 13:28:16,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:16,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-13 13:28:16,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:16,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-13 13:28:16,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:16,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-13 13:28:16,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:16,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-13 13:28:16,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:16,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-13 13:28:16,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:16,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-13 13:28:16,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:16,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-13 13:28:16,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:16,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 13:28:16,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:16,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-13 13:28:16,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:16,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-13 13:28:17,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:17,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-13 13:28:17,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:17,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-13 13:28:17,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:17,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-13 13:28:17,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:17,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-13 13:28:17,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:17,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 13:28:17,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:17,051 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 54 proven. 6 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-13 13:28:17,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:28:17,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333973879] [2024-11-13 13:28:17,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333973879] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:28:17,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703682099] [2024-11-13 13:28:17,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:28:17,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:28:17,052 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d436bfa6-461c-48ad-aea8-fcd5d20ccb13/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:28:17,054 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d436bfa6-461c-48ad-aea8-fcd5d20ccb13/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:28:17,058 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d436bfa6-461c-48ad-aea8-fcd5d20ccb13/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 13:28:17,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:17,500 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 13:28:17,505 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:28:17,621 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 200 proven. 6 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2024-11-13 13:28:17,621 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:28:17,904 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 54 proven. 6 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-13 13:28:17,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703682099] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:28:17,904 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:28:17,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2024-11-13 13:28:17,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546882554] [2024-11-13 13:28:17,905 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:28:17,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 13:28:17,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:28:17,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 13:28:17,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-13 13:28:17,907 INFO L87 Difference]: Start difference. First operand 173 states and 250 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-13 13:28:19,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:28:19,241 INFO L93 Difference]: Finished difference Result 435 states and 605 transitions. [2024-11-13 13:28:19,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-13 13:28:19,242 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 138 [2024-11-13 13:28:19,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:28:19,247 INFO L225 Difference]: With dead ends: 435 [2024-11-13 13:28:19,247 INFO L226 Difference]: Without dead ends: 371 [2024-11-13 13:28:19,248 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 314 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=184, Invalid=466, Unknown=0, NotChecked=0, Total=650 [2024-11-13 13:28:19,249 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 202 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-13 13:28:19,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 424 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-13 13:28:19,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2024-11-13 13:28:19,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 271. [2024-11-13 13:28:19,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 160 states have (on average 1.14375) internal successors, (183), 162 states have internal predecessors, (183), 97 states have call successors, (97), 13 states have call predecessors, (97), 13 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2024-11-13 13:28:19,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 377 transitions. [2024-11-13 13:28:19,344 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 377 transitions. Word has length 138 [2024-11-13 13:28:19,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:28:19,345 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 377 transitions. [2024-11-13 13:28:19,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-13 13:28:19,345 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 377 transitions. [2024-11-13 13:28:19,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-13 13:28:19,347 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:28:19,347 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:28:19,372 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d436bfa6-461c-48ad-aea8-fcd5d20ccb13/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-13 13:28:19,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d436bfa6-461c-48ad-aea8-fcd5d20ccb13/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:28:19,548 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:28:19,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:28:19,549 INFO L85 PathProgramCache]: Analyzing trace with hash -487985556, now seen corresponding path program 1 times [2024-11-13 13:28:19,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:28:19,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669484476] [2024-11-13 13:28:19,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:28:19,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:28:19,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:28:19,689 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 13:28:19,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:28:19,887 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 13:28:19,887 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 13:28:19,889 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 13:28:19,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 13:28:19,896 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:28:20,057 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 13:28:20,063 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 01:28:20 BoogieIcfgContainer [2024-11-13 13:28:20,064 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 13:28:20,065 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 13:28:20,065 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 13:28:20,065 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 13:28:20,066 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:28:09" (3/4) ... [2024-11-13 13:28:20,068 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 13:28:20,069 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 13:28:20,070 INFO L158 Benchmark]: Toolchain (without parser) took 12283.06ms. Allocated memory was 117.4MB in the beginning and 352.3MB in the end (delta: 234.9MB). Free memory was 93.7MB in the beginning and 177.3MB in the end (delta: -83.6MB). Peak memory consumption was 150.3MB. Max. memory is 16.1GB. [2024-11-13 13:28:20,071 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 167.8MB. Free memory is still 104.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:28:20,072 INFO L158 Benchmark]: CACSL2BoogieTranslator took 510.61ms. Allocated memory is still 117.4MB. Free memory was 93.3MB in the beginning and 79.6MB in the end (delta: 13.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 13:28:20,072 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.47ms. Allocated memory is still 117.4MB. Free memory was 79.3MB in the beginning and 77.2MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:28:20,072 INFO L158 Benchmark]: Boogie Preprocessor took 63.51ms. Allocated memory is still 117.4MB. Free memory was 77.2MB in the beginning and 74.0MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:28:20,074 INFO L158 Benchmark]: RCFGBuilder took 757.71ms. Allocated memory is still 117.4MB. Free memory was 74.0MB in the beginning and 55.6MB in the end (delta: 18.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 13:28:20,074 INFO L158 Benchmark]: TraceAbstraction took 10854.33ms. Allocated memory was 117.4MB in the beginning and 352.3MB in the end (delta: 234.9MB). Free memory was 55.3MB in the beginning and 177.4MB in the end (delta: -122.1MB). Peak memory consumption was 116.8MB. Max. memory is 16.1GB. [2024-11-13 13:28:20,075 INFO L158 Benchmark]: Witness Printer took 4.90ms. Allocated memory is still 352.3MB. Free memory was 177.4MB in the beginning and 177.3MB in the end (delta: 72.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:28:20,076 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.42ms. Allocated memory is still 167.8MB. Free memory is still 104.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 510.61ms. Allocated memory is still 117.4MB. Free memory was 93.3MB in the beginning and 79.6MB in the end (delta: 13.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.47ms. Allocated memory is still 117.4MB. Free memory was 79.3MB in the beginning and 77.2MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 63.51ms. Allocated memory is still 117.4MB. Free memory was 77.2MB in the beginning and 74.0MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 757.71ms. Allocated memory is still 117.4MB. Free memory was 74.0MB in the beginning and 55.6MB in the end (delta: 18.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 10854.33ms. Allocated memory was 117.4MB in the beginning and 352.3MB in the end (delta: 234.9MB). Free memory was 55.3MB in the beginning and 177.4MB in the end (delta: -122.1MB). Peak memory consumption was 116.8MB. Max. memory is 16.1GB. * Witness Printer took 4.90ms. Allocated memory is still 352.3MB. Free memory was 177.4MB in the beginning and 177.3MB in the end (delta: 72.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someUnaryDOUBLEoperation at line 37, overapproximation of someBinaryDOUBLEComparisonOperation at line 101, overapproximation of someBinaryDOUBLEComparisonOperation at line 61, overapproximation of someBinaryDOUBLEComparisonOperation at line 77, overapproximation of someBinaryDOUBLEComparisonOperation at line 49, overapproximation of someBinaryDOUBLEComparisonOperation at line 125, overapproximation of someBinaryDOUBLEComparisonOperation at line 47, overapproximation of someBinaryDOUBLEComparisonOperation at line 103, overapproximation of someBinaryDOUBLEComparisonOperation at line 141, overapproximation of someBinaryDOUBLEComparisonOperation at line 71, overapproximation of someBinaryDOUBLEComparisonOperation at line 123, overapproximation of someBinaryDOUBLEComparisonOperation at line 126. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 128; [L23] double var_1_4 = 32.3; [L24] double var_1_5 = 0.25; [L25] unsigned char var_1_7 = 2; [L26] signed char var_1_8 = -10; [L27] signed char var_1_9 = 5; [L28] signed char var_1_10 = 4; [L29] signed char var_1_11 = 100; [L30] unsigned long int var_1_12 = 8; [L31] unsigned char var_1_13 = 0; [L32] unsigned long int var_1_15 = 1114432789; [L33] double var_1_17 = 256.8; [L34] double var_1_18 = 1.25; [L35] unsigned long int var_1_19 = 16; [L36] unsigned char var_1_21 = 1; [L37] double var_1_22 = -0.5; [L38] unsigned char var_1_23 = 0; [L39] unsigned char var_1_24 = 1; [L40] unsigned char last_1_var_1_1 = 128; [L41] unsigned long int last_1_var_1_12 = 8; [L42] double last_1_var_1_17 = 256.8; [L43] unsigned char last_1_var_1_21 = 1; VAL [isInitial=0, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_4=323/10, var_1_5=1/4, var_1_7=2, var_1_8=-10, var_1_9=5] [L145] isInitial = 1 [L146] FCALL initially() [L147] COND TRUE 1 [L148] CALL updateLastVariables() [L135] last_1_var_1_1 = var_1_1 [L136] last_1_var_1_12 = var_1_12 [L137] last_1_var_1_17 = var_1_17 [L138] last_1_var_1_21 = var_1_21 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_4=323/10, var_1_5=1/4, var_1_7=2, var_1_8=-10, var_1_9=5] [L148] RET updateLastVariables() [L149] CALL updateVariables() [L100] var_1_4 = __VERIFIER_nondet_double() [L101] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=1/4, var_1_7=2, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=1/4, var_1_7=2, var_1_8=-10, var_1_9=5] [L101] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=1/4, var_1_7=2, var_1_8=-10, var_1_9=5] [L102] var_1_5 = __VERIFIER_nondet_double() [L103] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=2, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=2, var_1_8=-10, var_1_9=5] [L103] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=2, var_1_8=-10, var_1_9=5] [L104] var_1_7 = __VERIFIER_nondet_uchar() [L105] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_8=-10, var_1_9=5] [L105] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_8=-10, var_1_9=5] [L106] CALL assume_abort_if_not(var_1_7 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=5] [L106] RET assume_abort_if_not(var_1_7 <= 254) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=5] [L107] var_1_9 = __VERIFIER_nondet_char() [L108] CALL assume_abort_if_not(var_1_9 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L108] RET assume_abort_if_not(var_1_9 >= -1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L109] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L109] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L110] var_1_10 = __VERIFIER_nondet_char() [L111] CALL assume_abort_if_not(var_1_10 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L111] RET assume_abort_if_not(var_1_10 >= -1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L112] CALL assume_abort_if_not(var_1_10 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L112] RET assume_abort_if_not(var_1_10 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L113] var_1_11 = __VERIFIER_nondet_char() [L114] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L114] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L115] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L115] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L116] var_1_13 = __VERIFIER_nondet_uchar() [L117] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L117] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L118] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L118] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L119] var_1_15 = __VERIFIER_nondet_ulong() [L120] CALL assume_abort_if_not(var_1_15 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L120] RET assume_abort_if_not(var_1_15 >= 1073741823) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L121] CALL assume_abort_if_not(var_1_15 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L121] RET assume_abort_if_not(var_1_15 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L122] var_1_18 = __VERIFIER_nondet_double() [L123] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L123] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L124] var_1_22 = __VERIFIER_nondet_double() [L125] CALL assume_abort_if_not((var_1_22 >= -922337.2036854776000e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854776000e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L125] RET assume_abort_if_not((var_1_22 >= -922337.2036854776000e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854776000e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L126] CALL assume_abort_if_not(var_1_22 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L126] RET assume_abort_if_not(var_1_22 != 0.0F) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L127] var_1_23 = __VERIFIER_nondet_uchar() [L128] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L128] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L129] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L129] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L130] var_1_24 = __VERIFIER_nondet_uchar() [L131] CALL assume_abort_if_not(var_1_24 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L131] RET assume_abort_if_not(var_1_24 >= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L132] CALL assume_abort_if_not(var_1_24 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L132] RET assume_abort_if_not(var_1_24 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L149] RET updateVariables() [L150] CALL step() [L47] unsigned char stepLocal_3 = ((((var_1_4) > (last_1_var_1_17)) ? (var_1_4) : (last_1_var_1_17))) > var_1_18; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_3=0, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L48] COND TRUE last_1_var_1_21 || stepLocal_3 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L49] COND TRUE var_1_18 > ((((last_1_var_1_17) < 0 ) ? -(last_1_var_1_17) : (last_1_var_1_17))) [L50] var_1_19 = last_1_var_1_1 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=128, var_1_1=128, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L57] unsigned long int stepLocal_1 = last_1_var_1_12; [L58] unsigned long int stepLocal_0 = 32u; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_0=32, stepLocal_1=8, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=128, var_1_1=128, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L59] COND TRUE stepLocal_0 >= last_1_var_1_12 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_1=8, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=128, var_1_1=128, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L60] COND TRUE stepLocal_1 <= last_1_var_1_12 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=128, var_1_1=128, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L61] COND TRUE (var_1_4 - var_1_5) >= last_1_var_1_17 [L62] var_1_1 = var_1_7 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=128, var_1_1=254, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L68] COND FALSE !((((((~ var_1_1)) < (8)) ? ((~ var_1_1)) : (8))) > var_1_11) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=128, var_1_1=254, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L71] COND TRUE ! (var_1_17 > var_1_5) [L72] var_1_8 = (((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) - var_1_11) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=128, var_1_1=254, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_7=254, var_1_8=-2, var_1_9=126] [L76] unsigned long int stepLocal_4 = var_1_19; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_4=128, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=128, var_1_1=254, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_7=254, var_1_8=-2, var_1_9=126] [L77] COND FALSE !((var_1_18 / ((((5.5) > (var_1_22)) ? (5.5) : (var_1_22)))) > 10.5) [L88] var_1_21 = var_1_23 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_4=128, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=128, var_1_1=254, var_1_21=-256, var_1_23=-256, var_1_24=1, var_1_7=254, var_1_8=-2, var_1_9=126] [L90] unsigned char stepLocal_2 = var_1_21; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_2=-256, stepLocal_4=128, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=128, var_1_1=254, var_1_21=-256, var_1_23=-256, var_1_24=1, var_1_7=254, var_1_8=-2, var_1_9=126] [L91] COND FALSE !(var_1_21 && stepLocal_2) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_4=128, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=128, var_1_1=254, var_1_21=-256, var_1_23=-256, var_1_24=1, var_1_7=254, var_1_8=-2, var_1_9=126] [L94] COND FALSE !(\read(var_1_21)) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_4=128, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=128, var_1_1=254, var_1_21=-256, var_1_23=-256, var_1_24=1, var_1_7=254, var_1_8=-2, var_1_9=126] [L150] RET step() [L151] CALL, EXPR property() [L141-L142] return ((((((32u >= last_1_var_1_12) ? ((last_1_var_1_12 <= last_1_var_1_12) ? (((var_1_4 - var_1_5) >= last_1_var_1_17) ? (var_1_1 == ((unsigned char) var_1_7)) : 1) : 1) : (var_1_1 == ((unsigned char) var_1_7))) && ((! (var_1_17 > var_1_5)) ? (var_1_8 == ((signed char) (((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) - var_1_11))) : (var_1_8 == ((signed char) -4)))) && ((var_1_21 && var_1_21) ? (var_1_12 == ((unsigned long int) var_1_11)) : (var_1_21 ? (var_1_12 == ((unsigned long int) (((((var_1_19) > ((var_1_11 + var_1_7))) ? (var_1_19) : ((var_1_11 + var_1_7)))) + (var_1_15 - var_1_1)))) : 1))) && (((((((~ var_1_1)) < (8)) ? ((~ var_1_1)) : (8))) > var_1_11) ? (var_1_17 == ((double) var_1_18)) : 1)) && ((last_1_var_1_21 || (((((var_1_4) > (last_1_var_1_17)) ? (var_1_4) : (last_1_var_1_17))) > var_1_18)) ? ((var_1_18 > ((((last_1_var_1_17) < 0 ) ? -(last_1_var_1_17) : (last_1_var_1_17)))) ? (var_1_19 == ((unsigned long int) last_1_var_1_1)) : (var_1_19 == ((unsigned long int) var_1_11))) : (var_1_19 == ((unsigned long int) last_1_var_1_1)))) && (((var_1_18 / ((((5.5) > (var_1_22)) ? (5.5) : (var_1_22)))) > 10.5) ? (var_1_13 ? ((var_1_1 < var_1_19) ? (var_1_21 == ((unsigned char) (! var_1_23))) : (var_1_21 == ((unsigned char) var_1_24))) : (var_1_21 == ((unsigned char) var_1_23))) : (var_1_21 == ((unsigned char) var_1_23))) ; VAL [\result=0, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=128, var_1_1=254, var_1_21=-256, var_1_23=-256, var_1_24=1, var_1_7=254, var_1_8=-2, var_1_9=126] [L151] RET, EXPR property() [L151] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=128, var_1_1=254, var_1_21=-256, var_1_23=-256, var_1_24=1, var_1_7=254, var_1_8=-2, var_1_9=126] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=124, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1073741823, var_1_17=1284/5, var_1_19=128, var_1_1=254, var_1_21=-256, var_1_23=-256, var_1_24=1, var_1_7=254, var_1_8=-2, var_1_9=126] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 67 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.6s, OverallIterations: 8, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 617 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 590 mSDsluCounter, 1684 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1030 mSDsCounter, 397 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 713 IncrementalHoareTripleChecker+Invalid, 1110 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 397 mSolverCounterUnsat, 654 mSDtfsCounter, 713 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 920 GetRequests, 873 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=277occurred in iteration=4, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 7 MinimizatonAttempts, 276 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 1371 NumberOfCodeBlocks, 1371 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1497 ConstructedInterpolants, 0 QuantifiedInterpolants, 3143 SizeOfPredicates, 5 NumberOfNonLiveVariables, 648 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 11 InterpolantComputations, 5 PerfectInterpolantSequences, 9114/9240 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-13 13:28:20,121 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d436bfa6-461c-48ad-aea8-fcd5d20ccb13/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d436bfa6-461c-48ad-aea8-fcd5d20ccb13/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d436bfa6-461c-48ad-aea8-fcd5d20ccb13/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d436bfa6-461c-48ad-aea8-fcd5d20ccb13/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d436bfa6-461c-48ad-aea8-fcd5d20ccb13/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-51.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d436bfa6-461c-48ad-aea8-fcd5d20ccb13/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d436bfa6-461c-48ad-aea8-fcd5d20ccb13/bin/uautomizer-verify-qhAvR1uOyd --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4703bfd85786444b7063ad726d04e3dbfe77bfd14c478aa800342006bdde0646 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 13:28:23,206 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 13:28:23,310 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d436bfa6-461c-48ad-aea8-fcd5d20ccb13/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-13 13:28:23,317 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 13:28:23,317 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 13:28:23,398 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 13:28:23,398 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 13:28:23,399 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 13:28:23,399 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 13:28:23,399 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 13:28:23,400 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 13:28:23,400 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 13:28:23,400 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 13:28:23,400 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 13:28:23,401 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 13:28:23,401 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 13:28:23,401 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 13:28:23,403 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 13:28:23,411 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 13:28:23,411 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 13:28:23,411 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 13:28:23,411 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 13:28:23,411 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 13:28:23,412 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 13:28:23,412 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 13:28:23,412 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 13:28:23,412 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 13:28:23,412 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 13:28:23,412 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 13:28:23,412 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 13:28:23,412 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 13:28:23,412 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 13:28:23,412 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 13:28:23,413 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 13:28:23,413 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:28:23,413 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 13:28:23,413 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 13:28:23,413 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 13:28:23,413 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-13 13:28:23,413 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 13:28:23,413 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 13:28:23,413 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 13:28:23,413 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 13:28:23,413 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 13:28:23,414 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d436bfa6-461c-48ad-aea8-fcd5d20ccb13/bin/uautomizer-verify-qhAvR1uOyd Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4703bfd85786444b7063ad726d04e3dbfe77bfd14c478aa800342006bdde0646 [2024-11-13 13:28:23,753 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 13:28:23,765 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 13:28:23,768 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 13:28:23,770 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 13:28:23,770 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 13:28:23,775 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d436bfa6-461c-48ad-aea8-fcd5d20ccb13/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-51.i Unable to find full path for "g++" [2024-11-13 13:28:25,994 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 13:28:26,369 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 13:28:26,370 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d436bfa6-461c-48ad-aea8-fcd5d20ccb13/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-51.i [2024-11-13 13:28:26,383 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d436bfa6-461c-48ad-aea8-fcd5d20ccb13/bin/uautomizer-verify-qhAvR1uOyd/data/43dc14379/fd3426228ffa417c9a4237e317febdc2/FLAGc7f393fe6 [2024-11-13 13:28:26,410 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d436bfa6-461c-48ad-aea8-fcd5d20ccb13/bin/uautomizer-verify-qhAvR1uOyd/data/43dc14379/fd3426228ffa417c9a4237e317febdc2 [2024-11-13 13:28:26,413 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 13:28:26,417 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 13:28:26,420 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 13:28:26,421 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 13:28:26,427 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 13:28:26,429 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:28:26" (1/1) ... [2024-11-13 13:28:26,431 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@223ff30a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:28:26, skipping insertion in model container [2024-11-13 13:28:26,434 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:28:26" (1/1) ... [2024-11-13 13:28:26,467 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 13:28:26,672 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d436bfa6-461c-48ad-aea8-fcd5d20ccb13/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-51.i[913,926] [2024-11-13 13:28:26,792 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:28:26,816 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 13:28:26,832 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d436bfa6-461c-48ad-aea8-fcd5d20ccb13/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-51.i[913,926] [2024-11-13 13:28:26,898 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:28:26,927 INFO L204 MainTranslator]: Completed translation [2024-11-13 13:28:26,927 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:28:26 WrapperNode [2024-11-13 13:28:26,928 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 13:28:26,929 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 13:28:26,929 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 13:28:26,929 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 13:28:26,940 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:28:26" (1/1) ... [2024-11-13 13:28:26,961 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:28:26" (1/1) ... [2024-11-13 13:28:26,994 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 147 [2024-11-13 13:28:26,995 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 13:28:26,995 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 13:28:26,996 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 13:28:26,996 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 13:28:27,007 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:28:26" (1/1) ... [2024-11-13 13:28:27,007 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:28:26" (1/1) ... [2024-11-13 13:28:27,011 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:28:26" (1/1) ... [2024-11-13 13:28:27,026 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-13 13:28:27,027 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:28:26" (1/1) ... [2024-11-13 13:28:27,027 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:28:26" (1/1) ... [2024-11-13 13:28:27,039 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:28:26" (1/1) ... [2024-11-13 13:28:27,044 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:28:26" (1/1) ... [2024-11-13 13:28:27,047 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:28:26" (1/1) ... [2024-11-13 13:28:27,048 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:28:26" (1/1) ... [2024-11-13 13:28:27,052 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 13:28:27,054 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 13:28:27,054 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 13:28:27,054 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 13:28:27,055 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:28:26" (1/1) ... [2024-11-13 13:28:27,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:28:27,081 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d436bfa6-461c-48ad-aea8-fcd5d20ccb13/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:28:27,097 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d436bfa6-461c-48ad-aea8-fcd5d20ccb13/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 13:28:27,101 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d436bfa6-461c-48ad-aea8-fcd5d20ccb13/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 13:28:27,137 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 13:28:27,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-13 13:28:27,138 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 13:28:27,138 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 13:28:27,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 13:28:27,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 13:28:27,267 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 13:28:27,270 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 13:28:40,279 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-13 13:28:40,280 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 13:28:40,292 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 13:28:40,293 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 13:28:40,293 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:28:40 BoogieIcfgContainer [2024-11-13 13:28:40,293 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 13:28:40,296 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 13:28:40,296 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 13:28:40,304 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 13:28:40,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 01:28:26" (1/3) ... [2024-11-13 13:28:40,306 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c6cd288 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:28:40, skipping insertion in model container [2024-11-13 13:28:40,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:28:26" (2/3) ... [2024-11-13 13:28:40,306 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c6cd288 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:28:40, skipping insertion in model container [2024-11-13 13:28:40,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:28:40" (3/3) ... [2024-11-13 13:28:40,308 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-51.i [2024-11-13 13:28:40,330 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 13:28:40,332 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_normal_file-51.i that has 2 procedures, 67 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 13:28:40,398 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 13:28:40,418 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@19d4932d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 13:28:40,419 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 13:28:40,424 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 44 states have internal predecessors, (60), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-13 13:28:40,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-13 13:28:40,443 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:28:40,444 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:28:40,444 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:28:40,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:28:40,450 INFO L85 PathProgramCache]: Analyzing trace with hash -2033349918, now seen corresponding path program 1 times [2024-11-13 13:28:40,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:28:40,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1929558328] [2024-11-13 13:28:40,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:28:40,465 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:28:40,465 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d436bfa6-461c-48ad-aea8-fcd5d20ccb13/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 13:28:40,470 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d436bfa6-461c-48ad-aea8-fcd5d20ccb13/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 13:28:40,482 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d436bfa6-461c-48ad-aea8-fcd5d20ccb13/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-13 13:28:41,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:41,745 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-13 13:28:41,756 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:28:41,809 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 340 proven. 0 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked. [2024-11-13 13:28:41,811 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:28:41,811 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:28:41,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1929558328] [2024-11-13 13:28:41,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1929558328] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:28:41,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:28:41,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:28:41,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259807273] [2024-11-13 13:28:41,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:28:41,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 13:28:41,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:28:41,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 13:28:41,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 13:28:41,850 INFO L87 Difference]: Start difference. First operand has 67 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 44 states have internal predecessors, (60), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-13 13:28:41,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:28:41,882 INFO L93 Difference]: Finished difference Result 127 states and 219 transitions. [2024-11-13 13:28:41,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 13:28:41,885 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 135 [2024-11-13 13:28:41,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:28:41,893 INFO L225 Difference]: With dead ends: 127 [2024-11-13 13:28:41,894 INFO L226 Difference]: Without dead ends: 63 [2024-11-13 13:28:41,898 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 13:28:41,901 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:28:41,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:28:41,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-13 13:28:41,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-11-13 13:28:41,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 40 states have (on average 1.325) internal successors, (53), 40 states have internal predecessors, (53), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-13 13:28:41,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 95 transitions. [2024-11-13 13:28:41,974 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 95 transitions. Word has length 135 [2024-11-13 13:28:41,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:28:41,976 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 95 transitions. [2024-11-13 13:28:41,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-13 13:28:41,977 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 95 transitions. [2024-11-13 13:28:41,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-13 13:28:41,982 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:28:41,983 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:28:41,998 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d436bfa6-461c-48ad-aea8-fcd5d20ccb13/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-13 13:28:42,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d436bfa6-461c-48ad-aea8-fcd5d20ccb13/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:28:42,184 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:28:42,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:28:42,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1732673956, now seen corresponding path program 1 times [2024-11-13 13:28:42,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:28:42,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2002951270] [2024-11-13 13:28:42,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:28:42,186 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:28:42,186 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d436bfa6-461c-48ad-aea8-fcd5d20ccb13/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 13:28:42,189 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d436bfa6-461c-48ad-aea8-fcd5d20ccb13/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 13:28:42,191 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d436bfa6-461c-48ad-aea8-fcd5d20ccb13/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-13 13:28:43,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:28:43,333 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 13:28:43,340 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:28:45,729 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-13 13:28:45,729 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:28:45,729 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:28:45,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2002951270] [2024-11-13 13:28:45,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2002951270] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:28:45,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:28:45,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:28:45,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099326219] [2024-11-13 13:28:45,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:28:45,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:28:45,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:28:45,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:28:45,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:28:45,732 INFO L87 Difference]: Start difference. First operand 63 states and 95 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-13 13:28:50,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:28:54,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:28:58,568 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:29:02,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:29:06,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.94s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:29:07,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:29:07,043 INFO L93 Difference]: Finished difference Result 184 states and 280 transitions. [2024-11-13 13:29:07,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:29:07,132 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 135 [2024-11-13 13:29:07,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:29:07,135 INFO L225 Difference]: With dead ends: 184 [2024-11-13 13:29:07,135 INFO L226 Difference]: Without dead ends: 124 [2024-11-13 13:29:07,136 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:29:07,138 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 68 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 43 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:29:07,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 262 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 16 Invalid, 4 Unknown, 0 Unchecked, 21.2s Time] [2024-11-13 13:29:07,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-13 13:29:07,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 103. [2024-11-13 13:29:07,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 58 states have internal predecessors, (71), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-13 13:29:07,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 155 transitions. [2024-11-13 13:29:07,180 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 155 transitions. Word has length 135 [2024-11-13 13:29:07,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:29:07,181 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 155 transitions. [2024-11-13 13:29:07,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-13 13:29:07,181 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 155 transitions. [2024-11-13 13:29:07,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-13 13:29:07,184 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:29:07,184 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:29:07,206 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d436bfa6-461c-48ad-aea8-fcd5d20ccb13/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-13 13:29:07,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d436bfa6-461c-48ad-aea8-fcd5d20ccb13/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:29:07,385 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:29:07,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:29:07,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1284839648, now seen corresponding path program 1 times [2024-11-13 13:29:07,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:29:07,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [131882734] [2024-11-13 13:29:07,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:29:07,387 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:29:07,387 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d436bfa6-461c-48ad-aea8-fcd5d20ccb13/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 13:29:07,390 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d436bfa6-461c-48ad-aea8-fcd5d20ccb13/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 13:29:07,392 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d436bfa6-461c-48ad-aea8-fcd5d20ccb13/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-13 13:29:08,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:08,568 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 13:29:08,574 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:29:11,433 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-13 13:29:11,433 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:29:11,433 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:29:11,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [131882734] [2024-11-13 13:29:11,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [131882734] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:29:11,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:29:11,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:29:11,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678442130] [2024-11-13 13:29:11,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:29:11,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:29:11,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:29:11,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:29:11,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:29:11,437 INFO L87 Difference]: Start difference. First operand 103 states and 155 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-13 13:29:16,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.24s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:29:20,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:29:24,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:29:29,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:29:33,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:29:37,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.27s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:29:41,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:29:45,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:29:45,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:29:45,567 INFO L93 Difference]: Finished difference Result 230 states and 346 transitions. [2024-11-13 13:29:45,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 13:29:45,647 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 136 [2024-11-13 13:29:45,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:29:45,650 INFO L225 Difference]: With dead ends: 230 [2024-11-13 13:29:45,651 INFO L226 Difference]: Without dead ends: 170 [2024-11-13 13:29:45,651 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-13 13:29:45,652 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 78 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 43 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.9s IncrementalHoareTripleChecker+Time [2024-11-13 13:29:45,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 319 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 64 Invalid, 8 Unknown, 0 Unchecked, 33.9s Time] [2024-11-13 13:29:45,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-13 13:29:45,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 161. [2024-11-13 13:29:45,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 94 states have (on average 1.2659574468085106) internal successors, (119), 94 states have internal predecessors, (119), 63 states have call successors, (63), 3 states have call predecessors, (63), 3 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2024-11-13 13:29:45,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 245 transitions. [2024-11-13 13:29:45,687 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 245 transitions. Word has length 136 [2024-11-13 13:29:45,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:29:45,688 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 245 transitions. [2024-11-13 13:29:45,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-13 13:29:45,688 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 245 transitions. [2024-11-13 13:29:45,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-13 13:29:45,691 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:29:45,691 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:29:45,712 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d436bfa6-461c-48ad-aea8-fcd5d20ccb13/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-13 13:29:45,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d436bfa6-461c-48ad-aea8-fcd5d20ccb13/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:29:45,892 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:29:45,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:29:45,893 INFO L85 PathProgramCache]: Analyzing trace with hash -607065803, now seen corresponding path program 1 times [2024-11-13 13:29:45,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:29:45,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [636970568] [2024-11-13 13:29:45,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:29:45,894 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:29:45,894 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d436bfa6-461c-48ad-aea8-fcd5d20ccb13/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 13:29:45,899 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d436bfa6-461c-48ad-aea8-fcd5d20ccb13/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 13:29:45,902 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d436bfa6-461c-48ad-aea8-fcd5d20ccb13/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-13 13:29:46,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:29:46,899 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-13 13:29:46,904 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:29:47,009 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-13 13:29:47,009 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:29:47,009 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:29:47,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [636970568] [2024-11-13 13:29:47,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [636970568] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:29:47,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:29:47,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:29:47,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688362287] [2024-11-13 13:29:47,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:29:47,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:29:47,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:29:47,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:29:47,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:29:47,013 INFO L87 Difference]: Start difference. First operand 161 states and 245 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-13 13:29:51,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:29:55,681 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:29:59,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:29:59,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:29:59,686 INFO L93 Difference]: Finished difference Result 289 states and 444 transitions. [2024-11-13 13:29:59,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:29:59,768 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 137 [2024-11-13 13:29:59,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:29:59,771 INFO L225 Difference]: With dead ends: 289 [2024-11-13 13:29:59,771 INFO L226 Difference]: Without dead ends: 171 [2024-11-13 13:29:59,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:29:59,774 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 17 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.6s IncrementalHoareTripleChecker+Time [2024-11-13 13:29:59,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 193 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 3 Unknown, 0 Unchecked, 12.6s Time] [2024-11-13 13:29:59,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-13 13:29:59,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 161. [2024-11-13 13:29:59,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 94 states have (on average 1.2446808510638299) internal successors, (117), 94 states have internal predecessors, (117), 63 states have call successors, (63), 3 states have call predecessors, (63), 3 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2024-11-13 13:29:59,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 243 transitions. [2024-11-13 13:29:59,827 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 243 transitions. Word has length 137 [2024-11-13 13:29:59,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:29:59,828 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 243 transitions. [2024-11-13 13:29:59,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-13 13:29:59,830 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 243 transitions. [2024-11-13 13:29:59,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-13 13:29:59,837 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:29:59,837 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:29:59,857 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d436bfa6-461c-48ad-aea8-fcd5d20ccb13/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-13 13:30:00,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d436bfa6-461c-48ad-aea8-fcd5d20ccb13/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:30:00,039 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:30:00,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:30:00,039 INFO L85 PathProgramCache]: Analyzing trace with hash 98405429, now seen corresponding path program 1 times [2024-11-13 13:30:00,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:30:00,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1528229603] [2024-11-13 13:30:00,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:30:00,040 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:30:00,040 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d436bfa6-461c-48ad-aea8-fcd5d20ccb13/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 13:30:00,042 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d436bfa6-461c-48ad-aea8-fcd5d20ccb13/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 13:30:00,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d436bfa6-461c-48ad-aea8-fcd5d20ccb13/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-13 13:30:01,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:01,177 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 13:30:01,181 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:30:02,744 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 420 proven. 36 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2024-11-13 13:30:02,745 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:30:03,156 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:30:03,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1528229603] [2024-11-13 13:30:03,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1528229603] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:30:03,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396328849] [2024-11-13 13:30:03,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:30:03,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:30:03,157 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d436bfa6-461c-48ad-aea8-fcd5d20ccb13/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:30:03,163 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d436bfa6-461c-48ad-aea8-fcd5d20ccb13/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:30:03,166 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d436bfa6-461c-48ad-aea8-fcd5d20ccb13/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 13:30:03,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:03,827 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 13:30:03,830 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:30:05,193 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 420 proven. 36 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2024-11-13 13:30:05,193 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:30:05,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1396328849] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:30:05,436 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:30:05,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2024-11-13 13:30:05,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692822198] [2024-11-13 13:30:05,436 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:30:05,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:30:05,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:30:05,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:30:05,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 13:30:05,438 INFO L87 Difference]: Start difference. First operand 161 states and 243 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-13 13:30:11,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:30:15,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:30:19,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:30:19,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:30:19,306 INFO L93 Difference]: Finished difference Result 297 states and 438 transitions. [2024-11-13 13:30:19,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 13:30:19,308 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 138 [2024-11-13 13:30:19,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:30:19,311 INFO L225 Difference]: With dead ends: 297 [2024-11-13 13:30:19,311 INFO L226 Difference]: Without dead ends: 179 [2024-11-13 13:30:19,312 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-13 13:30:19,313 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 42 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 4 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.6s IncrementalHoareTripleChecker+Time [2024-11-13 13:30:19,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 152 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 126 Invalid, 3 Unknown, 0 Unchecked, 13.6s Time] [2024-11-13 13:30:19,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-13 13:30:19,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 173. [2024-11-13 13:30:19,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 103 states have (on average 1.203883495145631) internal successors, (124), 103 states have internal predecessors, (124), 63 states have call successors, (63), 6 states have call predecessors, (63), 6 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2024-11-13 13:30:19,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 250 transitions. [2024-11-13 13:30:19,348 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 250 transitions. Word has length 138 [2024-11-13 13:30:19,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:30:19,348 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 250 transitions. [2024-11-13 13:30:19,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-13 13:30:19,349 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 250 transitions. [2024-11-13 13:30:19,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-13 13:30:19,351 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:30:19,352 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:30:19,374 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d436bfa6-461c-48ad-aea8-fcd5d20ccb13/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-13 13:30:19,599 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d436bfa6-461c-48ad-aea8-fcd5d20ccb13/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-13 13:30:19,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d436bfa6-461c-48ad-aea8-fcd5d20ccb13/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d436bfa6-461c-48ad-aea8-fcd5d20ccb13/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:30:19,753 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:30:19,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:30:19,754 INFO L85 PathProgramCache]: Analyzing trace with hash -294621581, now seen corresponding path program 1 times [2024-11-13 13:30:19,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:30:19,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1961976029] [2024-11-13 13:30:19,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:30:19,754 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:30:19,754 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d436bfa6-461c-48ad-aea8-fcd5d20ccb13/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 13:30:19,756 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d436bfa6-461c-48ad-aea8-fcd5d20ccb13/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 13:30:19,758 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d436bfa6-461c-48ad-aea8-fcd5d20ccb13/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-13 13:30:20,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:30:21,007 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 13:30:21,011 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:30:21,761 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 200 proven. 6 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2024-11-13 13:30:21,761 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:30:23,385 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 54 proven. 6 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-13 13:30:23,385 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:30:23,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1961976029] [2024-11-13 13:30:23,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1961976029] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:30:23,385 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:30:23,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2024-11-13 13:30:23,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424943883] [2024-11-13 13:30:23,386 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:30:23,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 13:30:23,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:30:23,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 13:30:23,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-13 13:30:23,388 INFO L87 Difference]: Start difference. First operand 173 states and 250 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-13 13:30:29,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:30:32,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.90s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:30:37,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:30:41,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:30:44,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.21s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:30:48,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:30:52,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:30:59,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:31:03,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:31:07,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:31:08,538 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:31:08,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:31:08,696 INFO L93 Difference]: Finished difference Result 347 states and 486 transitions. [2024-11-13 13:31:08,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-13 13:31:08,697 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 138 [2024-11-13 13:31:08,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:31:08,701 INFO L225 Difference]: With dead ends: 347 [2024-11-13 13:31:08,701 INFO L226 Difference]: Without dead ends: 283 [2024-11-13 13:31:08,702 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 267 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=122, Invalid=298, Unknown=0, NotChecked=0, Total=420 [2024-11-13 13:31:08,703 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 158 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 78 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 43.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 44.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:31:08,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 432 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 359 Invalid, 8 Unknown, 0 Unchecked, 44.2s Time] [2024-11-13 13:31:08,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-11-13 13:31:08,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 191. [2024-11-13 13:31:08,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 118 states have (on average 1.1779661016949152) internal successors, (139), 118 states have internal predecessors, (139), 63 states have call successors, (63), 9 states have call predecessors, (63), 9 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2024-11-13 13:31:08,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 265 transitions. [2024-11-13 13:31:08,780 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 265 transitions. Word has length 138 [2024-11-13 13:31:08,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:31:08,781 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 265 transitions. [2024-11-13 13:31:08,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-13 13:31:08,781 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 265 transitions. [2024-11-13 13:31:08,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-13 13:31:08,784 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:31:08,784 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:31:08,807 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d436bfa6-461c-48ad-aea8-fcd5d20ccb13/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-13 13:31:08,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d436bfa6-461c-48ad-aea8-fcd5d20ccb13/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:31:08,985 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:31:08,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:31:08,985 INFO L85 PathProgramCache]: Analyzing trace with hash -487985556, now seen corresponding path program 1 times [2024-11-13 13:31:08,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:31:08,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1716248162] [2024-11-13 13:31:08,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:31:08,986 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 13:31:08,986 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d436bfa6-461c-48ad-aea8-fcd5d20ccb13/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 13:31:08,988 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d436bfa6-461c-48ad-aea8-fcd5d20ccb13/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 13:31:08,990 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d436bfa6-461c-48ad-aea8-fcd5d20ccb13/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-13 13:31:10,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:31:10,205 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-13 13:31:10,209 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:31:32,336 WARN L286 SmtUtils]: Spent 8.42s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:31:40,700 WARN L286 SmtUtils]: Spent 8.36s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:31:49,076 WARN L286 SmtUtils]: Spent 8.38s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:31:57,449 WARN L286 SmtUtils]: Spent 8.37s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:32:05,844 WARN L286 SmtUtils]: Spent 8.39s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:32:14,222 WARN L286 SmtUtils]: Spent 8.38s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:32:22,611 WARN L286 SmtUtils]: Spent 8.39s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:32:35,748 WARN L286 SmtUtils]: Spent 8.37s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:32:43,895 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:32:52,317 WARN L286 SmtUtils]: Spent 8.42s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:33:00,739 WARN L286 SmtUtils]: Spent 8.42s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:33:09,117 WARN L286 SmtUtils]: Spent 8.38s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:33:17,496 WARN L286 SmtUtils]: Spent 8.38s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:33:25,888 WARN L286 SmtUtils]: Spent 8.39s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:33:34,272 WARN L286 SmtUtils]: Spent 8.38s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:33:42,392 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:33:50,782 WARN L286 SmtUtils]: Spent 8.39s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:33:59,172 WARN L286 SmtUtils]: Spent 8.39s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:34:07,539 WARN L286 SmtUtils]: Spent 8.37s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:34:15,868 WARN L286 SmtUtils]: Spent 8.33s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:34:19,963 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 ((_ to_fp 11 53) c_currentRoundingMode (/ 11.0 2.0)))) (let ((.cse6 (fp.gt .cse7 c_~var_1_22~0)) (.cse5 ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 2.0))) (.cse4 ((_ sign_extend 24) c_~var_1_11~0))) (and (= c_~var_1_23~0 c_~var_1_21~0) (= c_~var_1_7~0 c_~var_1_1~0) (let ((.cse3 ((_ sign_extend 24) c_~var_1_9~0)) (.cse2 ((_ sign_extend 24) c_~var_1_10~0))) (let ((.cse1 (bvneg .cse4)) (.cse0 (bvslt .cse3 .cse2))) (or (and (not .cse0) (= ((_ extract 7 0) (bvadd .cse1 .cse2)) c_~var_1_8~0)) (and (= ((_ extract 7 0) (bvadd .cse3 .cse1)) c_~var_1_8~0) .cse0)))) (= (_ bv1 8) c_~last_1_var_1_21~0) (or (not (fp.gt (fp.div c_currentRoundingMode c_~var_1_18~0 c_~var_1_22~0) .cse5)) .cse6) (bvsle ((_ zero_extend 24) c_~var_1_23~0) (_ bv0 32)) (or (not .cse6) (not (fp.gt (fp.div c_currentRoundingMode c_~var_1_18~0 .cse7) .cse5))) (= (_ bv8 32) c_~var_1_12~0) (= (_ bv8 32) c_~last_1_var_1_12~0) (not (fp.gt c_~var_1_17~0 c_~var_1_5~0)) (= c_~var_1_19~0 ((_ zero_extend 24) c_~last_1_var_1_1~0)) (let ((.cse8 (fp.lt c_~last_1_var_1_17~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))) (or (and (fp.gt c_~var_1_18~0 (fp.neg c_~last_1_var_1_17~0)) .cse8) (and (not .cse8) (fp.gt c_~var_1_18~0 c_~last_1_var_1_17~0)))) (bvsge .cse4 (_ bv0 32))))) is different from false [2024-11-13 13:34:24,076 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse7 ((_ to_fp 11 53) c_currentRoundingMode (/ 11.0 2.0)))) (let ((.cse6 (fp.gt .cse7 c_~var_1_22~0)) (.cse5 ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 2.0))) (.cse4 ((_ sign_extend 24) c_~var_1_11~0))) (and (= c_~var_1_23~0 c_~var_1_21~0) (= c_~var_1_7~0 c_~var_1_1~0) (let ((.cse3 ((_ sign_extend 24) c_~var_1_9~0)) (.cse2 ((_ sign_extend 24) c_~var_1_10~0))) (let ((.cse1 (bvneg .cse4)) (.cse0 (bvslt .cse3 .cse2))) (or (and (not .cse0) (= ((_ extract 7 0) (bvadd .cse1 .cse2)) c_~var_1_8~0)) (and (= ((_ extract 7 0) (bvadd .cse3 .cse1)) c_~var_1_8~0) .cse0)))) (= (_ bv1 8) c_~last_1_var_1_21~0) (or (not (fp.gt (fp.div c_currentRoundingMode c_~var_1_18~0 c_~var_1_22~0) .cse5)) .cse6) (bvsle ((_ zero_extend 24) c_~var_1_23~0) (_ bv0 32)) (or (not .cse6) (not (fp.gt (fp.div c_currentRoundingMode c_~var_1_18~0 .cse7) .cse5))) (= (_ bv8 32) c_~var_1_12~0) (= (_ bv8 32) c_~last_1_var_1_12~0) (not (fp.gt c_~var_1_17~0 c_~var_1_5~0)) (= c_~var_1_19~0 ((_ zero_extend 24) c_~last_1_var_1_1~0)) (let ((.cse8 (fp.lt c_~last_1_var_1_17~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))) (or (and (fp.gt c_~var_1_18~0 (fp.neg c_~last_1_var_1_17~0)) .cse8) (and (not .cse8) (fp.gt c_~var_1_18~0 c_~last_1_var_1_17~0)))) (bvsge .cse4 (_ bv0 32))))) is different from true [2024-11-13 13:34:32,479 WARN L286 SmtUtils]: Spent 8.38s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:34:40,922 WARN L286 SmtUtils]: Spent 8.44s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:34:49,316 WARN L286 SmtUtils]: Spent 8.39s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:34:57,707 WARN L286 SmtUtils]: Spent 8.39s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:35:06,111 WARN L286 SmtUtils]: Spent 8.40s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:35:14,525 WARN L286 SmtUtils]: Spent 8.41s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:35:22,959 WARN L286 SmtUtils]: Spent 8.43s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:35:35,102 WARN L286 SmtUtils]: Spent 8.31s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:35:43,247 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:35:51,640 WARN L286 SmtUtils]: Spent 8.39s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:35:59,957 WARN L286 SmtUtils]: Spent 8.32s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:36:08,319 WARN L286 SmtUtils]: Spent 8.36s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:36:16,672 WARN L286 SmtUtils]: Spent 8.35s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:36:25,096 WARN L286 SmtUtils]: Spent 8.42s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:36:33,462 WARN L286 SmtUtils]: Spent 8.37s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:36:41,908 WARN L286 SmtUtils]: Spent 8.44s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:36:50,284 WARN L286 SmtUtils]: Spent 8.38s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:36:58,650 WARN L286 SmtUtils]: Spent 8.37s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:37:07,025 WARN L286 SmtUtils]: Spent 8.37s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:37:15,383 WARN L286 SmtUtils]: Spent 8.36s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:37:22,659 WARN L286 SmtUtils]: Spent 7.25s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:37:31,068 WARN L286 SmtUtils]: Spent 8.41s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:37:39,419 WARN L286 SmtUtils]: Spent 8.35s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:37:47,931 WARN L286 SmtUtils]: Spent 8.51s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:37:56,303 WARN L286 SmtUtils]: Spent 8.37s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:38:04,714 WARN L286 SmtUtils]: Spent 8.41s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:38:13,106 WARN L286 SmtUtils]: Spent 8.39s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:38:25,097 WARN L286 SmtUtils]: Spent 8.39s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:38:33,253 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:38:41,627 WARN L286 SmtUtils]: Spent 8.37s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:38:50,023 WARN L286 SmtUtils]: Spent 8.40s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:38:58,366 WARN L286 SmtUtils]: Spent 8.34s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:39:06,693 WARN L286 SmtUtils]: Spent 8.33s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:39:15,033 WARN L286 SmtUtils]: Spent 8.34s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:39:23,350 WARN L286 SmtUtils]: Spent 8.32s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:39:31,663 WARN L286 SmtUtils]: Spent 8.31s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:39:39,999 WARN L286 SmtUtils]: Spent 8.34s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:39:48,443 WARN L286 SmtUtils]: Spent 8.44s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:39:56,769 WARN L286 SmtUtils]: Spent 8.33s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:40:05,099 WARN L286 SmtUtils]: Spent 8.33s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:40:13,422 WARN L286 SmtUtils]: Spent 8.31s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:40:21,748 WARN L286 SmtUtils]: Spent 8.33s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:40:30,059 WARN L286 SmtUtils]: Spent 8.31s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:40:38,388 WARN L286 SmtUtils]: Spent 8.33s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:40:46,698 WARN L286 SmtUtils]: Spent 8.31s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:40:55,041 WARN L286 SmtUtils]: Spent 8.34s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:41:03,383 WARN L286 SmtUtils]: Spent 8.34s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:41:14,497 WARN L286 SmtUtils]: Spent 8.31s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:41:27,674 WARN L286 SmtUtils]: Spent 8.39s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:41:35,992 WARN L286 SmtUtils]: Spent 8.32s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:41:44,311 WARN L286 SmtUtils]: Spent 8.32s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:41:52,620 WARN L286 SmtUtils]: Spent 8.31s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:42:00,948 WARN L286 SmtUtils]: Spent 8.33s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:42:13,813 WARN L286 SmtUtils]: Spent 8.36s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:42:22,124 WARN L286 SmtUtils]: Spent 8.31s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:42:30,441 WARN L286 SmtUtils]: Spent 8.32s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:42:38,763 WARN L286 SmtUtils]: Spent 8.32s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 13:42:47,075 WARN L286 SmtUtils]: Spent 8.31s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)