./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-78.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_251c88a3-36cc-4df0-af0a-b3359713e67d/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251c88a3-36cc-4df0-af0a-b3359713e67d/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_251c88a3-36cc-4df0-af0a-b3359713e67d/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251c88a3-36cc-4df0-af0a-b3359713e67d/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-78.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251c88a3-36cc-4df0-af0a-b3359713e67d/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_251c88a3-36cc-4df0-af0a-b3359713e67d/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 cb935426deff6dbed173fe3e44e993749aecd47418756b352860ce0f63ea8b54 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 15:32:33,513 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 15:32:33,632 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251c88a3-36cc-4df0-af0a-b3359713e67d/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 15:32:33,639 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 15:32:33,640 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 15:32:33,674 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 15:32:33,675 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 15:32:33,675 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 15:32:33,676 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 15:32:33,676 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 15:32:33,676 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 15:32:33,676 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 15:32:33,677 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 15:32:33,677 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 15:32:33,677 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 15:32:33,678 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 15:32:33,678 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 15:32:33,678 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 15:32:33,678 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 15:32:33,679 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 15:32:33,679 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 15:32:33,679 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 15:32:33,679 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 15:32:33,679 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 15:32:33,679 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 15:32:33,679 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 15:32:33,680 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 15:32:33,680 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 15:32:33,680 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 15:32:33,680 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 15:32:33,680 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 15:32:33,680 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 15:32:33,680 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:32:33,680 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 15:32:33,681 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 15:32:33,681 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 15:32:33,681 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 15:32:33,681 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 15:32:33,681 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 15:32:33,681 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 15:32:33,681 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 15:32:33,681 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 15:32:33,681 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_251c88a3-36cc-4df0-af0a-b3359713e67d/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 -> cb935426deff6dbed173fe3e44e993749aecd47418756b352860ce0f63ea8b54 [2024-11-13 15:32:34,142 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 15:32:34,157 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 15:32:34,165 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 15:32:34,167 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 15:32:34,168 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 15:32:34,171 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251c88a3-36cc-4df0-af0a-b3359713e67d/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-78.i Unable to find full path for "g++" [2024-11-13 15:32:37,034 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 15:32:37,552 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 15:32:37,553 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251c88a3-36cc-4df0-af0a-b3359713e67d/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-78.i [2024-11-13 15:32:37,564 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251c88a3-36cc-4df0-af0a-b3359713e67d/bin/uautomizer-verify-qhAvR1uOyd/data/c52564208/59f860718cc54ca9b73852cca9808d87/FLAG82bbdedcf [2024-11-13 15:32:37,583 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251c88a3-36cc-4df0-af0a-b3359713e67d/bin/uautomizer-verify-qhAvR1uOyd/data/c52564208/59f860718cc54ca9b73852cca9808d87 [2024-11-13 15:32:37,587 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 15:32:37,589 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 15:32:37,591 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 15:32:37,591 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 15:32:37,598 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 15:32:37,599 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:32:37" (1/1) ... [2024-11-13 15:32:37,600 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e938dce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:32:37, skipping insertion in model container [2024-11-13 15:32:37,601 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:32:37" (1/1) ... [2024-11-13 15:32:37,638 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 15:32:37,836 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_251c88a3-36cc-4df0-af0a-b3359713e67d/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-78.i[915,928] [2024-11-13 15:32:37,970 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:32:37,989 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 15:32:38,002 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_251c88a3-36cc-4df0-af0a-b3359713e67d/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-78.i[915,928] [2024-11-13 15:32:38,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:32:38,106 INFO L204 MainTranslator]: Completed translation [2024-11-13 15:32:38,106 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:32:38 WrapperNode [2024-11-13 15:32:38,107 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 15:32:38,112 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 15:32:38,113 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 15:32:38,113 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 15:32:38,124 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:32:38" (1/1) ... [2024-11-13 15:32:38,143 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:32:38" (1/1) ... [2024-11-13 15:32:38,225 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 206 [2024-11-13 15:32:38,226 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 15:32:38,226 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 15:32:38,227 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 15:32:38,227 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 15:32:38,240 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:32:38" (1/1) ... [2024-11-13 15:32:38,240 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:32:38" (1/1) ... [2024-11-13 15:32:38,255 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:32:38" (1/1) ... [2024-11-13 15:32:38,298 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 15:32:38,298 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:32:38" (1/1) ... [2024-11-13 15:32:38,298 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:32:38" (1/1) ... [2024-11-13 15:32:38,329 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:32:38" (1/1) ... [2024-11-13 15:32:38,337 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:32:38" (1/1) ... [2024-11-13 15:32:38,348 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:32:38" (1/1) ... [2024-11-13 15:32:38,353 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:32:38" (1/1) ... [2024-11-13 15:32:38,364 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 15:32:38,366 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 15:32:38,367 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 15:32:38,367 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 15:32:38,369 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:32:38" (1/1) ... [2024-11-13 15:32:38,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:32:38,410 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251c88a3-36cc-4df0-af0a-b3359713e67d/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:32:38,428 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251c88a3-36cc-4df0-af0a-b3359713e67d/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 15:32:38,433 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251c88a3-36cc-4df0-af0a-b3359713e67d/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 15:32:38,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 15:32:38,471 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 15:32:38,472 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 15:32:38,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 15:32:38,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 15:32:38,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 15:32:38,628 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 15:32:38,631 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 15:32:39,438 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-11-13 15:32:39,439 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 15:32:39,460 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 15:32:39,464 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 15:32:39,465 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:32:39 BoogieIcfgContainer [2024-11-13 15:32:39,465 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 15:32:39,470 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 15:32:39,471 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 15:32:39,478 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 15:32:39,478 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 03:32:37" (1/3) ... [2024-11-13 15:32:39,479 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c68855b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:32:39, skipping insertion in model container [2024-11-13 15:32:39,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:32:38" (2/3) ... [2024-11-13 15:32:39,480 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c68855b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:32:39, skipping insertion in model container [2024-11-13 15:32:39,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:32:39" (3/3) ... [2024-11-13 15:32:39,483 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-78.i [2024-11-13 15:32:39,505 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 15:32:39,508 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-78.i that has 2 procedures, 83 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 15:32:39,588 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 15:32:39,604 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;@481a8e2c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 15:32:39,605 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 15:32:39,610 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 60 states have (on average 1.4166666666666667) internal successors, (85), 61 states have internal predecessors, (85), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-13 15:32:39,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-13 15:32:39,627 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:32:39,628 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:32:39,628 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:32:39,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:32:39,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1198045531, now seen corresponding path program 1 times [2024-11-13 15:32:39,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:32:39,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722086394] [2024-11-13 15:32:39,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:32:39,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:32:39,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:40,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:32:40,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:40,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 15:32:40,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:40,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 15:32:40,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:40,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 15:32:40,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:40,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 15:32:40,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:40,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 15:32:40,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:40,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-13 15:32:40,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:40,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 15:32:40,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:40,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 15:32:40,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:40,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-13 15:32:40,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:40,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-13 15:32:40,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:40,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-13 15:32:40,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:40,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-13 15:32:40,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:40,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-13 15:32:40,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:40,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 15:32:40,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:40,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-13 15:32:40,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:40,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-13 15:32:40,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:40,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-13 15:32:40,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:40,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-13 15:32:40,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:40,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-13 15:32:40,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:40,360 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-13 15:32:40,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:32:40,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722086394] [2024-11-13 15:32:40,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722086394] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:32:40,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:32:40,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:32:40,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692350534] [2024-11-13 15:32:40,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:32:40,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 15:32:40,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:32:40,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 15:32:40,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 15:32:40,415 INFO L87 Difference]: Start difference. First operand has 83 states, 60 states have (on average 1.4166666666666667) internal successors, (85), 61 states have internal predecessors, (85), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-13 15:32:40,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:32:40,475 INFO L93 Difference]: Finished difference Result 159 states and 264 transitions. [2024-11-13 15:32:40,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 15:32:40,479 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 137 [2024-11-13 15:32:40,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:32:40,492 INFO L225 Difference]: With dead ends: 159 [2024-11-13 15:32:40,493 INFO L226 Difference]: Without dead ends: 79 [2024-11-13 15:32:40,501 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 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 15:32:40,506 INFO L432 NwaCegarLoop]: 118 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, 118 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 15:32:40,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:32:40,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-13 15:32:40,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-13 15:32:40,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 57 states have (on average 1.368421052631579) internal successors, (78), 57 states have internal predecessors, (78), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-13 15:32:40,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 118 transitions. [2024-11-13 15:32:40,602 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 118 transitions. Word has length 137 [2024-11-13 15:32:40,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:32:40,603 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 118 transitions. [2024-11-13 15:32:40,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-13 15:32:40,603 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 118 transitions. [2024-11-13 15:32:40,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-13 15:32:40,607 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:32:40,608 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:32:40,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 15:32:40,611 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:32:40,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:32:40,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1755042521, now seen corresponding path program 1 times [2024-11-13 15:32:40,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:32:40,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836198627] [2024-11-13 15:32:40,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:32:40,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:32:40,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:41,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:32:41,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:41,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 15:32:41,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:41,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 15:32:41,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:41,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 15:32:41,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:41,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 15:32:41,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:41,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 15:32:41,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:41,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-13 15:32:41,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:41,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 15:32:41,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:41,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 15:32:41,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:41,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-13 15:32:41,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:41,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-13 15:32:41,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:41,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-13 15:32:41,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:41,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-13 15:32:41,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:41,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-13 15:32:41,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:41,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 15:32:41,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:41,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-13 15:32:41,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:41,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-13 15:32:41,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:41,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-13 15:32:41,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:41,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-13 15:32:41,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:41,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-13 15:32:41,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:41,581 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-13 15:32:41,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:32:41,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836198627] [2024-11-13 15:32:41,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836198627] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:32:41,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:32:41,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:32:41,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043162856] [2024-11-13 15:32:41,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:32:41,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:32:41,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:32:41,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:32:41,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:32:41,588 INFO L87 Difference]: Start difference. First operand 79 states and 118 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 15:32:41,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:32:41,690 INFO L93 Difference]: Finished difference Result 155 states and 233 transitions. [2024-11-13 15:32:41,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:32:41,695 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 137 [2024-11-13 15:32:41,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:32:41,698 INFO L225 Difference]: With dead ends: 155 [2024-11-13 15:32:41,701 INFO L226 Difference]: Without dead ends: 79 [2024-11-13 15:32:41,702 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:32:41,703 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 0 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:32:41,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 337 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:32:41,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-13 15:32:41,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-13 15:32:41,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 57 states have (on average 1.3508771929824561) internal successors, (77), 57 states have internal predecessors, (77), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-13 15:32:41,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 117 transitions. [2024-11-13 15:32:41,734 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 117 transitions. Word has length 137 [2024-11-13 15:32:41,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:32:41,740 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 117 transitions. [2024-11-13 15:32:41,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 15:32:41,741 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 117 transitions. [2024-11-13 15:32:41,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-13 15:32:41,746 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:32:41,747 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:32:41,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 15:32:41,747 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:32:41,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:32:41,748 INFO L85 PathProgramCache]: Analyzing trace with hash 65827693, now seen corresponding path program 1 times [2024-11-13 15:32:41,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:32:41,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865244832] [2024-11-13 15:32:41,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:32:41,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:32:41,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:42,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:32:42,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:42,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 15:32:42,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:42,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 15:32:42,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:42,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 15:32:42,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:42,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 15:32:42,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:42,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 15:32:42,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:42,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-13 15:32:42,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:42,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 15:32:42,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:42,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 15:32:42,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:42,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-13 15:32:42,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:42,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-13 15:32:42,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:42,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-13 15:32:42,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:42,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-13 15:32:42,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:42,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-13 15:32:42,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:42,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 15:32:42,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:42,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-13 15:32:42,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:42,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-13 15:32:42,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:42,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-13 15:32:42,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:42,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-13 15:32:42,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:42,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-13 15:32:42,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:42,543 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-13 15:32:42,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:32:42,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865244832] [2024-11-13 15:32:42,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865244832] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:32:42,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:32:42,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:32:42,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727178932] [2024-11-13 15:32:42,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:32:42,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:32:42,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:32:42,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:32:42,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:32:42,550 INFO L87 Difference]: Start difference. First operand 79 states and 117 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 15:32:42,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:32:42,954 INFO L93 Difference]: Finished difference Result 232 states and 346 transitions. [2024-11-13 15:32:42,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:32:42,956 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 138 [2024-11-13 15:32:42,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:32:42,960 INFO L225 Difference]: With dead ends: 232 [2024-11-13 15:32:42,963 INFO L226 Difference]: Without dead ends: 156 [2024-11-13 15:32:42,964 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 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 15:32:42,966 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 89 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 15:32:42,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 308 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 15:32:42,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-13 15:32:43,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 139. [2024-11-13 15:32:43,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 96 states have (on average 1.3333333333333333) internal successors, (128), 96 states have internal predecessors, (128), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-13 15:32:43,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 208 transitions. [2024-11-13 15:32:43,035 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 208 transitions. Word has length 138 [2024-11-13 15:32:43,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:32:43,038 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 208 transitions. [2024-11-13 15:32:43,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 15:32:43,042 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 208 transitions. [2024-11-13 15:32:43,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-13 15:32:43,045 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:32:43,049 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:32:43,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 15:32:43,049 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:32:43,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:32:43,050 INFO L85 PathProgramCache]: Analyzing trace with hash -987289531, now seen corresponding path program 1 times [2024-11-13 15:32:43,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:32:43,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379766787] [2024-11-13 15:32:43,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:32:43,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:32:43,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:43,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:32:43,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:43,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 15:32:43,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:43,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 15:32:43,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:43,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 15:32:43,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:43,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 15:32:43,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:43,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 15:32:43,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:43,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-13 15:32:43,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:43,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 15:32:43,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:43,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 15:32:43,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:43,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-13 15:32:43,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:43,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-13 15:32:43,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:43,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-13 15:32:43,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:43,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-13 15:32:43,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:43,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-13 15:32:43,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:43,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 15:32:43,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:43,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-13 15:32:43,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:43,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-13 15:32:43,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:43,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-13 15:32:43,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:43,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-13 15:32:43,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:43,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-13 15:32:43,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:43,710 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-13 15:32:43,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:32:43,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379766787] [2024-11-13 15:32:43,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379766787] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:32:43,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:32:43,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:32:43,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292661831] [2024-11-13 15:32:43,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:32:43,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:32:43,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:32:43,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:32:43,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:32:43,717 INFO L87 Difference]: Start difference. First operand 139 states and 208 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 15:32:44,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:32:44,137 INFO L93 Difference]: Finished difference Result 329 states and 490 transitions. [2024-11-13 15:32:44,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:32:44,138 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 139 [2024-11-13 15:32:44,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:32:44,146 INFO L225 Difference]: With dead ends: 329 [2024-11-13 15:32:44,147 INFO L226 Difference]: Without dead ends: 238 [2024-11-13 15:32:44,148 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 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 15:32:44,151 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 127 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 15:32:44,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 335 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 15:32:44,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-11-13 15:32:44,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 220. [2024-11-13 15:32:44,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 156 states have (on average 1.3333333333333333) internal successors, (208), 156 states have internal predecessors, (208), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-13 15:32:44,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 328 transitions. [2024-11-13 15:32:44,257 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 328 transitions. Word has length 139 [2024-11-13 15:32:44,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:32:44,258 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 328 transitions. [2024-11-13 15:32:44,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 15:32:44,259 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 328 transitions. [2024-11-13 15:32:44,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-13 15:32:44,264 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:32:44,268 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:32:44,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 15:32:44,269 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:32:44,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:32:44,269 INFO L85 PathProgramCache]: Analyzing trace with hash 35420424, now seen corresponding path program 1 times [2024-11-13 15:32:44,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:32:44,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470964048] [2024-11-13 15:32:44,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:32:44,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:32:44,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:44,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:32:44,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:44,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 15:32:44,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:44,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 15:32:44,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:44,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 15:32:44,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:44,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 15:32:44,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:44,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 15:32:44,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:44,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-13 15:32:44,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:44,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 15:32:44,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:44,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 15:32:44,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:44,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-13 15:32:44,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:44,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-13 15:32:44,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:44,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-13 15:32:44,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:44,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-13 15:32:44,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:44,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-13 15:32:44,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:44,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 15:32:44,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:44,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-13 15:32:44,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:44,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-13 15:32:44,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:44,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-13 15:32:44,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:44,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-13 15:32:44,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:44,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-13 15:32:44,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:44,996 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-13 15:32:44,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:32:44,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470964048] [2024-11-13 15:32:44,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470964048] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:32:44,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:32:44,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-13 15:32:44,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309514635] [2024-11-13 15:32:44,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:32:44,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 15:32:44,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:32:44,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 15:32:45,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:32:45,000 INFO L87 Difference]: Start difference. First operand 220 states and 328 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 15:32:45,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:32:45,641 INFO L93 Difference]: Finished difference Result 617 states and 911 transitions. [2024-11-13 15:32:45,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 15:32:45,642 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 140 [2024-11-13 15:32:45,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:32:45,650 INFO L225 Difference]: With dead ends: 617 [2024-11-13 15:32:45,650 INFO L226 Difference]: Without dead ends: 456 [2024-11-13 15:32:45,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-11-13 15:32:45,653 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 278 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 15:32:45,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 677 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 15:32:45,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2024-11-13 15:32:45,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 390. [2024-11-13 15:32:45,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 284 states have (on average 1.352112676056338) internal successors, (384), 284 states have internal predecessors, (384), 100 states have call successors, (100), 5 states have call predecessors, (100), 5 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-13 15:32:45,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 584 transitions. [2024-11-13 15:32:45,792 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 584 transitions. Word has length 140 [2024-11-13 15:32:45,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:32:45,792 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 584 transitions. [2024-11-13 15:32:45,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 15:32:45,793 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 584 transitions. [2024-11-13 15:32:45,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-13 15:32:45,799 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:32:45,799 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:32:45,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 15:32:45,800 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:32:45,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:32:45,801 INFO L85 PathProgramCache]: Analyzing trace with hash -357606586, now seen corresponding path program 1 times [2024-11-13 15:32:45,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:32:45,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441965133] [2024-11-13 15:32:45,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:32:45,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:32:45,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:46,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:32:46,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:46,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 15:32:46,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:46,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 15:32:46,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:46,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 15:32:46,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:46,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 15:32:46,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:46,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 15:32:46,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:46,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-13 15:32:46,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:46,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 15:32:46,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:46,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 15:32:46,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:46,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-13 15:32:46,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:46,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-13 15:32:46,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:46,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-13 15:32:46,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:46,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-13 15:32:46,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:46,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-13 15:32:46,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:46,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 15:32:46,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:46,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-13 15:32:46,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:46,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-13 15:32:46,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:46,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-13 15:32:46,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:46,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-13 15:32:46,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:46,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-13 15:32:46,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:46,537 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-13 15:32:46,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:32:46,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441965133] [2024-11-13 15:32:46,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441965133] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:32:46,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:32:46,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:32:46,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045620655] [2024-11-13 15:32:46,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:32:46,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:32:46,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:32:46,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:32:46,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:32:46,541 INFO L87 Difference]: Start difference. First operand 390 states and 584 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 15:32:46,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:32:46,963 INFO L93 Difference]: Finished difference Result 794 states and 1179 transitions. [2024-11-13 15:32:46,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:32:46,964 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 140 [2024-11-13 15:32:46,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:32:46,971 INFO L225 Difference]: With dead ends: 794 [2024-11-13 15:32:46,971 INFO L226 Difference]: Without dead ends: 452 [2024-11-13 15:32:46,976 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 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 15:32:46,977 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 81 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 15:32:46,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 308 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 15:32:46,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2024-11-13 15:32:47,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 398. [2024-11-13 15:32:47,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 292 states have (on average 1.3390410958904109) internal successors, (391), 292 states have internal predecessors, (391), 100 states have call successors, (100), 5 states have call predecessors, (100), 5 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-13 15:32:47,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 591 transitions. [2024-11-13 15:32:47,088 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 591 transitions. Word has length 140 [2024-11-13 15:32:47,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:32:47,090 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 591 transitions. [2024-11-13 15:32:47,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 15:32:47,091 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 591 transitions. [2024-11-13 15:32:47,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-13 15:32:47,093 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:32:47,095 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:32:47,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 15:32:47,095 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:32:47,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:32:47,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1709586112, now seen corresponding path program 1 times [2024-11-13 15:32:47,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:32:47,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596104444] [2024-11-13 15:32:47,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:32:47,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:32:47,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:47,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:32:47,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:47,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 15:32:47,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:47,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 15:32:47,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:47,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 15:32:47,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:47,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 15:32:47,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:47,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 15:32:47,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:47,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-13 15:32:47,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:47,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 15:32:47,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:47,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 15:32:47,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:47,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-13 15:32:47,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:47,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-13 15:32:47,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:47,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-13 15:32:47,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:47,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-13 15:32:47,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:47,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-13 15:32:47,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:47,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 15:32:47,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:47,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-13 15:32:47,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:47,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-13 15:32:47,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:47,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-13 15:32:47,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:47,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-13 15:32:47,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:47,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-13 15:32:47,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:47,651 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-13 15:32:47,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:32:47,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596104444] [2024-11-13 15:32:47,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596104444] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:32:47,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:32:47,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:32:47,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591465615] [2024-11-13 15:32:47,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:32:47,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:32:47,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:32:47,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:32:47,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:32:47,655 INFO L87 Difference]: Start difference. First operand 398 states and 591 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 15:32:47,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:32:47,821 INFO L93 Difference]: Finished difference Result 770 states and 1132 transitions. [2024-11-13 15:32:47,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:32:47,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 141 [2024-11-13 15:32:47,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:32:47,826 INFO L225 Difference]: With dead ends: 770 [2024-11-13 15:32:47,826 INFO L226 Difference]: Without dead ends: 414 [2024-11-13 15:32:47,828 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 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 15:32:47,829 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 107 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:32:47,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 222 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:32:47,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2024-11-13 15:32:47,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 414. [2024-11-13 15:32:47,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 304 states have (on average 1.3092105263157894) internal successors, (398), 304 states have internal predecessors, (398), 100 states have call successors, (100), 9 states have call predecessors, (100), 9 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-13 15:32:47,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 598 transitions. [2024-11-13 15:32:47,952 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 598 transitions. Word has length 141 [2024-11-13 15:32:47,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:32:47,953 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 598 transitions. [2024-11-13 15:32:47,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 15:32:47,953 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 598 transitions. [2024-11-13 15:32:47,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-13 15:32:47,955 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:32:47,955 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:32:47,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 15:32:47,955 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:32:47,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:32:47,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1843599618, now seen corresponding path program 1 times [2024-11-13 15:32:47,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:32:47,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009926483] [2024-11-13 15:32:47,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:32:47,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:32:48,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:48,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:32:48,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:48,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 15:32:48,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:48,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 15:32:48,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:48,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 15:32:48,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:48,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 15:32:48,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:48,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 15:32:48,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:48,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-13 15:32:48,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:48,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 15:32:48,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:48,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 15:32:48,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:48,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-13 15:32:48,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:48,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-13 15:32:48,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:48,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-13 15:32:48,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:48,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-13 15:32:48,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:48,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-13 15:32:48,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:48,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 15:32:48,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:48,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-13 15:32:48,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:48,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-13 15:32:48,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:48,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-13 15:32:48,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:48,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-13 15:32:48,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:48,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-13 15:32:48,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:48,741 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-13 15:32:48,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:32:48,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009926483] [2024-11-13 15:32:48,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009926483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:32:48,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:32:48,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 15:32:48,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453531748] [2024-11-13 15:32:48,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:32:48,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:32:48,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:32:48,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:32:48,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:32:48,744 INFO L87 Difference]: Start difference. First operand 414 states and 598 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 15:32:49,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:32:49,358 INFO L93 Difference]: Finished difference Result 1043 states and 1503 transitions. [2024-11-13 15:32:49,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:32:49,359 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 141 [2024-11-13 15:32:49,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:32:49,365 INFO L225 Difference]: With dead ends: 1043 [2024-11-13 15:32:49,365 INFO L226 Difference]: Without dead ends: 673 [2024-11-13 15:32:49,367 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 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 15:32:49,368 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 130 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 15:32:49,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 470 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 15:32:49,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2024-11-13 15:32:49,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 585. [2024-11-13 15:32:49,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 431 states have (on average 1.3062645011600929) internal successors, (563), 431 states have internal predecessors, (563), 140 states have call successors, (140), 13 states have call predecessors, (140), 13 states have return successors, (140), 140 states have call predecessors, (140), 140 states have call successors, (140) [2024-11-13 15:32:49,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 843 transitions. [2024-11-13 15:32:49,598 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 843 transitions. Word has length 141 [2024-11-13 15:32:49,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:32:49,599 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 843 transitions. [2024-11-13 15:32:49,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 15:32:49,600 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 843 transitions. [2024-11-13 15:32:49,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-13 15:32:49,602 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:32:49,603 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:32:49,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 15:32:49,603 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:32:49,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:32:49,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1624744900, now seen corresponding path program 1 times [2024-11-13 15:32:49,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:32:49,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036051593] [2024-11-13 15:32:49,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:32:49,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:32:49,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:50,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:32:50,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:50,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 15:32:50,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:50,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 15:32:50,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:50,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 15:32:50,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:50,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 15:32:50,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:50,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 15:32:50,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:50,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-13 15:32:50,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:50,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 15:32:50,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:50,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 15:32:50,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:50,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-13 15:32:50,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:50,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-13 15:32:50,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:50,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-13 15:32:50,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:50,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-13 15:32:50,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:50,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-13 15:32:50,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:50,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 15:32:50,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:50,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-13 15:32:50,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:50,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-13 15:32:50,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:50,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-13 15:32:50,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:50,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-13 15:32:50,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:50,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-13 15:32:50,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:50,112 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-13 15:32:50,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:32:50,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036051593] [2024-11-13 15:32:50,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036051593] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:32:50,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:32:50,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 15:32:50,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536579820] [2024-11-13 15:32:50,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:32:50,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 15:32:50,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:32:50,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 15:32:50,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:32:50,115 INFO L87 Difference]: Start difference. First operand 585 states and 843 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 15:32:50,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:32:50,511 INFO L93 Difference]: Finished difference Result 1217 states and 1765 transitions. [2024-11-13 15:32:50,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 15:32:50,512 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 141 [2024-11-13 15:32:50,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:32:50,525 INFO L225 Difference]: With dead ends: 1217 [2024-11-13 15:32:50,525 INFO L226 Difference]: Without dead ends: 733 [2024-11-13 15:32:50,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:32:50,529 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 71 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:32:50,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 441 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 15:32:50,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2024-11-13 15:32:50,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 663. [2024-11-13 15:32:50,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 509 states have (on average 1.3163064833005893) internal successors, (670), 509 states have internal predecessors, (670), 140 states have call successors, (140), 13 states have call predecessors, (140), 13 states have return successors, (140), 140 states have call predecessors, (140), 140 states have call successors, (140) [2024-11-13 15:32:50,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 950 transitions. [2024-11-13 15:32:50,736 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 950 transitions. Word has length 141 [2024-11-13 15:32:50,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:32:50,737 INFO L471 AbstractCegarLoop]: Abstraction has 663 states and 950 transitions. [2024-11-13 15:32:50,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 15:32:50,737 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 950 transitions. [2024-11-13 15:32:50,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-13 15:32:50,740 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:32:50,740 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:32:50,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 15:32:50,741 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:32:50,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:32:50,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1105977454, now seen corresponding path program 1 times [2024-11-13 15:32:50,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:32:50,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75059455] [2024-11-13 15:32:50,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:32:50,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:32:50,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 15:32:50,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1073819429] [2024-11-13 15:32:50,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:32:50,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:32:50,941 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251c88a3-36cc-4df0-af0a-b3359713e67d/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:32:50,945 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251c88a3-36cc-4df0-af0a-b3359713e67d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:32:50,947 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251c88a3-36cc-4df0-af0a-b3359713e67d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 15:32:51,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:51,489 INFO L255 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-13 15:32:51,504 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:32:52,730 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 217 proven. 48 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2024-11-13 15:32:52,730 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:32:54,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:32:54,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75059455] [2024-11-13 15:32:54,411 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-13 15:32:54,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073819429] [2024-11-13 15:32:54,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1073819429] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:32:54,412 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-13 15:32:54,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2024-11-13 15:32:54,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695082935] [2024-11-13 15:32:54,413 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-13 15:32:54,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 15:32:54,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:32:54,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 15:32:54,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-11-13 15:32:54,415 INFO L87 Difference]: Start difference. First operand 663 states and 950 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-13 15:32:55,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:32:55,861 INFO L93 Difference]: Finished difference Result 1606 states and 2252 transitions. [2024-11-13 15:32:55,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 15:32:55,862 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 146 [2024-11-13 15:32:55,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:32:55,876 INFO L225 Difference]: With dead ends: 1606 [2024-11-13 15:32:55,876 INFO L226 Difference]: Without dead ends: 1187 [2024-11-13 15:32:55,879 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2024-11-13 15:32:55,880 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 99 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:32:55,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 557 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-13 15:32:55,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2024-11-13 15:32:56,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 1129. [2024-11-13 15:32:56,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1129 states, 867 states have (on average 1.3021914648212225) internal successors, (1129), 871 states have internal predecessors, (1129), 228 states have call successors, (228), 33 states have call predecessors, (228), 33 states have return successors, (228), 224 states have call predecessors, (228), 228 states have call successors, (228) [2024-11-13 15:32:56,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 1129 states and 1585 transitions. [2024-11-13 15:32:56,120 INFO L78 Accepts]: Start accepts. Automaton has 1129 states and 1585 transitions. Word has length 146 [2024-11-13 15:32:56,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:32:56,121 INFO L471 AbstractCegarLoop]: Abstraction has 1129 states and 1585 transitions. [2024-11-13 15:32:56,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-13 15:32:56,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 1585 transitions. [2024-11-13 15:32:56,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-13 15:32:56,127 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:32:56,127 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:32:56,159 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251c88a3-36cc-4df0-af0a-b3359713e67d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 15:32:56,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251c88a3-36cc-4df0-af0a-b3359713e67d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-13 15:32:56,328 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:32:56,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:32:56,329 INFO L85 PathProgramCache]: Analyzing trace with hash -643762226, now seen corresponding path program 1 times [2024-11-13 15:32:56,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:32:56,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749403650] [2024-11-13 15:32:56,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:32:56,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:32:56,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:56,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:32:56,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:56,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 15:32:56,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:56,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 15:32:56,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:56,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 15:32:56,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:56,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 15:32:56,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:56,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 15:32:56,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:56,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-13 15:32:56,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:56,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 15:32:56,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:56,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 15:32:56,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:56,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-13 15:32:56,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:56,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-13 15:32:56,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:56,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-13 15:32:56,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:56,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-13 15:32:56,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:56,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-13 15:32:56,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:56,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-13 15:32:56,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:56,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-13 15:32:56,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:56,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-13 15:32:56,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:56,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-13 15:32:56,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:56,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-13 15:32:56,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:56,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-13 15:32:56,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:32:56,752 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-13 15:32:56,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:32:56,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749403650] [2024-11-13 15:32:56,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749403650] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:32:56,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:32:56,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 15:32:56,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082031027] [2024-11-13 15:32:56,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:32:56,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:32:56,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:32:56,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:32:56,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:32:56,757 INFO L87 Difference]: Start difference. First operand 1129 states and 1585 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 15:32:57,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:32:57,146 INFO L93 Difference]: Finished difference Result 1957 states and 2771 transitions. [2024-11-13 15:32:57,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:32:57,147 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 146 [2024-11-13 15:32:57,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:32:57,162 INFO L225 Difference]: With dead ends: 1957 [2024-11-13 15:32:57,162 INFO L226 Difference]: Without dead ends: 1506 [2024-11-13 15:32:57,165 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:32:57,167 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 71 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:32:57,167 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 346 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:32:57,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2024-11-13 15:32:57,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1132. [2024-11-13 15:32:57,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1132 states, 870 states have (on average 1.3011494252873563) internal successors, (1132), 874 states have internal predecessors, (1132), 228 states have call successors, (228), 33 states have call predecessors, (228), 33 states have return successors, (228), 224 states have call predecessors, (228), 228 states have call successors, (228) [2024-11-13 15:32:57,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 1588 transitions. [2024-11-13 15:32:57,442 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 1588 transitions. Word has length 146 [2024-11-13 15:32:57,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:32:57,443 INFO L471 AbstractCegarLoop]: Abstraction has 1132 states and 1588 transitions. [2024-11-13 15:32:57,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 15:32:57,443 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 1588 transitions. [2024-11-13 15:32:57,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-13 15:32:57,452 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:32:57,452 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:32:57,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 15:32:57,452 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:32:57,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:32:57,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1923625904, now seen corresponding path program 1 times [2024-11-13 15:32:57,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:32:57,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440221926] [2024-11-13 15:32:57,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:32:57,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:32:57,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 15:32:57,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1622387611] [2024-11-13 15:32:57,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:32:57,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:32:57,630 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251c88a3-36cc-4df0-af0a-b3359713e67d/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:32:57,632 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251c88a3-36cc-4df0-af0a-b3359713e67d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:32:57,636 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251c88a3-36cc-4df0-af0a-b3359713e67d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 15:32:57,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:32:57,969 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 15:32:58,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 15:32:58,281 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 15:32:58,282 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 15:32:58,283 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 15:32:58,313 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251c88a3-36cc-4df0-af0a-b3359713e67d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-13 15:32:58,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251c88a3-36cc-4df0-af0a-b3359713e67d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-13 15:32:58,496 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:32:58,678 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 15:32:58,683 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 03:32:58 BoogieIcfgContainer [2024-11-13 15:32:58,684 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 15:32:58,685 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 15:32:58,685 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 15:32:58,686 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 15:32:58,687 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:32:39" (3/4) ... [2024-11-13 15:32:58,690 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 15:32:58,691 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 15:32:58,693 INFO L158 Benchmark]: Toolchain (without parser) took 21103.69ms. Allocated memory was 117.4MB in the beginning and 243.3MB in the end (delta: 125.8MB). Free memory was 92.5MB in the beginning and 156.3MB in the end (delta: -63.9MB). Peak memory consumption was 63.3MB. Max. memory is 16.1GB. [2024-11-13 15:32:58,694 INFO L158 Benchmark]: CDTParser took 0.65ms. Allocated memory is still 83.9MB. Free memory is still 40.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 15:32:58,694 INFO L158 Benchmark]: CACSL2BoogieTranslator took 520.68ms. Allocated memory is still 117.4MB. Free memory was 92.1MB in the beginning and 76.2MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 15:32:58,695 INFO L158 Benchmark]: Boogie Procedure Inliner took 113.52ms. Allocated memory is still 117.4MB. Free memory was 76.2MB in the beginning and 69.7MB in the end (delta: 6.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 15:32:58,695 INFO L158 Benchmark]: Boogie Preprocessor took 138.50ms. Allocated memory is still 117.4MB. Free memory was 69.7MB in the beginning and 58.5MB in the end (delta: 11.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 15:32:58,696 INFO L158 Benchmark]: RCFGBuilder took 1099.00ms. Allocated memory is still 117.4MB. Free memory was 58.5MB in the beginning and 78.8MB in the end (delta: -20.3MB). Peak memory consumption was 31.6MB. Max. memory is 16.1GB. [2024-11-13 15:32:58,696 INFO L158 Benchmark]: TraceAbstraction took 19214.80ms. Allocated memory was 117.4MB in the beginning and 243.3MB in the end (delta: 125.8MB). Free memory was 78.1MB in the beginning and 156.4MB in the end (delta: -78.3MB). Peak memory consumption was 48.5MB. Max. memory is 16.1GB. [2024-11-13 15:32:58,697 INFO L158 Benchmark]: Witness Printer took 6.12ms. Allocated memory is still 243.3MB. Free memory was 156.4MB in the beginning and 156.3MB in the end (delta: 20.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 15:32:58,700 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.65ms. Allocated memory is still 83.9MB. Free memory is still 40.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 520.68ms. Allocated memory is still 117.4MB. Free memory was 92.1MB in the beginning and 76.2MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 113.52ms. Allocated memory is still 117.4MB. Free memory was 76.2MB in the beginning and 69.7MB in the end (delta: 6.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 138.50ms. Allocated memory is still 117.4MB. Free memory was 69.7MB in the beginning and 58.5MB in the end (delta: 11.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1099.00ms. Allocated memory is still 117.4MB. Free memory was 58.5MB in the beginning and 78.8MB in the end (delta: -20.3MB). Peak memory consumption was 31.6MB. Max. memory is 16.1GB. * TraceAbstraction took 19214.80ms. Allocated memory was 117.4MB in the beginning and 243.3MB in the end (delta: 125.8MB). Free memory was 78.1MB in the beginning and 156.4MB in the end (delta: -78.3MB). Peak memory consumption was 48.5MB. Max. memory is 16.1GB. * Witness Printer took 6.12ms. Allocated memory is still 243.3MB. Free memory was 156.4MB in the beginning and 156.3MB in the end (delta: 20.9kB). 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 someBinaryArithmeticDOUBLEoperation at line 79, overapproximation of bitwiseOr at line 137, overapproximation of bitwiseOr at line 68, overapproximation of someBinaryDOUBLEComparisonOperation at line 113, overapproximation of someBinaryDOUBLEComparisonOperation at line 107, overapproximation of someBinaryDOUBLEComparisonOperation at line 137, overapproximation of someBinaryDOUBLEComparisonOperation at line 115, overapproximation of someBinaryDOUBLEComparisonOperation at line 109, overapproximation of someBinaryDOUBLEComparisonOperation at line 111. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -4; [L23] unsigned char var_1_3 = 64; [L24] unsigned char var_1_4 = 0; [L25] unsigned char var_1_5 = 2; [L26] unsigned short int var_1_6 = 10; [L27] double var_1_8 = 1.875; [L28] signed long int var_1_9 = -4; [L29] double var_1_10 = 63.5; [L30] double var_1_11 = 255.375; [L31] double var_1_12 = 999999999.525; [L32] double var_1_13 = 63.75; [L33] double var_1_14 = 0.625; [L34] unsigned short int var_1_15 = 5; [L35] signed char var_1_16 = 4; [L36] signed char var_1_17 = 0; [L37] signed char var_1_18 = -2; [L38] signed char var_1_19 = 1; [L39] unsigned short int var_1_20 = 50; [L40] unsigned short int var_1_21 = 0; [L41] unsigned char var_1_22 = 2; [L42] unsigned char var_1_23 = 32; [L43] unsigned short int var_1_24 = 8; [L44] signed short int var_1_25 = 8; [L45] unsigned short int var_1_26 = 10; [L46] signed short int var_1_27 = -4; [L47] double var_1_28 = 0.5; [L48] unsigned char last_1_var_1_3 = 64; [L49] unsigned short int last_1_var_1_6 = 10; [L50] unsigned short int last_1_var_1_15 = 5; [L51] unsigned short int last_1_var_1_20 = 50; [L52] unsigned short int last_1_var_1_21 = 0; VAL [isInitial=0, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=0, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L141] isInitial = 1 [L142] FCALL initially() [L143] COND TRUE 1 [L144] CALL updateLastVariables() [L130] last_1_var_1_3 = var_1_3 [L131] last_1_var_1_6 = var_1_6 [L132] last_1_var_1_15 = var_1_15 [L133] last_1_var_1_20 = var_1_20 [L134] last_1_var_1_21 = var_1_21 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=0, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L144] RET updateLastVariables() [L145] CALL updateVariables() [L96] var_1_4 = __VERIFIER_nondet_uchar() [L97] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L97] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L98] CALL assume_abort_if_not(var_1_4 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=207, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=207, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L98] RET assume_abort_if_not(var_1_4 <= 254) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=207, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L99] var_1_5 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=207, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=207, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L100] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=207, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L101] CALL assume_abort_if_not(var_1_5 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L101] RET assume_abort_if_not(var_1_5 <= 254) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L102] var_1_9 = __VERIFIER_nondet_long() [L103] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L103] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L104] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L104] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L105] CALL assume_abort_if_not(var_1_9 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L105] RET assume_abort_if_not(var_1_9 != 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L106] var_1_10 = __VERIFIER_nondet_double() [L107] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L107] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L108] var_1_11 = __VERIFIER_nondet_double() [L109] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L109] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L110] var_1_12 = __VERIFIER_nondet_double() [L111] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L111] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L112] var_1_13 = __VERIFIER_nondet_double() [L113] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L113] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L114] var_1_14 = __VERIFIER_nondet_double() [L115] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L115] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L116] var_1_17 = __VERIFIER_nondet_char() [L117] CALL assume_abort_if_not(var_1_17 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-63, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-63, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L117] RET assume_abort_if_not(var_1_17 >= -63) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-63, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L118] CALL assume_abort_if_not(var_1_17 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-63, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-63, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L118] RET assume_abort_if_not(var_1_17 <= 63) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-63, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L119] var_1_18 = __VERIFIER_nondet_char() [L120] CALL assume_abort_if_not(var_1_18 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-63, var_1_18=32, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-63, var_1_18=32, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L120] RET assume_abort_if_not(var_1_18 >= -31) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-63, var_1_18=32, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L121] CALL assume_abort_if_not(var_1_18 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-63, var_1_18=32, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-63, var_1_18=32, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L121] RET assume_abort_if_not(var_1_18 <= 32) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-63, var_1_18=32, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L122] var_1_19 = __VERIFIER_nondet_char() [L123] CALL assume_abort_if_not(var_1_19 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-63, var_1_18=32, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-63, var_1_18=32, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L123] RET assume_abort_if_not(var_1_19 >= -31) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-63, var_1_18=32, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L124] CALL assume_abort_if_not(var_1_19 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-63, var_1_18=32, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-63, var_1_18=32, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L124] RET assume_abort_if_not(var_1_19 <= 31) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-63, var_1_18=32, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L125] var_1_23 = __VERIFIER_nondet_uchar() [L126] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-63, var_1_18=32, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-63, var_1_18=32, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L126] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-63, var_1_18=32, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L127] CALL assume_abort_if_not(var_1_23 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-63, var_1_18=32, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-63, var_1_18=32, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L127] RET assume_abort_if_not(var_1_23 <= 254) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-63, var_1_18=32, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L145] RET updateVariables() [L146] CALL step() [L56] var_1_22 = var_1_23 [L57] var_1_24 = var_1_22 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-63, var_1_18=32, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L58] COND FALSE !(var_1_23 > ((((var_1_22) < (var_1_24)) ? (var_1_22) : (var_1_24)))) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-63, var_1_18=32, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=8, var_1_26=10, var_1_27=-4, var_1_28=1/2, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L61] var_1_26 = var_1_23 [L62] var_1_27 = var_1_22 [L63] var_1_28 = 50.5 [L64] signed long int stepLocal_0 = last_1_var_1_21; VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_0=0, var_1_15=5, var_1_16=4, var_1_17=-63, var_1_18=32, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=101/2, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L65] COND FALSE !(last_1_var_1_6 < stepLocal_0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-63, var_1_18=32, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=101/2, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L68] EXPR last_1_var_1_20 ^ last_1_var_1_15 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-63, var_1_18=32, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=101/2, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L68] signed long int stepLocal_2 = last_1_var_1_20 ^ last_1_var_1_15; [L69] unsigned char stepLocal_1 = var_1_5; VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_1=197, stepLocal_2=1, var_1_15=5, var_1_16=4, var_1_17=-63, var_1_18=32, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=101/2, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L70] COND FALSE !(stepLocal_2 < -256) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_1=197, var_1_15=5, var_1_16=4, var_1_17=-63, var_1_18=32, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=101/2, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L73] COND FALSE !(stepLocal_1 <= 50) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-63, var_1_18=32, var_1_19=31, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=101/2, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L77] var_1_20 = (((((var_1_5 + var_1_6)) > (var_1_4)) ? ((var_1_5 + var_1_6)) : (var_1_4))) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-63, var_1_18=32, var_1_19=31, var_1_1=-4, var_1_20=207, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=101/2, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L78] COND TRUE var_1_3 < (var_1_5 % ((((32) > (var_1_9)) ? (32) : (var_1_9)))) [L79] var_1_8 = ((((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - var_1_12) + (var_1_13 - var_1_14)) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-63, var_1_18=32, var_1_19=31, var_1_1=-4, var_1_20=207, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=101/2, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_9=66] [L85] var_1_16 = (var_1_17 + (var_1_18 + ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19))))) [L86] var_1_1 = ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))) [L87] unsigned short int stepLocal_3 = var_1_6; VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_3=10, var_1_15=5, var_1_16=0, var_1_17=-63, var_1_18=32, var_1_19=31, var_1_1=0, var_1_20=207, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=101/2, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_9=66] [L88] EXPR (var_1_3 * var_1_17) & (var_1_1 * var_1_18) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_3=10, var_1_15=5, var_1_16=0, var_1_17=-63, var_1_18=32, var_1_19=31, var_1_1=0, var_1_20=207, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=101/2, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_9=66] [L88] COND FALSE !(stepLocal_3 == ((var_1_3 * var_1_17) & (var_1_1 * var_1_18))) [L91] COND TRUE ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) > var_1_21 [L92] var_1_15 = ((((var_1_3) > ((var_1_5 + var_1_4))) ? (var_1_3) : ((var_1_5 + var_1_4)))) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=404, var_1_16=0, var_1_17=-63, var_1_18=32, var_1_19=31, var_1_1=0, var_1_20=207, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=101/2, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_9=66] [L146] RET step() [L147] CALL, EXPR property() [L137] EXPR ((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1)) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=404, var_1_16=0, var_1_17=-63, var_1_18=32, var_1_19=31, var_1_1=0, var_1_20=207, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=101/2, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_9=66] [L137] EXPR last_1_var_1_20 ^ last_1_var_1_15 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=404, var_1_16=0, var_1_17=-63, var_1_18=32, var_1_19=31, var_1_1=0, var_1_20=207, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=101/2, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_9=66] [L137] EXPR ((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1)) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=404, var_1_16=0, var_1_17=-63, var_1_18=32, var_1_19=31, var_1_1=0, var_1_20=207, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=101/2, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_9=66] [L137] EXPR (((((((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1))) && ((var_1_3 < (var_1_5 % ((((32) > (var_1_9)) ? (32) : (var_1_9))))) ? (var_1_8 == ((double) ((((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - var_1_12) + (var_1_13 - var_1_14)))) : ((var_1_13 <= (var_1_14 + var_1_11)) ? (var_1_8 == ((double) var_1_12)) : 1))) && ((((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) > var_1_21) ? (var_1_15 == ((unsigned short int) ((((var_1_3) > ((var_1_5 + var_1_4))) ? (var_1_3) : ((var_1_5 + var_1_4)))))) : 1)) && (var_1_16 == ((signed char) (var_1_17 + (var_1_18 + ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))))))) && (var_1_20 == ((unsigned short int) (((((var_1_5 + var_1_6)) > (var_1_4)) ? ((var_1_5 + var_1_6)) : (var_1_4)))))) && ((var_1_6 == ((var_1_3 * var_1_17) & (var_1_1 * var_1_18))) ? (var_1_21 == ((unsigned short int) (var_1_4 + 128))) : 1) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=404, var_1_16=0, var_1_17=-63, var_1_18=32, var_1_19=31, var_1_1=0, var_1_20=207, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=101/2, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_9=66] [L137-L138] return (((((((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1))) && ((var_1_3 < (var_1_5 % ((((32) > (var_1_9)) ? (32) : (var_1_9))))) ? (var_1_8 == ((double) ((((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - var_1_12) + (var_1_13 - var_1_14)))) : ((var_1_13 <= (var_1_14 + var_1_11)) ? (var_1_8 == ((double) var_1_12)) : 1))) && ((((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) > var_1_21) ? (var_1_15 == ((unsigned short int) ((((var_1_3) > ((var_1_5 + var_1_4))) ? (var_1_3) : ((var_1_5 + var_1_4)))))) : 1)) && (var_1_16 == ((signed char) (var_1_17 + (var_1_18 + ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))))))) && (var_1_20 == ((unsigned short int) (((((var_1_5 + var_1_6)) > (var_1_4)) ? ((var_1_5 + var_1_6)) : (var_1_4)))))) && ((var_1_6 == ((var_1_3 * var_1_17) & (var_1_1 * var_1_18))) ? (var_1_21 == ((unsigned short int) (var_1_4 + 128))) : 1) ; [L147] RET, EXPR property() [L147] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=404, var_1_16=0, var_1_17=-63, var_1_18=32, var_1_19=31, var_1_1=0, var_1_20=207, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=101/2, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_9=66] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=404, var_1_16=0, var_1_17=-63, var_1_18=32, var_1_19=31, var_1_1=0, var_1_20=207, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=101/2, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_9=66] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 83 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.9s, OverallIterations: 12, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1057 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1053 mSDsluCounter, 4119 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2733 mSDsCounter, 317 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 795 IncrementalHoareTripleChecker+Invalid, 1112 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 317 mSolverCounterUnsat, 1386 mSDtfsCounter, 795 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 668 GetRequests, 613 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1132occurred in iteration=11, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 11 MinimizatonAttempts, 745 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 8.7s InterpolantComputationTime, 1984 NumberOfCodeBlocks, 1984 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1535 ConstructedInterpolants, 0 QuantifiedInterpolants, 4615 SizeOfPredicates, 4 NumberOfNonLiveVariables, 366 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 11 InterpolantComputations, 10 PerfectInterpolantSequences, 8312/8360 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 15:32:58,738 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251c88a3-36cc-4df0-af0a-b3359713e67d/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_251c88a3-36cc-4df0-af0a-b3359713e67d/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251c88a3-36cc-4df0-af0a-b3359713e67d/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_251c88a3-36cc-4df0-af0a-b3359713e67d/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251c88a3-36cc-4df0-af0a-b3359713e67d/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-78.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251c88a3-36cc-4df0-af0a-b3359713e67d/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_251c88a3-36cc-4df0-af0a-b3359713e67d/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 cb935426deff6dbed173fe3e44e993749aecd47418756b352860ce0f63ea8b54 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 15:33:02,506 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 15:33:02,664 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251c88a3-36cc-4df0-af0a-b3359713e67d/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-13 15:33:02,678 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 15:33:02,679 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 15:33:02,729 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 15:33:02,729 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 15:33:02,730 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 15:33:02,730 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 15:33:02,731 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 15:33:02,731 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 15:33:02,731 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 15:33:02,732 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 15:33:02,732 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 15:33:02,732 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 15:33:02,732 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 15:33:02,732 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 15:33:02,733 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 15:33:02,733 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 15:33:02,733 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 15:33:02,733 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 15:33:02,734 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 15:33:02,734 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 15:33:02,734 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 15:33:02,734 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 15:33:02,734 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 15:33:02,735 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 15:33:02,735 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 15:33:02,735 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 15:33:02,735 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 15:33:02,735 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 15:33:02,736 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 15:33:02,736 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 15:33:02,736 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 15:33:02,736 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:33:02,736 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 15:33:02,737 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 15:33:02,737 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 15:33:02,737 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-13 15:33:02,737 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 15:33:02,737 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 15:33:02,738 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 15:33:02,738 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 15:33:02,738 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 15:33:02,738 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_251c88a3-36cc-4df0-af0a-b3359713e67d/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 -> cb935426deff6dbed173fe3e44e993749aecd47418756b352860ce0f63ea8b54 [2024-11-13 15:33:03,180 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 15:33:03,192 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 15:33:03,198 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 15:33:03,201 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 15:33:03,202 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 15:33:03,204 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251c88a3-36cc-4df0-af0a-b3359713e67d/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-78.i Unable to find full path for "g++" [2024-11-13 15:33:05,430 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 15:33:05,732 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 15:33:05,733 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251c88a3-36cc-4df0-af0a-b3359713e67d/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-78.i [2024-11-13 15:33:05,751 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251c88a3-36cc-4df0-af0a-b3359713e67d/bin/uautomizer-verify-qhAvR1uOyd/data/eccdb768f/e9d73b7e13c7455a80139b3955e017f4/FLAGf8ee6a167 [2024-11-13 15:33:06,006 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251c88a3-36cc-4df0-af0a-b3359713e67d/bin/uautomizer-verify-qhAvR1uOyd/data/eccdb768f/e9d73b7e13c7455a80139b3955e017f4 [2024-11-13 15:33:06,009 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 15:33:06,012 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 15:33:06,014 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 15:33:06,014 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 15:33:06,020 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 15:33:06,021 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:33:06" (1/1) ... [2024-11-13 15:33:06,022 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55abb708 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:33:06, skipping insertion in model container [2024-11-13 15:33:06,022 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:33:06" (1/1) ... [2024-11-13 15:33:06,053 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 15:33:06,272 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_251c88a3-36cc-4df0-af0a-b3359713e67d/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-78.i[915,928] [2024-11-13 15:33:06,406 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:33:06,445 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 15:33:06,464 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_251c88a3-36cc-4df0-af0a-b3359713e67d/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-78.i[915,928] [2024-11-13 15:33:06,540 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:33:06,581 INFO L204 MainTranslator]: Completed translation [2024-11-13 15:33:06,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:33:06 WrapperNode [2024-11-13 15:33:06,583 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 15:33:06,585 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 15:33:06,585 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 15:33:06,586 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 15:33:06,603 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:33:06" (1/1) ... [2024-11-13 15:33:06,623 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:33:06" (1/1) ... [2024-11-13 15:33:06,696 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 153 [2024-11-13 15:33:06,700 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 15:33:06,701 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 15:33:06,701 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 15:33:06,701 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 15:33:06,713 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:33:06" (1/1) ... [2024-11-13 15:33:06,713 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:33:06" (1/1) ... [2024-11-13 15:33:06,719 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:33:06" (1/1) ... [2024-11-13 15:33:06,746 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 15:33:06,746 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:33:06" (1/1) ... [2024-11-13 15:33:06,747 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:33:06" (1/1) ... [2024-11-13 15:33:06,765 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:33:06" (1/1) ... [2024-11-13 15:33:06,770 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:33:06" (1/1) ... [2024-11-13 15:33:06,773 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:33:06" (1/1) ... [2024-11-13 15:33:06,776 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:33:06" (1/1) ... [2024-11-13 15:33:06,784 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 15:33:06,789 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 15:33:06,791 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 15:33:06,791 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 15:33:06,793 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:33:06" (1/1) ... [2024-11-13 15:33:06,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:33:06,822 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251c88a3-36cc-4df0-af0a-b3359713e67d/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:33:06,840 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251c88a3-36cc-4df0-af0a-b3359713e67d/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 15:33:06,848 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251c88a3-36cc-4df0-af0a-b3359713e67d/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 15:33:06,882 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 15:33:06,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-13 15:33:06,882 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 15:33:06,882 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 15:33:06,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 15:33:06,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 15:33:07,021 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 15:33:07,025 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 15:33:16,320 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-13 15:33:16,320 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 15:33:16,335 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 15:33:16,335 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 15:33:16,336 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:33:16 BoogieIcfgContainer [2024-11-13 15:33:16,336 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 15:33:16,339 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 15:33:16,339 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 15:33:16,345 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 15:33:16,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 03:33:06" (1/3) ... [2024-11-13 15:33:16,347 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6daa6b78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:33:16, skipping insertion in model container [2024-11-13 15:33:16,347 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:33:06" (2/3) ... [2024-11-13 15:33:16,348 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6daa6b78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:33:16, skipping insertion in model container [2024-11-13 15:33:16,348 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:33:16" (3/3) ... [2024-11-13 15:33:16,350 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-78.i [2024-11-13 15:33:16,371 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 15:33:16,373 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-78.i that has 2 procedures, 63 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 15:33:16,450 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 15:33:16,467 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;@53244523, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 15:33:16,467 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 15:33:16,473 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 40 states have (on average 1.325) internal successors, (53), 41 states have internal predecessors, (53), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-13 15:33:16,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-13 15:33:16,489 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:33:16,490 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:33:16,490 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:33:16,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:33:16,497 INFO L85 PathProgramCache]: Analyzing trace with hash 640437761, now seen corresponding path program 1 times [2024-11-13 15:33:16,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:33:16,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [117285186] [2024-11-13 15:33:16,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:33:16,512 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 15:33:16,512 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251c88a3-36cc-4df0-af0a-b3359713e67d/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:33:16,517 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251c88a3-36cc-4df0-af0a-b3359713e67d/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 15:33:16,521 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251c88a3-36cc-4df0-af0a-b3359713e67d/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 15:33:17,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:33:17,243 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-13 15:33:17,253 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:33:17,332 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 374 proven. 0 refuted. 0 times theorem prover too weak. 386 trivial. 0 not checked. [2024-11-13 15:33:17,332 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:33:17,333 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:33:17,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [117285186] [2024-11-13 15:33:17,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [117285186] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:33:17,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:33:17,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:33:17,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878399900] [2024-11-13 15:33:17,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:33:17,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 15:33:17,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:33:17,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 15:33:17,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 15:33:17,383 INFO L87 Difference]: Start difference. First operand has 63 states, 40 states have (on average 1.325) internal successors, (53), 41 states have internal predecessors, (53), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-13 15:33:17,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:33:17,434 INFO L93 Difference]: Finished difference Result 119 states and 200 transitions. [2024-11-13 15:33:17,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 15:33:17,437 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 131 [2024-11-13 15:33:17,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:33:17,448 INFO L225 Difference]: With dead ends: 119 [2024-11-13 15:33:17,449 INFO L226 Difference]: Without dead ends: 59 [2024-11-13 15:33:17,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 130 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 15:33:17,463 INFO L432 NwaCegarLoop]: 86 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, 86 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 15:33:17,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:33:17,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-13 15:33:17,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-13 15:33:17,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 37 states have internal predecessors, (46), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-13 15:33:17,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 86 transitions. [2024-11-13 15:33:17,550 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 86 transitions. Word has length 131 [2024-11-13 15:33:17,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:33:17,551 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 86 transitions. [2024-11-13 15:33:17,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-13 15:33:17,554 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 86 transitions. [2024-11-13 15:33:17,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-13 15:33:17,560 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:33:17,560 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:33:17,575 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251c88a3-36cc-4df0-af0a-b3359713e67d/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 15:33:17,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251c88a3-36cc-4df0-af0a-b3359713e67d/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 15:33:17,761 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:33:17,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:33:17,762 INFO L85 PathProgramCache]: Analyzing trace with hash 650842421, now seen corresponding path program 1 times [2024-11-13 15:33:17,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:33:17,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [678149650] [2024-11-13 15:33:17,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:33:17,764 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 15:33:17,764 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251c88a3-36cc-4df0-af0a-b3359713e67d/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:33:17,767 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251c88a3-36cc-4df0-af0a-b3359713e67d/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 15:33:17,771 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251c88a3-36cc-4df0-af0a-b3359713e67d/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 15:33:18,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:33:18,493 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 15:33:18,501 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:33:21,777 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-13 15:33:21,779 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:33:21,779 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:33:21,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [678149650] [2024-11-13 15:33:21,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [678149650] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:33:21,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:33:21,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:33:21,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078092111] [2024-11-13 15:33:21,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:33:21,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:33:21,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:33:21,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:33:21,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:33:21,787 INFO L87 Difference]: Start difference. First operand 59 states and 86 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 15:33:26,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.57s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:33:30,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.97s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:33:34,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:33:34,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:33:34,684 INFO L93 Difference]: Finished difference Result 184 states and 269 transitions. [2024-11-13 15:33:34,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:33:34,716 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 131 [2024-11-13 15:33:34,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:33:34,719 INFO L225 Difference]: With dead ends: 184 [2024-11-13 15:33:34,719 INFO L226 Difference]: Without dead ends: 128 [2024-11-13 15:33:34,720 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:33:34,721 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 65 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 41 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.7s IncrementalHoareTripleChecker+Time [2024-11-13 15:33:34,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 295 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 75 Invalid, 1 Unknown, 0 Unchecked, 12.7s Time] [2024-11-13 15:33:34,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-13 15:33:34,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 113. [2024-11-13 15:33:34,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 70 states have (on average 1.2428571428571429) internal successors, (87), 70 states have internal predecessors, (87), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-13 15:33:34,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 167 transitions. [2024-11-13 15:33:34,781 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 167 transitions. Word has length 131 [2024-11-13 15:33:34,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:33:34,782 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 167 transitions. [2024-11-13 15:33:34,782 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 15:33:34,783 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 167 transitions. [2024-11-13 15:33:34,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-13 15:33:34,788 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:33:34,788 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:33:34,807 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251c88a3-36cc-4df0-af0a-b3359713e67d/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 15:33:34,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251c88a3-36cc-4df0-af0a-b3359713e67d/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 15:33:34,989 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:33:34,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:33:34,990 INFO L85 PathProgramCache]: Analyzing trace with hash 909007859, now seen corresponding path program 1 times [2024-11-13 15:33:34,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:33:34,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1855134004] [2024-11-13 15:33:34,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:33:34,991 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 15:33:34,991 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251c88a3-36cc-4df0-af0a-b3359713e67d/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:33:34,993 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251c88a3-36cc-4df0-af0a-b3359713e67d/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 15:33:34,996 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251c88a3-36cc-4df0-af0a-b3359713e67d/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 15:33:35,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:33:35,559 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-13 15:33:35,563 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:33:35,652 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-13 15:33:35,652 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:33:35,653 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:33:35,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1855134004] [2024-11-13 15:33:35,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1855134004] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:33:35,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:33:35,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:33:35,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815970812] [2024-11-13 15:33:35,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:33:35,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:33:35,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:33:35,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:33:35,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:33:35,656 INFO L87 Difference]: Start difference. First operand 113 states and 167 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 15:33:39,831 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 15:33:39,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:33:39,840 INFO L93 Difference]: Finished difference Result 169 states and 250 transitions. [2024-11-13 15:33:39,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:33:39,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 131 [2024-11-13 15:33:39,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:33:39,884 INFO L225 Difference]: With dead ends: 169 [2024-11-13 15:33:39,885 INFO L226 Difference]: Without dead ends: 113 [2024-11-13 15:33:39,887 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 129 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 15:33:39,889 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 0 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-13 15:33:39,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 165 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2024-11-13 15:33:39,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-13 15:33:39,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-11-13 15:33:39,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 70 states have (on average 1.2142857142857142) internal successors, (85), 70 states have internal predecessors, (85), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-13 15:33:39,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 165 transitions. [2024-11-13 15:33:39,934 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 165 transitions. Word has length 131 [2024-11-13 15:33:39,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:33:39,935 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 165 transitions. [2024-11-13 15:33:39,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 15:33:39,936 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 165 transitions. [2024-11-13 15:33:39,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-13 15:33:39,938 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:33:39,939 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:33:39,961 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251c88a3-36cc-4df0-af0a-b3359713e67d/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)] Forceful destruction successful, exit code 0 [2024-11-13 15:33:40,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251c88a3-36cc-4df0-af0a-b3359713e67d/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 15:33:40,140 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:33:40,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:33:40,141 INFO L85 PathProgramCache]: Analyzing trace with hash -669890298, now seen corresponding path program 1 times [2024-11-13 15:33:40,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:33:40,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [273467242] [2024-11-13 15:33:40,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:33:40,142 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 15:33:40,142 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251c88a3-36cc-4df0-af0a-b3359713e67d/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:33:40,152 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251c88a3-36cc-4df0-af0a-b3359713e67d/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 15:33:40,154 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251c88a3-36cc-4df0-af0a-b3359713e67d/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 15:33:40,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:33:40,817 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 15:33:40,823 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:33:43,828 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-13 15:33:43,828 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:33:43,828 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:33:43,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [273467242] [2024-11-13 15:33:43,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [273467242] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:33:43,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:33:43,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 15:33:43,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584910792] [2024-11-13 15:33:43,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:33:43,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 15:33:43,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:33:43,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 15:33:43,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:33:43,832 INFO L87 Difference]: Start difference. First operand 113 states and 165 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 15:33:48,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:33:52,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.38s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:33:56,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:33:58,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:34:03,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:34:05,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:34:09,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:34:11,442 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:34:11,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:34:11,444 INFO L93 Difference]: Finished difference Result 301 states and 436 transitions. [2024-11-13 15:34:11,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 15:34:11,483 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 132 [2024-11-13 15:34:11,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:34:11,487 INFO L225 Difference]: With dead ends: 301 [2024-11-13 15:34:11,487 INFO L226 Difference]: Without dead ends: 245 [2024-11-13 15:34:11,488 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-13 15:34:11,489 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 152 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 41 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.3s IncrementalHoareTripleChecker+Time [2024-11-13 15:34:11,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 302 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 268 Invalid, 3 Unknown, 0 Unchecked, 27.3s Time] [2024-11-13 15:34:11,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-11-13 15:34:11,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 211. [2024-11-13 15:34:11,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 126 states have (on average 1.1904761904761905) internal successors, (150), 126 states have internal predecessors, (150), 80 states have call successors, (80), 4 states have call predecessors, (80), 4 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-13 15:34:11,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 310 transitions. [2024-11-13 15:34:11,583 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 310 transitions. Word has length 132 [2024-11-13 15:34:11,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:34:11,584 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 310 transitions. [2024-11-13 15:34:11,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 15:34:11,584 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 310 transitions. [2024-11-13 15:34:11,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-13 15:34:11,590 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:34:11,590 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:34:11,608 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251c88a3-36cc-4df0-af0a-b3359713e67d/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)] Ended with exit code 0 [2024-11-13 15:34:11,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251c88a3-36cc-4df0-af0a-b3359713e67d/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 15:34:11,791 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:34:11,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:34:11,792 INFO L85 PathProgramCache]: Analyzing trace with hash -612631996, now seen corresponding path program 1 times [2024-11-13 15:34:11,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:34:11,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1956322376] [2024-11-13 15:34:11,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:34:11,793 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 15:34:11,793 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251c88a3-36cc-4df0-af0a-b3359713e67d/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:34:11,795 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251c88a3-36cc-4df0-af0a-b3359713e67d/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 15:34:11,797 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251c88a3-36cc-4df0-af0a-b3359713e67d/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 15:34:13,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:34:13,804 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-13 15:34:13,809 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:34:16,585 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 343 proven. 39 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-13 15:34:16,585 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:34:20,556 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:34:20,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1956322376] [2024-11-13 15:34:20,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1956322376] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:34:20,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25519684] [2024-11-13 15:34:20,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:34:20,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:34:20,557 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251c88a3-36cc-4df0-af0a-b3359713e67d/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:34:20,559 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251c88a3-36cc-4df0-af0a-b3359713e67d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:34:20,561 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251c88a3-36cc-4df0-af0a-b3359713e67d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 15:34:21,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:34:21,167 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 15:34:21,172 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:34:22,876 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-13 15:34:22,876 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:34:22,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25519684] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:34:22,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 15:34:22,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-11-13 15:34:22,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331718005] [2024-11-13 15:34:22,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:34:22,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:34:22,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:34:22,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:34:22,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-11-13 15:34:22,879 INFO L87 Difference]: Start difference. First operand 211 states and 310 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 15:34:26,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.03s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:34:31,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:34:35,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:34:37,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:34:42,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:34:44,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:34:44,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:34:44,198 INFO L93 Difference]: Finished difference Result 421 states and 607 transitions. [2024-11-13 15:34:44,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:34:44,199 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 132 [2024-11-13 15:34:44,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:34:44,204 INFO L225 Difference]: With dead ends: 421 [2024-11-13 15:34:44,204 INFO L226 Difference]: Without dead ends: 311 [2024-11-13 15:34:44,205 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-11-13 15:34:44,206 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 46 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.3s IncrementalHoareTripleChecker+Time [2024-11-13 15:34:44,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 221 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 128 Invalid, 3 Unknown, 0 Unchecked, 21.3s Time] [2024-11-13 15:34:44,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-11-13 15:34:44,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 305. [2024-11-13 15:34:44,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 192 states have (on average 1.203125) internal successors, (231), 194 states have internal predecessors, (231), 104 states have call successors, (104), 8 states have call predecessors, (104), 8 states have return successors, (104), 102 states have call predecessors, (104), 104 states have call successors, (104) [2024-11-13 15:34:44,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 439 transitions. [2024-11-13 15:34:44,291 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 439 transitions. Word has length 132 [2024-11-13 15:34:44,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:34:44,292 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 439 transitions. [2024-11-13 15:34:44,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 15:34:44,293 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 439 transitions. [2024-11-13 15:34:44,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-13 15:34:44,299 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:34:44,299 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:34:44,341 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251c88a3-36cc-4df0-af0a-b3359713e67d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-13 15:34:44,511 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251c88a3-36cc-4df0-af0a-b3359713e67d/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)] Ended with exit code 0 [2024-11-13 15:34:44,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251c88a3-36cc-4df0-af0a-b3359713e67d/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251c88a3-36cc-4df0-af0a-b3359713e67d/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 15:34:44,700 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:34:44,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:34:44,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1062917308, now seen corresponding path program 1 times [2024-11-13 15:34:44,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:34:44,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [809364649] [2024-11-13 15:34:44,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:34:44,702 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 15:34:44,702 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251c88a3-36cc-4df0-af0a-b3359713e67d/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:34:44,705 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251c88a3-36cc-4df0-af0a-b3359713e67d/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 15:34:44,709 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251c88a3-36cc-4df0-af0a-b3359713e67d/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 15:34:45,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:34:45,240 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 15:34:45,244 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:34:47,677 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-13 15:34:47,677 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 15:34:47,678 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 15:34:47,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [809364649] [2024-11-13 15:34:47,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [809364649] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:34:47,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:34:47,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:34:47,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461388190] [2024-11-13 15:34:47,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:34:47,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:34:47,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 15:34:47,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:34:47,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:34:47,681 INFO L87 Difference]: Start difference. First operand 305 states and 439 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 15:34:51,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.92s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:34:54,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.95s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:34:57,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.66s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 15:34:57,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:34:57,163 INFO L93 Difference]: Finished difference Result 435 states and 626 transitions. [2024-11-13 15:34:57,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:34:57,167 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 132 [2024-11-13 15:34:57,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:34:57,172 INFO L225 Difference]: With dead ends: 435 [2024-11-13 15:34:57,172 INFO L226 Difference]: Without dead ends: 307 [2024-11-13 15:34:57,173 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 129 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 15:34:57,174 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 14 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2024-11-13 15:34:57,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 188 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 9.4s Time] [2024-11-13 15:34:57,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2024-11-13 15:34:57,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 305. [2024-11-13 15:34:57,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 192 states have (on average 1.1979166666666667) internal successors, (230), 194 states have internal predecessors, (230), 104 states have call successors, (104), 8 states have call predecessors, (104), 8 states have return successors, (104), 102 states have call predecessors, (104), 104 states have call successors, (104) [2024-11-13 15:34:57,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 438 transitions. [2024-11-13 15:34:57,249 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 438 transitions. Word has length 132 [2024-11-13 15:34:57,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:34:57,251 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 438 transitions. [2024-11-13 15:34:57,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-13 15:34:57,251 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 438 transitions. [2024-11-13 15:34:57,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-13 15:34:57,256 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:34:57,257 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:34:57,285 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251c88a3-36cc-4df0-af0a-b3359713e67d/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 15:34:57,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251c88a3-36cc-4df0-af0a-b3359713e67d/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 15:34:57,458 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:34:57,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:34:57,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1005659006, now seen corresponding path program 1 times [2024-11-13 15:34:57,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 15:34:57,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1438815118] [2024-11-13 15:34:57,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:34:57,459 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 15:34:57,459 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251c88a3-36cc-4df0-af0a-b3359713e67d/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 15:34:57,461 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251c88a3-36cc-4df0-af0a-b3359713e67d/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 15:34:57,463 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_251c88a3-36cc-4df0-af0a-b3359713e67d/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 15:34:59,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:34:59,027 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-13 15:34:59,033 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:36:01,273 WARN L286 SmtUtils]: Spent 8.09s 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 15:36:09,353 WARN L286 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:36:17,491 WARN L286 SmtUtils]: Spent 8.14s 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 15:36:25,450 WARN L286 SmtUtils]: Spent 7.96s 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 15:36:31,149 WARN L286 SmtUtils]: Spent 5.70s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:36:38,919 WARN L286 SmtUtils]: Spent 7.77s 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 15:36:46,039 WARN L286 SmtUtils]: Spent 7.12s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:36:53,244 WARN L286 SmtUtils]: Spent 7.20s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:37:01,506 WARN L286 SmtUtils]: Spent 8.26s 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 15:37:09,619 WARN L286 SmtUtils]: Spent 8.11s 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 15:37:17,722 WARN L286 SmtUtils]: Spent 8.10s 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 15:37:24,302 WARN L286 SmtUtils]: Spent 6.58s 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 15:37:37,018 WARN L286 SmtUtils]: Spent 7.79s 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 15:37:44,213 WARN L286 SmtUtils]: Spent 7.19s 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 15:37:52,311 WARN L286 SmtUtils]: Spent 8.10s 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 15:38:00,396 WARN L286 SmtUtils]: Spent 8.08s 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 15:38:06,623 WARN L286 SmtUtils]: Spent 6.23s 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 15:38:14,713 WARN L286 SmtUtils]: Spent 8.09s 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 15:38:21,411 WARN L286 SmtUtils]: Spent 6.70s 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 15:38:28,801 WARN L286 SmtUtils]: Spent 7.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 15:38:36,374 WARN L286 SmtUtils]: Spent 7.57s 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 15:38:43,993 WARN L286 SmtUtils]: Spent 7.62s 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 15:38:50,306 WARN L286 SmtUtils]: Spent 6.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 15:38:58,432 WARN L286 SmtUtils]: Spent 8.13s 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 15:39:06,508 WARN L286 SmtUtils]: Spent 8.07s 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 15:39:13,825 WARN L286 SmtUtils]: Spent 7.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 15:39:21,924 WARN L286 SmtUtils]: Spent 8.10s 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 15:39:35,565 WARN L286 SmtUtils]: Spent 6.12s 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 15:39:39,616 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 24) c_~var_1_19~0)) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 4611686018427382800.0))) (.cse7 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (.cse5 ((_ zero_extend 24) c_~var_1_5~0)) (.cse8 ((_ sign_extend 24) c_~var_1_17~0)) (.cse1 ((_ sign_extend 24) c_~var_1_18~0))) (and (bvsge .cse0 (_ bv4294967265 32)) (bvsle .cse1 (_ bv32 32)) (let ((.cse3 (bvadd (_ bv10 32) .cse5)) (.cse4 ((_ zero_extend 24) c_~var_1_4~0))) (let ((.cse2 (bvsgt .cse3 .cse4))) (or (and .cse2 (= ((_ extract 15 0) .cse3) c_~var_1_20~0)) (and (= ((_ extract 15 0) .cse4) c_~var_1_20~0) (not .cse2))))) (= (_ bv0 16) c_~var_1_21~0) (fp.leq c_~var_1_12~0 .cse6) (fp.geq c_~var_1_14~0 .cse7) (bvsle .cse0 (_ bv31 32)) (fp.leq c_~var_1_14~0 .cse6) (fp.geq c_~var_1_13~0 .cse7) (fp.geq c_~var_1_12~0 .cse7) (fp.leq c_~var_1_13~0 .cse6) (bvsge .cse8 (_ bv4294967233 32)) (let ((.cse9 (fp.gt c_~var_1_10~0 c_~var_1_11~0)) (.cse10 (fp.sub c_currentRoundingMode c_~var_1_13~0 c_~var_1_14~0))) (or (and .cse9 (= c_~var_1_8~0 (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode c_~var_1_10~0 c_~var_1_12~0) .cse10))) (and (not .cse9) (= c_~var_1_8~0 (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode c_~var_1_11~0 c_~var_1_12~0) .cse10))))) (fp.leq c_~var_1_11~0 .cse6) (fp.geq c_~var_1_11~0 .cse7) (bvslt (_ bv64 32) (bvsrem .cse5 c_~var_1_9~0)) (not (bvsgt (_ bv32 32) c_~var_1_9~0)) (bvsle .cse8 (_ bv63 32)) (= c_~var_1_3~0 (_ bv64 8)) (= c_currentRoundingMode roundNearestTiesToEven) (= (_ bv10 16) c_~var_1_6~0) (= (_ bv0 16) c_~last_1_var_1_21~0) (bvsge .cse1 (_ bv4294967265 32)))) is different from false [2024-11-13 15:39:47,279 WARN L286 SmtUtils]: Spent 7.57s 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 15:39:55,392 WARN L286 SmtUtils]: Spent 8.11s 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 15:40:02,779 WARN L286 SmtUtils]: Spent 7.39s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:40:10,897 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:40:19,030 WARN L286 SmtUtils]: Spent 8.13s 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 15:40:27,131 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:40:35,282 WARN L286 SmtUtils]: Spent 8.15s 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 15:40:43,302 WARN L286 SmtUtils]: Spent 8.02s 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 15:40:51,397 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:40:57,834 WARN L286 SmtUtils]: Spent 6.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 15:41:05,943 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:41:14,008 WARN L286 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:41:20,337 WARN L286 SmtUtils]: Spent 6.33s 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 15:41:28,464 WARN L286 SmtUtils]: Spent 8.13s 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 15:41:35,984 WARN L286 SmtUtils]: Spent 7.52s 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 15:41:42,727 WARN L286 SmtUtils]: Spent 6.74s 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 15:41:50,577 WARN L286 SmtUtils]: Spent 7.85s 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 15:41:57,825 WARN L286 SmtUtils]: Spent 7.25s 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 15:42:05,890 WARN L286 SmtUtils]: Spent 8.06s 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 15:42:13,979 WARN L286 SmtUtils]: Spent 8.09s 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 15:42:21,304 WARN L286 SmtUtils]: Spent 7.32s 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 15:42:27,824 WARN L286 SmtUtils]: Spent 6.52s 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 15:42:35,968 WARN L286 SmtUtils]: Spent 8.14s 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 15:42:43,401 WARN L286 SmtUtils]: Spent 7.43s 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 15:42:51,515 WARN L286 SmtUtils]: Spent 8.11s 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 15:42:59,065 WARN L286 SmtUtils]: Spent 7.55s 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 15:43:07,090 WARN L286 SmtUtils]: Spent 8.02s 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 15:43:15,145 WARN L286 SmtUtils]: Spent 8.05s 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 15:43:23,268 WARN L286 SmtUtils]: Spent 8.12s 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 15:43:31,387 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 15:43:39,508 WARN L286 SmtUtils]: Spent 8.12s 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 15:43:47,624 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 15:43:55,403 WARN L286 SmtUtils]: Spent 7.78s 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 15:44:03,513 WARN L286 SmtUtils]: Spent 8.11s 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 15:44:11,623 WARN L286 SmtUtils]: Spent 8.11s 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 15:44:19,772 WARN L286 SmtUtils]: Spent 8.15s 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 15:44:25,634 WARN L286 SmtUtils]: Spent 5.86s 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 15:44:29,676 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 24) c_~var_1_19~0)) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 4611686018427382800.0))) (.cse7 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (.cse5 ((_ zero_extend 24) c_~var_1_5~0)) (.cse8 ((_ sign_extend 24) c_~var_1_17~0)) (.cse1 ((_ sign_extend 24) c_~var_1_18~0))) (and (bvsge .cse0 (_ bv4294967265 32)) (bvsle .cse1 (_ bv32 32)) (let ((.cse3 (bvadd (_ bv10 32) .cse5)) (.cse4 ((_ zero_extend 24) c_~var_1_4~0))) (let ((.cse2 (bvsgt .cse3 .cse4))) (or (and .cse2 (= ((_ extract 15 0) .cse3) c_~var_1_20~0)) (and (= ((_ extract 15 0) .cse4) c_~var_1_20~0) (not .cse2))))) (= (_ bv0 16) c_~var_1_21~0) (fp.leq c_~var_1_12~0 .cse6) (fp.geq c_~var_1_14~0 .cse7) (bvsle .cse0 (_ bv31 32)) (fp.leq c_~var_1_14~0 .cse6) (fp.geq c_~var_1_13~0 .cse7) (fp.geq c_~var_1_12~0 .cse7) (fp.leq c_~var_1_13~0 .cse6) (bvsge .cse8 (_ bv4294967233 32)) (let ((.cse9 (bvslt .cse0 (_ bv0 32)))) (or (and (= c_~var_1_16~0 ((_ extract 7 0) (bvadd .cse0 .cse8 .cse1))) (not .cse9)) (and (= ((_ extract 7 0) (bvadd .cse8 .cse1 (bvneg .cse0))) c_~var_1_16~0) .cse9))) (let ((.cse10 (fp.gt c_~var_1_10~0 c_~var_1_11~0)) (.cse11 (fp.sub c_currentRoundingMode c_~var_1_13~0 c_~var_1_14~0))) (or (and .cse10 (= c_~var_1_8~0 (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode c_~var_1_10~0 c_~var_1_12~0) .cse11))) (and (not .cse10) (= c_~var_1_8~0 (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode c_~var_1_11~0 c_~var_1_12~0) .cse11))))) (fp.leq c_~var_1_11~0 .cse6) (fp.geq c_~var_1_11~0 .cse7) (let ((.cse12 ((_ sign_extend 24) c_~var_1_16~0))) (let ((.cse13 (bvslt .cse12 (_ bv0 32)))) (or (and (= c_~var_1_1~0 (bvneg .cse12)) .cse13) (and (not .cse13) (= .cse12 c_~var_1_1~0))))) (bvslt (_ bv64 32) (bvsrem .cse5 c_~var_1_9~0)) (not (bvsgt (_ bv32 32) c_~var_1_9~0)) (bvsle .cse8 (_ bv63 32)) (= c_~var_1_3~0 (_ bv64 8)) (= c_currentRoundingMode roundNearestTiesToEven) (= (_ bv10 16) c_~var_1_6~0) (= (_ bv0 16) c_~last_1_var_1_21~0) (bvsge .cse1 (_ bv4294967265 32)))) is different from false [2024-11-13 15:44:37,878 WARN L286 SmtUtils]: Spent 8.09s 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 15:44:45,693 WARN L286 SmtUtils]: Spent 7.81s 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 15:44:52,872 WARN L286 SmtUtils]: Spent 7.18s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:45:00,953 WARN L286 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:45:09,119 WARN L286 SmtUtils]: Spent 8.17s 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 15:45:17,198 WARN L286 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:45:24,145 WARN L286 SmtUtils]: Spent 6.95s 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 15:45:31,528 WARN L286 SmtUtils]: Spent 7.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 15:45:38,773 WARN L286 SmtUtils]: Spent 7.24s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:45:45,876 WARN L286 SmtUtils]: Spent 7.10s 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 15:45:53,968 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:46:01,602 WARN L286 SmtUtils]: Spent 7.63s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 15:46:09,487 WARN L286 SmtUtils]: Spent 7.88s 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 15:46:17,084 WARN L286 SmtUtils]: Spent 7.60s 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 15:46:23,426 WARN L286 SmtUtils]: Spent 6.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 15:46:31,512 WARN L286 SmtUtils]: Spent 8.09s 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 15:46:39,646 WARN L286 SmtUtils]: Spent 8.13s 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 15:46:47,732 WARN L286 SmtUtils]: Spent 8.09s 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 15:46:54,182 WARN L286 SmtUtils]: Spent 6.45s 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 15:47:02,270 WARN L286 SmtUtils]: Spent 8.09s 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 15:47:09,592 WARN L286 SmtUtils]: Spent 7.32s 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 15:47:17,683 WARN L286 SmtUtils]: Spent 8.09s 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 15:47:25,340 WARN L286 SmtUtils]: Spent 7.66s 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)