./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-14.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_b9f1358a-a387-4c91-8b4d-04a8cc41f8e5/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9f1358a-a387-4c91-8b4d-04a8cc41f8e5/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_b9f1358a-a387-4c91-8b4d-04a8cc41f8e5/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9f1358a-a387-4c91-8b4d-04a8cc41f8e5/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-14.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9f1358a-a387-4c91-8b4d-04a8cc41f8e5/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_b9f1358a-a387-4c91-8b4d-04a8cc41f8e5/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 a72044eca37c9344cf7356219da330f9c945a1c22555364502c74c325db2c27b --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 15:58:35,024 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 15:58:35,142 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9f1358a-a387-4c91-8b4d-04a8cc41f8e5/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 15:58:35,150 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 15:58:35,150 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 15:58:35,192 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 15:58:35,192 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 15:58:35,193 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 15:58:35,193 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 15:58:35,193 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 15:58:35,193 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 15:58:35,194 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 15:58:35,194 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 15:58:35,194 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 15:58:35,194 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 15:58:35,194 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 15:58:35,195 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 15:58:35,195 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 15:58:35,195 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 15:58:35,195 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 15:58:35,195 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 15:58:35,195 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 15:58:35,196 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 15:58:35,196 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 15:58:35,196 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 15:58:35,196 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 15:58:35,196 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 15:58:35,196 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 15:58:35,196 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 15:58:35,197 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 15:58:35,197 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 15:58:35,197 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 15:58:35,197 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:58:35,197 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 15:58:35,197 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 15:58:35,197 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 15:58:35,198 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 15:58:35,198 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 15:58:35,198 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 15:58:35,198 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 15:58:35,198 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 15:58:35,198 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 15:58:35,198 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_b9f1358a-a387-4c91-8b4d-04a8cc41f8e5/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 -> a72044eca37c9344cf7356219da330f9c945a1c22555364502c74c325db2c27b [2024-11-13 15:58:35,579 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 15:58:35,595 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 15:58:35,598 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 15:58:35,599 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 15:58:35,599 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 15:58:35,601 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9f1358a-a387-4c91-8b4d-04a8cc41f8e5/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-14.i Unable to find full path for "g++" [2024-11-13 15:58:38,018 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 15:58:38,457 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 15:58:38,463 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9f1358a-a387-4c91-8b4d-04a8cc41f8e5/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-14.i [2024-11-13 15:58:38,478 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9f1358a-a387-4c91-8b4d-04a8cc41f8e5/bin/uautomizer-verify-qhAvR1uOyd/data/f194b404a/dff6cb699dbf44d59a78b11175d8acf9/FLAGa804d5aa8 [2024-11-13 15:58:38,499 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9f1358a-a387-4c91-8b4d-04a8cc41f8e5/bin/uautomizer-verify-qhAvR1uOyd/data/f194b404a/dff6cb699dbf44d59a78b11175d8acf9 [2024-11-13 15:58:38,502 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 15:58:38,504 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 15:58:38,505 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 15:58:38,506 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 15:58:38,512 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 15:58:38,513 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:58:38" (1/1) ... [2024-11-13 15:58:38,514 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a6eb215 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:58:38, skipping insertion in model container [2024-11-13 15:58:38,514 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:58:38" (1/1) ... [2024-11-13 15:58:38,546 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 15:58:38,744 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_b9f1358a-a387-4c91-8b4d-04a8cc41f8e5/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-14.i[916,929] [2024-11-13 15:58:38,850 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:58:38,865 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 15:58:38,881 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_b9f1358a-a387-4c91-8b4d-04a8cc41f8e5/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-14.i[916,929] [2024-11-13 15:58:38,939 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:58:38,960 INFO L204 MainTranslator]: Completed translation [2024-11-13 15:58:38,961 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:58:38 WrapperNode [2024-11-13 15:58:38,961 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 15:58:38,962 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 15:58:38,963 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 15:58:38,963 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 15:58:38,972 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:58:38" (1/1) ... [2024-11-13 15:58:38,986 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:58:38" (1/1) ... [2024-11-13 15:58:39,075 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 276 [2024-11-13 15:58:39,075 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 15:58:39,076 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 15:58:39,077 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 15:58:39,077 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 15:58:39,089 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:58:38" (1/1) ... [2024-11-13 15:58:39,090 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:58:38" (1/1) ... [2024-11-13 15:58:39,102 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:58:38" (1/1) ... [2024-11-13 15:58:39,141 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:58:39,144 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:58:38" (1/1) ... [2024-11-13 15:58:39,145 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:58:38" (1/1) ... [2024-11-13 15:58:39,175 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:58:38" (1/1) ... [2024-11-13 15:58:39,182 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:58:38" (1/1) ... [2024-11-13 15:58:39,186 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:58:38" (1/1) ... [2024-11-13 15:58:39,192 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:58:38" (1/1) ... [2024-11-13 15:58:39,206 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 15:58:39,210 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 15:58:39,210 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 15:58:39,211 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 15:58:39,212 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:58:38" (1/1) ... [2024-11-13 15:58:39,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:58:39,255 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9f1358a-a387-4c91-8b4d-04a8cc41f8e5/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:58:39,275 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9f1358a-a387-4c91-8b4d-04a8cc41f8e5/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:58:39,285 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9f1358a-a387-4c91-8b4d-04a8cc41f8e5/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:58:39,319 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 15:58:39,320 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 15:58:39,321 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 15:58:39,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 15:58:39,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 15:58:39,321 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 15:58:39,489 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 15:58:39,491 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 15:58:40,437 INFO L? ?]: Removed 29 outVars from TransFormulas that were not future-live. [2024-11-13 15:58:40,437 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 15:58:40,458 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 15:58:40,458 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 15:58:40,459 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:58:40 BoogieIcfgContainer [2024-11-13 15:58:40,459 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 15:58:40,465 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 15:58:40,466 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 15:58:40,475 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 15:58:40,476 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 03:58:38" (1/3) ... [2024-11-13 15:58:40,476 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b635631 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:58:40, skipping insertion in model container [2024-11-13 15:58:40,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:58:38" (2/3) ... [2024-11-13 15:58:40,478 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b635631 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:58:40, skipping insertion in model container [2024-11-13 15:58:40,478 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:58:40" (3/3) ... [2024-11-13 15:58:40,480 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-14.i [2024-11-13 15:58:40,503 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 15:58:40,509 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-while_file-14.i that has 2 procedures, 115 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 15:58:40,609 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 15:58:40,650 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;@4ed97b92, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 15:58:40,651 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 15:58:40,657 INFO L276 IsEmpty]: Start isEmpty. Operand has 115 states, 81 states have (on average 1.4691358024691359) internal successors, (119), 82 states have internal predecessors, (119), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-13 15:58:40,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-13 15:58:40,677 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:58:40,678 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:40,678 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:58:40,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:58:40,685 INFO L85 PathProgramCache]: Analyzing trace with hash -365129599, now seen corresponding path program 1 times [2024-11-13 15:58:40,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:58:40,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390091560] [2024-11-13 15:58:40,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:58:40,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:58:40,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:41,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:58:41,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:41,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 15:58:41,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:41,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 15:58:41,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:41,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 15:58:41,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:41,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 15:58:41,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:41,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 15:58:41,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:41,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:58:41,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:41,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 15:58:41,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:41,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 15:58:41,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:41,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 15:58:41,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:41,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 15:58:41,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:41,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:58:41,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:41,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-13 15:58:41,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:41,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 15:58:41,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:41,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-13 15:58:41,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:41,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 15:58:41,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:41,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 15:58:41,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:41,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 15:58:41,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:41,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-13 15:58:41,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:41,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-13 15:58:41,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:41,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-13 15:58:41,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:41,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-13 15:58:41,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:41,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-13 15:58:41,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:41,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-13 15:58:41,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:41,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-13 15:58:41,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:41,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-13 15:58:41,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:41,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-13 15:58:41,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:41,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-13 15:58:41,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:41,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-13 15:58:41,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:41,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-13 15:58:41,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:41,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-13 15:58:41,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:41,439 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-13 15:58:41,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:58:41,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390091560] [2024-11-13 15:58:41,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390091560] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:58:41,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:58:41,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 15:58:41,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849289814] [2024-11-13 15:58:41,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:58:41,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 15:58:41,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:58:41,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 15:58:41,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 15:58:41,488 INFO L87 Difference]: Start difference. First operand has 115 states, 81 states have (on average 1.4691358024691359) internal successors, (119), 82 states have internal predecessors, (119), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-13 15:58:41,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:58:41,550 INFO L93 Difference]: Finished difference Result 222 states and 385 transitions. [2024-11-13 15:58:41,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 15:58:41,553 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 202 [2024-11-13 15:58:41,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:58:41,567 INFO L225 Difference]: With dead ends: 222 [2024-11-13 15:58:41,568 INFO L226 Difference]: Without dead ends: 110 [2024-11-13 15:58:41,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 95 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:58:41,579 INFO L432 NwaCegarLoop]: 171 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, 171 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:58:41,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:58:41,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-13 15:58:41,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-11-13 15:58:41,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 77 states have (on average 1.4155844155844155) internal successors, (109), 77 states have internal predecessors, (109), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-13 15:58:41,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 171 transitions. [2024-11-13 15:58:41,665 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 171 transitions. Word has length 202 [2024-11-13 15:58:41,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:58:41,666 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 171 transitions. [2024-11-13 15:58:41,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-13 15:58:41,670 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 171 transitions. [2024-11-13 15:58:41,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-13 15:58:41,680 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:58:41,680 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:41,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 15:58:41,683 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:58:41,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:58:41,684 INFO L85 PathProgramCache]: Analyzing trace with hash 669432643, now seen corresponding path program 1 times [2024-11-13 15:58:41,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:58:41,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240807942] [2024-11-13 15:58:41,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:58:41,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:58:41,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:42,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:58:42,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:42,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 15:58:42,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:42,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 15:58:42,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:42,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 15:58:42,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:42,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 15:58:42,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:42,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 15:58:42,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:42,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:58:42,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:42,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 15:58:42,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:42,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 15:58:42,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:42,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 15:58:42,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:42,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 15:58:42,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:42,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:58:42,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:42,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-13 15:58:42,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:42,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 15:58:42,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:42,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-13 15:58:42,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:42,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 15:58:42,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:42,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 15:58:42,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:42,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 15:58:42,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:42,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-13 15:58:42,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:42,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-13 15:58:42,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:42,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-13 15:58:42,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:42,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-13 15:58:42,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:42,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-13 15:58:42,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:42,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-13 15:58:42,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:42,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-13 15:58:42,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:42,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-13 15:58:42,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:42,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-13 15:58:42,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:42,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-13 15:58:42,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:42,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-13 15:58:42,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:42,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-13 15:58:42,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:42,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-13 15:58:42,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:42,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-13 15:58:42,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:58:42,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240807942] [2024-11-13 15:58:42,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240807942] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:58:42,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:58:42,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 15:58:42,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509596625] [2024-11-13 15:58:42,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:58:42,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:58:42,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:58:42,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:58:42,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:58:42,689 INFO L87 Difference]: Start difference. First operand 110 states and 171 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-13 15:58:42,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:58:42,790 INFO L93 Difference]: Finished difference Result 218 states and 341 transitions. [2024-11-13 15:58:42,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:58:42,793 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 202 [2024-11-13 15:58:42,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:58:42,798 INFO L225 Difference]: With dead ends: 218 [2024-11-13 15:58:42,798 INFO L226 Difference]: Without dead ends: 111 [2024-11-13 15:58:42,800 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:58:42,801 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 4 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:58:42,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 495 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:58:42,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-13 15:58:42,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-13 15:58:42,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 78 states have (on average 1.4102564102564104) internal successors, (110), 78 states have internal predecessors, (110), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-13 15:58:42,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 172 transitions. [2024-11-13 15:58:42,834 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 172 transitions. Word has length 202 [2024-11-13 15:58:42,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:58:42,840 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 172 transitions. [2024-11-13 15:58:42,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-13 15:58:42,841 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 172 transitions. [2024-11-13 15:58:42,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-13 15:58:42,846 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:58:42,846 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:42,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 15:58:42,847 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:58:42,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:58:42,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1579345124, now seen corresponding path program 1 times [2024-11-13 15:58:42,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:58:42,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327688281] [2024-11-13 15:58:42,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:58:42,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:58:43,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:45,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 15:58:45,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:45,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 15:58:45,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:45,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 15:58:45,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:45,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 15:58:45,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:45,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 15:58:45,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:45,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 15:58:45,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:45,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 15:58:45,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:45,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 15:58:45,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:45,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 15:58:45,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:45,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 15:58:46,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:46,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 15:58:46,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:46,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 15:58:46,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:46,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-13 15:58:46,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:46,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 15:58:46,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:46,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-13 15:58:46,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:46,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 15:58:46,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:46,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 15:58:46,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:46,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 15:58:46,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:46,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-13 15:58:46,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:46,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-13 15:58:46,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:46,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-13 15:58:46,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:46,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-13 15:58:46,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:46,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-13 15:58:46,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:46,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-13 15:58:46,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:46,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-13 15:58:46,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:46,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-13 15:58:46,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:46,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-13 15:58:46,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:46,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-13 15:58:46,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:46,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-13 15:58:46,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:46,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-13 15:58:46,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:46,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-13 15:58:46,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:58:46,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-13 15:58:46,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:58:46,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327688281] [2024-11-13 15:58:46,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327688281] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:58:46,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:58:46,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 15:58:46,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735254564] [2024-11-13 15:58:46,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:58:46,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 15:58:46,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:58:46,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 15:58:46,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 15:58:46,131 INFO L87 Difference]: Start difference. First operand 111 states and 172 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-13 15:58:46,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:58:46,810 INFO L93 Difference]: Finished difference Result 228 states and 351 transitions. [2024-11-13 15:58:46,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:58:46,811 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 203 [2024-11-13 15:58:46,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:58:46,818 INFO L225 Difference]: With dead ends: 228 [2024-11-13 15:58:46,818 INFO L226 Difference]: Without dead ends: 120 [2024-11-13 15:58:46,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:58:46,820 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 135 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 15:58:46,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 422 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 15:58:46,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-13 15:58:46,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2024-11-13 15:58:46,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 83 states have (on average 1.3734939759036144) internal successors, (114), 84 states have internal predecessors, (114), 33 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-13 15:58:46,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 180 transitions. [2024-11-13 15:58:46,860 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 180 transitions. Word has length 203 [2024-11-13 15:58:46,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:58:46,863 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 180 transitions. [2024-11-13 15:58:46,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-13 15:58:46,865 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 180 transitions. [2024-11-13 15:58:46,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-13 15:58:46,872 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:58:46,872 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:46,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 15:58:46,873 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:58:46,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:58:46,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1116363927, now seen corresponding path program 1 times [2024-11-13 15:58:46,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:58:46,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729988187] [2024-11-13 15:58:46,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:58:46,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:58:47,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:00:32,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:00:32,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:00:32,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 16:00:32,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:00:32,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 16:00:32,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:00:32,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 16:00:32,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:00:32,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 16:00:32,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:00:32,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 16:00:32,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:00:32,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 16:00:32,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:00:32,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 16:00:32,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:00:32,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 16:00:32,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:00:32,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 16:00:32,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:00:32,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 16:00:32,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:00:32,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:00:32,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:00:32,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-13 16:00:32,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:00:32,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 16:00:32,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:00:32,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-13 16:00:32,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:00:32,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 16:00:32,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:00:32,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 16:00:32,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:00:32,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 16:00:32,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:00:32,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-13 16:00:32,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:00:32,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-13 16:00:32,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:00:32,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-13 16:00:32,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:00:32,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-13 16:00:32,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:00:32,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-13 16:00:32,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:00:32,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-13 16:00:32,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:00:32,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-13 16:00:32,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:00:32,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-13 16:00:32,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:00:32,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-13 16:00:32,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:00:32,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-13 16:00:32,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:00:32,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-13 16:00:32,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:00:32,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-13 16:00:32,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:00:32,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-13 16:00:32,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:00:32,276 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-13 16:00:32,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:00:32,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729988187] [2024-11-13 16:00:32,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729988187] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:00:32,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:00:32,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-13 16:00:32,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311094081] [2024-11-13 16:00:32,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:00:32,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-13 16:00:32,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:00:32,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-13 16:00:32,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-11-13 16:00:32,280 INFO L87 Difference]: Start difference. First operand 119 states and 180 transitions. Second operand has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-13 16:00:57,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:00:57,227 INFO L93 Difference]: Finished difference Result 503 states and 745 transitions. [2024-11-13 16:00:57,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 16:00:57,229 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 205 [2024-11-13 16:00:57,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:00:57,234 INFO L225 Difference]: With dead ends: 503 [2024-11-13 16:00:57,234 INFO L226 Difference]: Without dead ends: 391 [2024-11-13 16:00:57,235 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 31.3s TimeCoverageRelationStatistics Valid=220, Invalid=430, Unknown=0, NotChecked=0, Total=650 [2024-11-13 16:00:57,236 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 800 mSDsluCounter, 829 mSDsCounter, 0 mSdLazyCounter, 1022 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 800 SdHoareTripleChecker+Valid, 983 SdHoareTripleChecker+Invalid, 1029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1022 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2024-11-13 16:00:57,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [800 Valid, 983 Invalid, 1029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1022 Invalid, 0 Unknown, 0 Unchecked, 9.0s Time] [2024-11-13 16:00:57,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2024-11-13 16:00:57,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 220. [2024-11-13 16:00:57,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 169 states have (on average 1.4142011834319526) internal successors, (239), 171 states have internal predecessors, (239), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-13 16:00:57,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 331 transitions. [2024-11-13 16:00:57,276 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 331 transitions. Word has length 205 [2024-11-13 16:00:57,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:00:57,277 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 331 transitions. [2024-11-13 16:00:57,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-13 16:00:57,277 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 331 transitions. [2024-11-13 16:00:57,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-13 16:00:57,281 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:00:57,281 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:00:57,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 16:00:57,282 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:00:57,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:00:57,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1817428505, now seen corresponding path program 1 times [2024-11-13 16:00:57,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:00:57,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376583674] [2024-11-13 16:00:57,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:00:57,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:00:57,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:22,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:02:22,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:22,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 16:02:22,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:22,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 16:02:22,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:22,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 16:02:22,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:22,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 16:02:22,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:22,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 16:02:22,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:22,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 16:02:22,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:22,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 16:02:22,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:22,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 16:02:22,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:22,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 16:02:22,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:22,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 16:02:22,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:22,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:02:22,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:22,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-13 16:02:22,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:22,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 16:02:22,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:22,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-13 16:02:22,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:22,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 16:02:22,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:22,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 16:02:22,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:22,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 16:02:22,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:22,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-13 16:02:22,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:22,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-13 16:02:22,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:22,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-13 16:02:22,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:22,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-13 16:02:22,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:22,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-13 16:02:22,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:22,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-13 16:02:22,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:22,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-13 16:02:22,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:22,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-13 16:02:22,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:22,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-13 16:02:22,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:22,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-13 16:02:22,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:22,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-13 16:02:22,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:22,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-13 16:02:22,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:22,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-13 16:02:22,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:22,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-13 16:02:22,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:02:22,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376583674] [2024-11-13 16:02:22,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376583674] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:02:22,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:02:22,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-13 16:02:22,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772999588] [2024-11-13 16:02:22,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:02:22,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-13 16:02:22,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:02:22,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-13 16:02:22,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2024-11-13 16:02:22,374 INFO L87 Difference]: Start difference. First operand 220 states and 331 transitions. Second operand has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-13 16:02:39,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:02:39,662 INFO L93 Difference]: Finished difference Result 584 states and 867 transitions. [2024-11-13 16:02:39,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 16:02:39,663 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 205 [2024-11-13 16:02:39,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:02:39,667 INFO L225 Difference]: With dead ends: 584 [2024-11-13 16:02:39,667 INFO L226 Difference]: Without dead ends: 371 [2024-11-13 16:02:39,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 23.2s TimeCoverageRelationStatistics Valid=154, Invalid=266, Unknown=0, NotChecked=0, Total=420 [2024-11-13 16:02:39,669 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 573 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 998 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 1002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2024-11-13 16:02:39,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 780 Invalid, 1002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 998 Invalid, 0 Unknown, 0 Unchecked, 8.6s Time] [2024-11-13 16:02:39,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2024-11-13 16:02:39,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 234. [2024-11-13 16:02:39,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 183 states have (on average 1.4262295081967213) internal successors, (261), 185 states have internal predecessors, (261), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-13 16:02:39,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 353 transitions. [2024-11-13 16:02:39,705 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 353 transitions. Word has length 205 [2024-11-13 16:02:39,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:02:39,705 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 353 transitions. [2024-11-13 16:02:39,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-13 16:02:39,706 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 353 transitions. [2024-11-13 16:02:39,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-13 16:02:39,709 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:02:39,709 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:02:39,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 16:02:39,710 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:02:39,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:02:39,711 INFO L85 PathProgramCache]: Analyzing trace with hash 606890837, now seen corresponding path program 1 times [2024-11-13 16:02:39,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:02:39,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977775433] [2024-11-13 16:02:39,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:02:39,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:02:39,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:39,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:02:39,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:39,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 16:02:39,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:39,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 16:02:39,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:39,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 16:02:39,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:39,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 16:02:39,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:39,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 16:02:39,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:39,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 16:02:39,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:39,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 16:02:39,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:39,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 16:02:39,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:39,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 16:02:39,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:39,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 16:02:39,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:39,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:02:39,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:39,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-13 16:02:39,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:39,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 16:02:39,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:39,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-13 16:02:39,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:39,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 16:02:39,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:39,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 16:02:39,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:39,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 16:02:39,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:39,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-13 16:02:39,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:39,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-13 16:02:39,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:39,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-13 16:02:39,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:39,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-13 16:02:39,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:39,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-13 16:02:39,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:39,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-13 16:02:39,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:39,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-13 16:02:39,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:39,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-13 16:02:39,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:39,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-13 16:02:39,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:40,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-13 16:02:40,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:40,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-13 16:02:40,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:40,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-13 16:02:40,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:40,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-13 16:02:40,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:40,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-13 16:02:40,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:02:40,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977775433] [2024-11-13 16:02:40,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977775433] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:02:40,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:02:40,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 16:02:40,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221330314] [2024-11-13 16:02:40,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:02:40,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 16:02:40,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:02:40,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 16:02:40,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 16:02:40,018 INFO L87 Difference]: Start difference. First operand 234 states and 353 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-13 16:02:40,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:02:40,199 INFO L93 Difference]: Finished difference Result 573 states and 868 transitions. [2024-11-13 16:02:40,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 16:02:40,200 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 205 [2024-11-13 16:02:40,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:02:40,206 INFO L225 Difference]: With dead ends: 573 [2024-11-13 16:02:40,207 INFO L226 Difference]: Without dead ends: 346 [2024-11-13 16:02:40,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 63 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 16:02:40,209 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 108 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 16:02:40,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 594 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 16:02:40,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2024-11-13 16:02:40,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 344. [2024-11-13 16:02:40,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 260 states have (on average 1.4115384615384616) internal successors, (367), 262 states have internal predecessors, (367), 77 states have call successors, (77), 6 states have call predecessors, (77), 6 states have return successors, (77), 75 states have call predecessors, (77), 77 states have call successors, (77) [2024-11-13 16:02:40,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 521 transitions. [2024-11-13 16:02:40,262 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 521 transitions. Word has length 205 [2024-11-13 16:02:40,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:02:40,263 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 521 transitions. [2024-11-13 16:02:40,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-13 16:02:40,263 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 521 transitions. [2024-11-13 16:02:40,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-13 16:02:40,266 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:02:40,266 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:02:40,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 16:02:40,266 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:02:40,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:02:40,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1604459575, now seen corresponding path program 1 times [2024-11-13 16:02:40,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:02:40,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461737437] [2024-11-13 16:02:40,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:02:40,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:02:40,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:40,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:02:40,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:40,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 16:02:40,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:40,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 16:02:40,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:40,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 16:02:40,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:40,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 16:02:40,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:40,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 16:02:40,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:40,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 16:02:40,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:40,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 16:02:40,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:40,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 16:02:40,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:40,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 16:02:40,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:40,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 16:02:40,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:40,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:02:40,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:40,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-13 16:02:40,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:40,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 16:02:40,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:40,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-13 16:02:40,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:40,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 16:02:40,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:40,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 16:02:40,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:40,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 16:02:40,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:40,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-13 16:02:40,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:40,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-13 16:02:40,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:40,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-13 16:02:40,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:40,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-13 16:02:40,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:40,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-13 16:02:40,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:40,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-13 16:02:40,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:40,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-13 16:02:40,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:40,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-13 16:02:40,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:40,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-13 16:02:40,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:40,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-13 16:02:40,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:40,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-13 16:02:40,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:40,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-13 16:02:40,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:40,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-13 16:02:40,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:02:40,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-13 16:02:40,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:02:40,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461737437] [2024-11-13 16:02:40,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461737437] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:02:40,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:02:40,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 16:02:40,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246329759] [2024-11-13 16:02:40,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:02:40,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 16:02:40,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:02:40,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 16:02:40,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-13 16:02:40,970 INFO L87 Difference]: Start difference. First operand 344 states and 521 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-13 16:02:41,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:02:41,669 INFO L93 Difference]: Finished difference Result 1146 states and 1737 transitions. [2024-11-13 16:02:41,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 16:02:41,671 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 206 [2024-11-13 16:02:41,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:02:41,683 INFO L225 Difference]: With dead ends: 1146 [2024-11-13 16:02:41,683 INFO L226 Difference]: Without dead ends: 809 [2024-11-13 16:02:41,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-13 16:02:41,686 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 300 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 16:02:41,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 685 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 16:02:41,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2024-11-13 16:02:41,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 729. [2024-11-13 16:02:41,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 564 states have (on average 1.4308510638297873) internal successors, (807), 567 states have internal predecessors, (807), 152 states have call successors, (152), 12 states have call predecessors, (152), 12 states have return successors, (152), 149 states have call predecessors, (152), 152 states have call successors, (152) [2024-11-13 16:02:41,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 1111 transitions. [2024-11-13 16:02:41,814 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 1111 transitions. Word has length 206 [2024-11-13 16:02:41,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:02:41,817 INFO L471 AbstractCegarLoop]: Abstraction has 729 states and 1111 transitions. [2024-11-13 16:02:41,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-13 16:02:41,818 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 1111 transitions. [2024-11-13 16:02:41,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-13 16:02:41,825 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:02:41,826 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:02:41,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 16:02:41,828 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:02:41,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:02:41,828 INFO L85 PathProgramCache]: Analyzing trace with hash -903394997, now seen corresponding path program 1 times [2024-11-13 16:02:41,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:02:41,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812206067] [2024-11-13 16:02:41,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:02:41,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:02:42,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:03:51,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:03:51,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:03:51,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 16:03:51,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:03:51,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 16:03:51,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:03:51,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 16:03:51,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:03:51,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 16:03:51,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:03:51,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 16:03:51,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:03:51,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 16:03:51,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:03:51,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 16:03:51,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:03:51,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 16:03:51,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:03:51,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 16:03:51,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:03:51,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 16:03:51,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:03:51,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:03:51,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:03:51,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-13 16:03:51,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:03:51,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 16:03:51,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:03:51,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-13 16:03:51,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:03:51,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 16:03:51,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:03:51,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 16:03:51,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:03:51,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 16:03:51,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:03:51,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-13 16:03:51,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:03:51,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-13 16:03:51,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:03:51,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-13 16:03:51,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:03:51,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-13 16:03:51,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:03:51,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-13 16:03:51,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:03:51,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-13 16:03:51,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:03:51,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-13 16:03:51,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:03:51,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-13 16:03:51,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:03:51,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-13 16:03:51,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:03:51,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-13 16:03:51,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:03:51,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-13 16:03:51,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:03:51,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-13 16:03:51,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:03:51,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-13 16:03:51,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:03:51,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-13 16:03:51,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:03:51,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812206067] [2024-11-13 16:03:51,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812206067] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:03:51,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:03:51,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-13 16:03:51,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748244483] [2024-11-13 16:03:51,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:03:51,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-13 16:03:51,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:03:51,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-13 16:03:51,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2024-11-13 16:03:51,216 INFO L87 Difference]: Start difference. First operand 729 states and 1111 transitions. Second operand has 18 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-13 16:04:13,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:04:13,368 INFO L93 Difference]: Finished difference Result 1322 states and 1999 transitions. [2024-11-13 16:04:13,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 16:04:13,368 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 206 [2024-11-13 16:04:13,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:04:13,374 INFO L225 Difference]: With dead ends: 1322 [2024-11-13 16:04:13,374 INFO L226 Difference]: Without dead ends: 842 [2024-11-13 16:04:13,377 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 20.1s TimeCoverageRelationStatistics Valid=311, Invalid=681, Unknown=0, NotChecked=0, Total=992 [2024-11-13 16:04:13,377 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 809 mSDsluCounter, 811 mSDsCounter, 0 mSdLazyCounter, 1733 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 809 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 1793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.4s IncrementalHoareTripleChecker+Time [2024-11-13 16:04:13,378 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [809 Valid, 992 Invalid, 1793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1733 Invalid, 0 Unknown, 0 Unchecked, 11.4s Time] [2024-11-13 16:04:13,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2024-11-13 16:04:13,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 743. [2024-11-13 16:04:13,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 743 states, 578 states have (on average 1.4325259515570934) internal successors, (828), 581 states have internal predecessors, (828), 152 states have call successors, (152), 12 states have call predecessors, (152), 12 states have return successors, (152), 149 states have call predecessors, (152), 152 states have call successors, (152) [2024-11-13 16:04:13,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 1132 transitions. [2024-11-13 16:04:13,466 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 1132 transitions. Word has length 206 [2024-11-13 16:04:13,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:04:13,467 INFO L471 AbstractCegarLoop]: Abstraction has 743 states and 1132 transitions. [2024-11-13 16:04:13,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-13 16:04:13,467 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1132 transitions. [2024-11-13 16:04:13,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-13 16:04:13,471 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:04:13,471 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:04:13,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 16:04:13,471 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:04:13,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:04:13,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1802059348, now seen corresponding path program 1 times [2024-11-13 16:04:13,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:04:13,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123257910] [2024-11-13 16:04:13,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:04:13,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:04:13,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:05:53,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:05:53,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:05:53,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 16:05:53,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:05:53,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 16:05:53,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:05:53,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 16:05:53,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:05:53,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 16:05:53,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:05:53,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 16:05:53,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:05:53,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 16:05:53,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:05:53,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 16:05:53,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:05:53,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 16:05:53,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:05:53,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 16:05:53,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:05:53,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 16:05:53,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:05:53,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:05:53,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:05:53,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-13 16:05:53,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:05:53,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 16:05:53,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:05:53,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-13 16:05:53,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:05:53,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 16:05:53,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:05:53,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 16:05:53,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:05:53,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 16:05:53,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:05:53,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-13 16:05:53,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:05:53,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-13 16:05:53,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:05:53,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-13 16:05:53,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:05:53,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-13 16:05:53,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:05:53,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-13 16:05:53,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:05:53,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-13 16:05:53,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:05:53,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-13 16:05:53,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:05:53,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-13 16:05:53,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:05:53,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-13 16:05:53,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:05:53,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-13 16:05:53,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:05:53,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-13 16:05:53,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:05:53,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-13 16:05:53,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:05:53,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-13 16:05:53,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:05:53,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-13 16:05:53,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:05:53,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123257910] [2024-11-13 16:05:53,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123257910] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:05:53,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:05:53,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-13 16:05:53,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216346974] [2024-11-13 16:05:53,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:05:53,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-13 16:05:53,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:05:53,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-13 16:05:53,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2024-11-13 16:05:53,273 INFO L87 Difference]: Start difference. First operand 743 states and 1132 transitions. Second operand has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-13 16:06:36,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:06:36,706 INFO L93 Difference]: Finished difference Result 1460 states and 2187 transitions. [2024-11-13 16:06:36,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-13 16:06:36,707 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 206 [2024-11-13 16:06:36,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:06:36,714 INFO L225 Difference]: With dead ends: 1460 [2024-11-13 16:06:36,715 INFO L226 Difference]: Without dead ends: 966 [2024-11-13 16:06:36,717 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 65 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 46.9s TimeCoverageRelationStatistics Valid=330, Invalid=792, Unknown=0, NotChecked=0, Total=1122 [2024-11-13 16:06:36,718 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 1002 mSDsluCounter, 924 mSDsCounter, 0 mSdLazyCounter, 1767 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1002 SdHoareTripleChecker+Valid, 1096 SdHoareTripleChecker+Invalid, 1778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.3s IncrementalHoareTripleChecker+Time [2024-11-13 16:06:36,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1002 Valid, 1096 Invalid, 1778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1767 Invalid, 0 Unknown, 0 Unchecked, 14.3s Time] [2024-11-13 16:06:36,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2024-11-13 16:06:36,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 759. [2024-11-13 16:06:36,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 759 states, 594 states have (on average 1.4377104377104377) internal successors, (854), 597 states have internal predecessors, (854), 152 states have call successors, (152), 12 states have call predecessors, (152), 12 states have return successors, (152), 149 states have call predecessors, (152), 152 states have call successors, (152) [2024-11-13 16:06:36,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1158 transitions. [2024-11-13 16:06:36,808 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1158 transitions. Word has length 206 [2024-11-13 16:06:36,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:06:36,812 INFO L471 AbstractCegarLoop]: Abstraction has 759 states and 1158 transitions. [2024-11-13 16:06:36,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-13 16:06:36,812 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1158 transitions. [2024-11-13 16:06:36,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-13 16:06:36,816 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:06:36,817 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:06:36,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 16:06:36,817 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:06:36,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:06:36,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1791843370, now seen corresponding path program 1 times [2024-11-13 16:06:36,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:06:36,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347165482] [2024-11-13 16:06:36,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:06:36,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:06:36,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:07:51,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 16:07:51,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:07:51,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 16:07:51,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:07:51,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 16:07:51,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:07:51,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 16:07:51,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:07:51,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 16:07:51,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:07:51,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 16:07:51,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:07:51,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 16:07:51,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:07:51,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 16:07:51,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:07:51,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 16:07:51,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:07:51,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 16:07:51,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:07:51,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 16:07:51,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:07:51,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 16:07:51,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:07:51,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-13 16:07:51,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:07:51,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 16:07:51,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:07:51,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-13 16:07:51,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:07:51,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-13 16:07:51,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:07:51,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-13 16:07:51,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:07:51,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-13 16:07:51,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:07:51,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-13 16:07:51,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:07:51,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-13 16:07:51,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:07:51,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-13 16:07:51,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:07:51,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-13 16:07:51,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:07:51,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-13 16:07:51,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:07:51,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-13 16:07:51,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:07:51,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-13 16:07:51,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:07:51,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-13 16:07:51,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:07:51,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-13 16:07:51,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:07:51,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-13 16:07:51,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:07:51,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-13 16:07:51,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:07:51,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-13 16:07:51,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:07:51,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-13 16:07:51,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:07:51,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-13 16:07:51,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:07:51,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347165482] [2024-11-13 16:07:51,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347165482] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:07:51,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:07:51,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-13 16:07:51,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815151979] [2024-11-13 16:07:51,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:07:51,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-13 16:07:51,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:07:51,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-13 16:07:51,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2024-11-13 16:07:51,871 INFO L87 Difference]: Start difference. First operand 759 states and 1158 transitions. Second operand has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-13 16:08:25,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:08:25,103 INFO L93 Difference]: Finished difference Result 1476 states and 2212 transitions. [2024-11-13 16:08:25,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-13 16:08:25,104 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 206 [2024-11-13 16:08:25,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:08:25,111 INFO L225 Difference]: With dead ends: 1476 [2024-11-13 16:08:25,111 INFO L226 Difference]: Without dead ends: 966 [2024-11-13 16:08:25,114 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 33.5s TimeCoverageRelationStatistics Valid=277, Invalid=653, Unknown=0, NotChecked=0, Total=930 [2024-11-13 16:08:25,115 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 892 mSDsluCounter, 991 mSDsCounter, 0 mSdLazyCounter, 1790 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 892 SdHoareTripleChecker+Valid, 1203 SdHoareTripleChecker+Invalid, 1798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.7s IncrementalHoareTripleChecker+Time [2024-11-13 16:08:25,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [892 Valid, 1203 Invalid, 1798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1790 Invalid, 0 Unknown, 0 Unchecked, 12.7s Time] [2024-11-13 16:08:25,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2024-11-13 16:08:25,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 748. [2024-11-13 16:08:25,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 583 states have (on average 1.4356775300171527) internal successors, (837), 586 states have internal predecessors, (837), 152 states have call successors, (152), 12 states have call predecessors, (152), 12 states have return successors, (152), 149 states have call predecessors, (152), 152 states have call successors, (152) [2024-11-13 16:08:25,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1141 transitions. [2024-11-13 16:08:25,201 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1141 transitions. Word has length 206 [2024-11-13 16:08:25,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:08:25,202 INFO L471 AbstractCegarLoop]: Abstraction has 748 states and 1141 transitions. [2024-11-13 16:08:25,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-13 16:08:25,202 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1141 transitions. [2024-11-13 16:08:25,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-13 16:08:25,204 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:08:25,205 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:08:25,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 16:08:25,205 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:08:25,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:08:25,206 INFO L85 PathProgramCache]: Analyzing trace with hash -169319002, now seen corresponding path program 1 times [2024-11-13 16:08:25,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:08:25,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990266622] [2024-11-13 16:08:25,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:08:25,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:08:25,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:08:54,125 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9f1358a-a387-4c91-8b4d-04a8cc41f8e5/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-13 16:08:54,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 16:08:54,127 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9f1358a-a387-4c91-8b4d-04a8cc41f8e5/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:294) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:499) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:484) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:590) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:245) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:318) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:728) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.postprocessInterpolant(NestedInterpolantsBuilder.java:449) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.buildPredicates(NestedInterpolantsBuilder.java:392) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:163) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:320) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:222) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:276) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 57 more [2024-11-13 16:08:54,125 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9f1358a-a387-4c91-8b4d-04a8cc41f8e5/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2024-11-13 16:08:54,137 INFO L158 Benchmark]: Toolchain (without parser) took 615633.40ms. Allocated memory was 142.6MB in the beginning and 931.1MB in the end (delta: 788.5MB). Free memory was 118.7MB in the beginning and 429.4MB in the end (delta: -310.7MB). Peak memory consumption was 565.2MB. Max. memory is 16.1GB. [2024-11-13 16:08:54,137 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 167.8MB. Free memory is still 105.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 16:08:54,137 INFO L158 Benchmark]: CACSL2BoogieTranslator took 456.43ms. Allocated memory is still 142.6MB. Free memory was 118.7MB in the beginning and 102.3MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 16:08:54,138 INFO L158 Benchmark]: Boogie Procedure Inliner took 112.80ms. Allocated memory is still 142.6MB. Free memory was 102.3MB in the beginning and 96.7MB in the end (delta: 5.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 16:08:54,138 INFO L158 Benchmark]: Boogie Preprocessor took 133.53ms. Allocated memory is still 142.6MB. Free memory was 96.7MB in the beginning and 90.3MB in the end (delta: 6.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 16:08:54,138 INFO L158 Benchmark]: RCFGBuilder took 1248.91ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 52.6MB in the end (delta: 37.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-11-13 16:08:54,139 INFO L158 Benchmark]: TraceAbstraction took 613670.41ms. Allocated memory was 142.6MB in the beginning and 931.1MB in the end (delta: 788.5MB). Free memory was 51.9MB in the beginning and 429.4MB in the end (delta: -377.4MB). Peak memory consumption was 498.1MB. Max. memory is 16.1GB. [2024-11-13 16:08:54,142 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.37ms. Allocated memory is still 167.8MB. Free memory is still 105.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 456.43ms. Allocated memory is still 142.6MB. Free memory was 118.7MB in the beginning and 102.3MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 112.80ms. Allocated memory is still 142.6MB. Free memory was 102.3MB in the beginning and 96.7MB in the end (delta: 5.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 133.53ms. Allocated memory is still 142.6MB. Free memory was 96.7MB in the beginning and 90.3MB in the end (delta: 6.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1248.91ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 52.6MB in the end (delta: 37.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 613670.41ms. Allocated memory was 142.6MB in the beginning and 931.1MB in the end (delta: 788.5MB). Free memory was 51.9MB in the beginning and 429.4MB in the end (delta: -377.4MB). Peak memory consumption was 498.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9f1358a-a387-4c91-8b4d-04a8cc41f8e5/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9f1358a-a387-4c91-8b4d-04a8cc41f8e5/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. 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_b9f1358a-a387-4c91-8b4d-04a8cc41f8e5/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9f1358a-a387-4c91-8b4d-04a8cc41f8e5/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_b9f1358a-a387-4c91-8b4d-04a8cc41f8e5/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9f1358a-a387-4c91-8b4d-04a8cc41f8e5/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-14.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9f1358a-a387-4c91-8b4d-04a8cc41f8e5/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_b9f1358a-a387-4c91-8b4d-04a8cc41f8e5/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 a72044eca37c9344cf7356219da330f9c945a1c22555364502c74c325db2c27b --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 16:08:57,270 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 16:08:57,399 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9f1358a-a387-4c91-8b4d-04a8cc41f8e5/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-13 16:08:57,413 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 16:08:57,414 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 16:08:57,454 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 16:08:57,455 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 16:08:57,456 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 16:08:57,456 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 16:08:57,456 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 16:08:57,457 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 16:08:57,457 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 16:08:57,457 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 16:08:57,458 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 16:08:57,458 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 16:08:57,458 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 16:08:57,458 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 16:08:57,459 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 16:08:57,459 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 16:08:57,459 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 16:08:57,459 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 16:08:57,459 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 16:08:57,459 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 16:08:57,460 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 16:08:57,460 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 16:08:57,460 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 16:08:57,460 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 16:08:57,460 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 16:08:57,461 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 16:08:57,461 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 16:08:57,461 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 16:08:57,461 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 16:08:57,461 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 16:08:57,462 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 16:08:57,462 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 16:08:57,462 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 16:08:57,462 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 16:08:57,462 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 16:08:57,463 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-13 16:08:57,467 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 16:08:57,467 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 16:08:57,467 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 16:08:57,467 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 16:08:57,467 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 16:08:57,467 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_b9f1358a-a387-4c91-8b4d-04a8cc41f8e5/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 -> a72044eca37c9344cf7356219da330f9c945a1c22555364502c74c325db2c27b [2024-11-13 16:08:57,897 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 16:08:57,908 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 16:08:57,911 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 16:08:57,913 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 16:08:57,913 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 16:08:57,915 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9f1358a-a387-4c91-8b4d-04a8cc41f8e5/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-14.i Unable to find full path for "g++" [2024-11-13 16:09:00,462 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 16:09:00,793 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 16:09:00,794 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9f1358a-a387-4c91-8b4d-04a8cc41f8e5/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-14.i [2024-11-13 16:09:00,807 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9f1358a-a387-4c91-8b4d-04a8cc41f8e5/bin/uautomizer-verify-qhAvR1uOyd/data/e789281aa/b35b69cc1ea44294b3720bd06545702e/FLAG972a0e228 [2024-11-13 16:09:00,827 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9f1358a-a387-4c91-8b4d-04a8cc41f8e5/bin/uautomizer-verify-qhAvR1uOyd/data/e789281aa/b35b69cc1ea44294b3720bd06545702e [2024-11-13 16:09:00,830 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 16:09:00,832 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 16:09:00,834 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 16:09:00,834 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 16:09:00,840 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 16:09:00,841 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 04:09:00" (1/1) ... [2024-11-13 16:09:00,843 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dff39c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:09:00, skipping insertion in model container [2024-11-13 16:09:00,843 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 04:09:00" (1/1) ... [2024-11-13 16:09:00,874 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 16:09:01,062 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_b9f1358a-a387-4c91-8b4d-04a8cc41f8e5/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-14.i[916,929] [2024-11-13 16:09:01,180 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 16:09:01,198 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 16:09:01,210 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_b9f1358a-a387-4c91-8b4d-04a8cc41f8e5/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-14.i[916,929] [2024-11-13 16:09:01,274 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 16:09:01,297 INFO L204 MainTranslator]: Completed translation [2024-11-13 16:09:01,298 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:09:01 WrapperNode [2024-11-13 16:09:01,298 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 16:09:01,299 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 16:09:01,300 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 16:09:01,300 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 16:09:01,308 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:09:01" (1/1) ... [2024-11-13 16:09:01,325 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:09:01" (1/1) ... [2024-11-13 16:09:01,362 INFO L138 Inliner]: procedures = 27, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 204 [2024-11-13 16:09:01,363 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 16:09:01,363 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 16:09:01,364 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 16:09:01,364 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 16:09:01,376 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:09:01" (1/1) ... [2024-11-13 16:09:01,379 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:09:01" (1/1) ... [2024-11-13 16:09:01,385 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:09:01" (1/1) ... [2024-11-13 16:09:01,414 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 16:09:01,417 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:09:01" (1/1) ... [2024-11-13 16:09:01,418 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:09:01" (1/1) ... [2024-11-13 16:09:01,431 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:09:01" (1/1) ... [2024-11-13 16:09:01,440 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:09:01" (1/1) ... [2024-11-13 16:09:01,446 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:09:01" (1/1) ... [2024-11-13 16:09:01,452 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:09:01" (1/1) ... [2024-11-13 16:09:01,461 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 16:09:01,462 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 16:09:01,464 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 16:09:01,464 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 16:09:01,468 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:09:01" (1/1) ... [2024-11-13 16:09:01,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 16:09:01,499 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9f1358a-a387-4c91-8b4d-04a8cc41f8e5/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:09:01,517 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9f1358a-a387-4c91-8b4d-04a8cc41f8e5/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 16:09:01,522 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9f1358a-a387-4c91-8b4d-04a8cc41f8e5/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 16:09:01,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 16:09:01,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-13 16:09:01,560 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 16:09:01,561 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 16:09:01,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 16:09:01,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 16:09:01,700 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 16:09:01,702 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 16:09:03,972 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-13 16:09:03,972 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 16:09:03,987 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 16:09:03,987 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 16:09:03,987 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:09:03 BoogieIcfgContainer [2024-11-13 16:09:03,988 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 16:09:03,991 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 16:09:03,991 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 16:09:03,998 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 16:09:03,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 04:09:00" (1/3) ... [2024-11-13 16:09:03,999 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72268808 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 04:09:03, skipping insertion in model container [2024-11-13 16:09:03,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:09:01" (2/3) ... [2024-11-13 16:09:03,999 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72268808 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 04:09:03, skipping insertion in model container [2024-11-13 16:09:04,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:09:03" (3/3) ... [2024-11-13 16:09:04,001 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-14.i [2024-11-13 16:09:04,021 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 16:09:04,023 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-while_file-14.i that has 2 procedures, 89 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 16:09:04,099 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 16:09:04,115 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;@5206627a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 16:09:04,116 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 16:09:04,121 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 56 states have internal predecessors, (78), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-13 16:09:04,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-13 16:09:04,141 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:09:04,143 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:09:04,143 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:09:04,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:09:04,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1112981972, now seen corresponding path program 1 times [2024-11-13 16:09:04,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:09:04,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1179051493] [2024-11-13 16:09:04,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:09:04,167 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 16:09:04,167 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9f1358a-a387-4c91-8b4d-04a8cc41f8e5/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 16:09:04,173 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9f1358a-a387-4c91-8b4d-04a8cc41f8e5/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 16:09:04,174 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9f1358a-a387-4c91-8b4d-04a8cc41f8e5/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 16:09:04,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:09:04,844 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-13 16:09:04,861 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:09:04,962 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 704 proven. 0 refuted. 0 times theorem prover too weak. 1156 trivial. 0 not checked. [2024-11-13 16:09:04,962 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:09:04,963 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:09:04,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1179051493] [2024-11-13 16:09:04,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1179051493] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:09:04,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:09:04,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 16:09:04,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579176635] [2024-11-13 16:09:04,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:09:04,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 16:09:04,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:09:04,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 16:09:04,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 16:09:05,002 INFO L87 Difference]: Start difference. First operand has 89 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 56 states have internal predecessors, (78), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-13 16:09:05,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:09:05,043 INFO L93 Difference]: Finished difference Result 170 states and 303 transitions. [2024-11-13 16:09:05,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 16:09:05,046 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 196 [2024-11-13 16:09:05,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:09:05,060 INFO L225 Difference]: With dead ends: 170 [2024-11-13 16:09:05,060 INFO L226 Difference]: Without dead ends: 84 [2024-11-13 16:09:05,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 195 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 16:09:05,072 INFO L432 NwaCegarLoop]: 130 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, 130 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 16:09:05,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 16:09:05,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-13 16:09:05,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-13 16:09:05,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 51 states have internal predecessors, (68), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-13 16:09:05,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 130 transitions. [2024-11-13 16:09:05,160 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 130 transitions. Word has length 196 [2024-11-13 16:09:05,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:09:05,161 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 130 transitions. [2024-11-13 16:09:05,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-13 16:09:05,162 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 130 transitions. [2024-11-13 16:09:05,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-13 16:09:05,169 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:09:05,170 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:09:05,184 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9f1358a-a387-4c91-8b4d-04a8cc41f8e5/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 16:09:05,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9f1358a-a387-4c91-8b4d-04a8cc41f8e5/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 16:09:05,371 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:09:05,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:09:05,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1710432878, now seen corresponding path program 1 times [2024-11-13 16:09:05,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:09:05,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [242303773] [2024-11-13 16:09:05,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:09:05,375 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 16:09:05,375 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9f1358a-a387-4c91-8b4d-04a8cc41f8e5/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 16:09:05,380 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9f1358a-a387-4c91-8b4d-04a8cc41f8e5/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 16:09:05,384 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9f1358a-a387-4c91-8b4d-04a8cc41f8e5/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 16:09:06,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:09:06,076 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 16:09:06,084 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:09:09,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-13 16:09:09,033 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:09:09,033 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:09:09,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [242303773] [2024-11-13 16:09:09,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [242303773] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:09:09,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:09:09,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 16:09:09,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845674705] [2024-11-13 16:09:09,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:09:09,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 16:09:09,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:09:09,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 16:09:09,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 16:09:09,038 INFO L87 Difference]: Start difference. First operand 84 states and 130 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-13 16:09:12,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:09:12,429 INFO L93 Difference]: Finished difference Result 255 states and 394 transitions. [2024-11-13 16:09:12,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 16:09:12,448 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 196 [2024-11-13 16:09:12,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:09:12,453 INFO L225 Difference]: With dead ends: 255 [2024-11-13 16:09:12,453 INFO L226 Difference]: Without dead ends: 174 [2024-11-13 16:09:12,454 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 193 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 16:09:12,456 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 106 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-13 16:09:12,456 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 360 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-13 16:09:12,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-13 16:09:12,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 163. [2024-11-13 16:09:12,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 98 states have (on average 1.336734693877551) internal successors, (131), 98 states have internal predecessors, (131), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-13 16:09:12,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 255 transitions. [2024-11-13 16:09:12,527 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 255 transitions. Word has length 196 [2024-11-13 16:09:12,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:09:12,532 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 255 transitions. [2024-11-13 16:09:12,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-13 16:09:12,533 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 255 transitions. [2024-11-13 16:09:12,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-13 16:09:12,540 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:09:12,541 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:09:12,558 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9f1358a-a387-4c91-8b4d-04a8cc41f8e5/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 16:09:12,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9f1358a-a387-4c91-8b4d-04a8cc41f8e5/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 16:09:12,742 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:09:12,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:09:12,743 INFO L85 PathProgramCache]: Analyzing trace with hash 21489136, now seen corresponding path program 1 times [2024-11-13 16:09:12,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:09:12,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [210133100] [2024-11-13 16:09:12,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:09:12,744 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 16:09:12,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9f1358a-a387-4c91-8b4d-04a8cc41f8e5/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 16:09:12,748 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9f1358a-a387-4c91-8b4d-04a8cc41f8e5/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 16:09:12,750 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9f1358a-a387-4c91-8b4d-04a8cc41f8e5/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 16:09:13,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:09:13,244 INFO L255 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 16:09:13,252 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:09:14,556 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-13 16:09:14,557 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:09:14,557 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:09:14,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [210133100] [2024-11-13 16:09:14,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [210133100] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:09:14,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:09:14,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 16:09:14,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517282794] [2024-11-13 16:09:14,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:09:14,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 16:09:14,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:09:14,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 16:09:14,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 16:09:14,560 INFO L87 Difference]: Start difference. First operand 163 states and 255 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-13 16:09:17,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 16:09:17,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 16:09:17,640 INFO L93 Difference]: Finished difference Result 404 states and 634 transitions. [2024-11-13 16:09:17,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 16:09:17,642 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 196 [2024-11-13 16:09:17,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 16:09:17,648 INFO L225 Difference]: With dead ends: 404 [2024-11-13 16:09:17,652 INFO L226 Difference]: Without dead ends: 244 [2024-11-13 16:09:17,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 193 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 16:09:17,655 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 35 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-13 16:09:17,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 358 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-13 16:09:17,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-11-13 16:09:17,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 242. [2024-11-13 16:09:17,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 145 states have (on average 1.3310344827586207) internal successors, (193), 145 states have internal predecessors, (193), 93 states have call successors, (93), 3 states have call predecessors, (93), 3 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2024-11-13 16:09:17,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 379 transitions. [2024-11-13 16:09:17,719 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 379 transitions. Word has length 196 [2024-11-13 16:09:17,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 16:09:17,720 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 379 transitions. [2024-11-13 16:09:17,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-13 16:09:17,721 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 379 transitions. [2024-11-13 16:09:17,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-13 16:09:17,725 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 16:09:17,725 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:09:17,739 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9f1358a-a387-4c91-8b4d-04a8cc41f8e5/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-13 16:09:17,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9f1358a-a387-4c91-8b4d-04a8cc41f8e5/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 16:09:17,926 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 16:09:17,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:09:17,927 INFO L85 PathProgramCache]: Analyzing trace with hash -385413863, now seen corresponding path program 1 times [2024-11-13 16:09:17,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:09:17,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [912085926] [2024-11-13 16:09:17,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:09:17,928 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 16:09:17,928 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9f1358a-a387-4c91-8b4d-04a8cc41f8e5/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 16:09:17,933 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9f1358a-a387-4c91-8b4d-04a8cc41f8e5/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 16:09:17,934 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b9f1358a-a387-4c91-8b4d-04a8cc41f8e5/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 16:09:18,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:09:18,804 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-13 16:09:18,837 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:10:45,705 WARN L286 SmtUtils]: Spent 7.10s on a formula simplification that was a NOOP. DAG size: 96 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 16:11:08,508 WARN L286 SmtUtils]: Spent 7.28s on a formula simplification that was a NOOP. DAG size: 99 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 16:11:40,187 WARN L286 SmtUtils]: Spent 6.78s on a formula simplification that was a NOOP. DAG size: 102 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)