./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-5.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_c710f713-ced8-4f33-a74a-597bc36e85e7/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c710f713-ced8-4f33-a74a-597bc36e85e7/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_c710f713-ced8-4f33-a74a-597bc36e85e7/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c710f713-ced8-4f33-a74a-597bc36e85e7/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-5.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c710f713-ced8-4f33-a74a-597bc36e85e7/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_c710f713-ced8-4f33-a74a-597bc36e85e7/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 03532d804e91a228e512382776942639e7b4d586babdb4cf497abfe139412ab5 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 12:47:50,172 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 12:47:50,270 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c710f713-ced8-4f33-a74a-597bc36e85e7/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 12:47:50,278 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 12:47:50,279 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 12:47:50,317 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 12:47:50,318 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 12:47:50,319 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 12:47:50,319 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 12:47:50,320 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 12:47:50,321 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 12:47:50,321 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 12:47:50,321 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 12:47:50,321 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 12:47:50,322 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 12:47:50,322 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 12:47:50,322 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 12:47:50,322 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 12:47:50,322 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 12:47:50,322 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 12:47:50,322 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 12:47:50,322 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 12:47:50,322 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 12:47:50,322 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 12:47:50,323 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 12:47:50,323 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 12:47:50,323 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 12:47:50,323 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 12:47:50,323 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 12:47:50,323 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 12:47:50,323 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 12:47:50,323 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 12:47:50,323 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 12:47:50,323 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 12:47:50,323 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 12:47:50,324 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 12:47:50,324 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 12:47:50,324 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 12:47:50,324 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 12:47:50,324 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 12:47:50,324 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 12:47:50,324 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 12:47:50,324 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_c710f713-ced8-4f33-a74a-597bc36e85e7/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 -> 03532d804e91a228e512382776942639e7b4d586babdb4cf497abfe139412ab5 [2024-11-13 12:47:50,657 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 12:47:50,666 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 12:47:50,669 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 12:47:50,671 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 12:47:50,671 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 12:47:50,674 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c710f713-ced8-4f33-a74a-597bc36e85e7/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-5.i Unable to find full path for "g++" [2024-11-13 12:47:52,818 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 12:47:53,146 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 12:47:53,150 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c710f713-ced8-4f33-a74a-597bc36e85e7/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-5.i [2024-11-13 12:47:53,159 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c710f713-ced8-4f33-a74a-597bc36e85e7/bin/uautomizer-verify-qhAvR1uOyd/data/b660b2c7b/e4317d565c8f45d89892e7060fe86a1c/FLAG0e38971c3 [2024-11-13 12:47:53,175 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c710f713-ced8-4f33-a74a-597bc36e85e7/bin/uautomizer-verify-qhAvR1uOyd/data/b660b2c7b/e4317d565c8f45d89892e7060fe86a1c [2024-11-13 12:47:53,178 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 12:47:53,179 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 12:47:53,181 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 12:47:53,181 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 12:47:53,185 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 12:47:53,186 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 12:47:53" (1/1) ... [2024-11-13 12:47:53,187 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29c40687 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:47:53, skipping insertion in model container [2024-11-13 12:47:53,187 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 12:47:53" (1/1) ... [2024-11-13 12:47:53,206 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 12:47:53,406 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_c710f713-ced8-4f33-a74a-597bc36e85e7/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-5.i[914,927] [2024-11-13 12:47:53,489 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 12:47:53,503 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 12:47:53,516 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_c710f713-ced8-4f33-a74a-597bc36e85e7/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-5.i[914,927] [2024-11-13 12:47:53,566 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 12:47:53,596 INFO L204 MainTranslator]: Completed translation [2024-11-13 12:47:53,596 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:47:53 WrapperNode [2024-11-13 12:47:53,597 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 12:47:53,598 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 12:47:53,598 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 12:47:53,598 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 12:47:53,610 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:47:53" (1/1) ... [2024-11-13 12:47:53,621 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:47:53" (1/1) ... [2024-11-13 12:47:53,668 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 105 [2024-11-13 12:47:53,669 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 12:47:53,669 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 12:47:53,670 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 12:47:53,670 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 12:47:53,680 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:47:53" (1/1) ... [2024-11-13 12:47:53,680 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:47:53" (1/1) ... [2024-11-13 12:47:53,682 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:47:53" (1/1) ... [2024-11-13 12:47:53,704 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 12:47:53,704 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:47:53" (1/1) ... [2024-11-13 12:47:53,704 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:47:53" (1/1) ... [2024-11-13 12:47:53,714 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:47:53" (1/1) ... [2024-11-13 12:47:53,725 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:47:53" (1/1) ... [2024-11-13 12:47:53,727 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:47:53" (1/1) ... [2024-11-13 12:47:53,728 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:47:53" (1/1) ... [2024-11-13 12:47:53,735 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 12:47:53,736 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 12:47:53,740 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 12:47:53,741 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 12:47:53,742 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:47:53" (1/1) ... [2024-11-13 12:47:53,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 12:47:53,772 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c710f713-ced8-4f33-a74a-597bc36e85e7/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 12:47:53,787 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c710f713-ced8-4f33-a74a-597bc36e85e7/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 12:47:53,796 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c710f713-ced8-4f33-a74a-597bc36e85e7/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 12:47:53,829 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 12:47:53,830 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 12:47:53,832 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 12:47:53,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 12:47:53,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 12:47:53,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 12:47:53,912 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 12:47:53,915 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 12:47:54,238 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-11-13 12:47:54,238 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 12:47:54,250 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 12:47:54,251 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 12:47:54,251 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:47:54 BoogieIcfgContainer [2024-11-13 12:47:54,251 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 12:47:54,255 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 12:47:54,255 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 12:47:54,261 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 12:47:54,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 12:47:53" (1/3) ... [2024-11-13 12:47:54,262 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a51577e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 12:47:54, skipping insertion in model container [2024-11-13 12:47:54,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:47:53" (2/3) ... [2024-11-13 12:47:54,262 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a51577e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 12:47:54, skipping insertion in model container [2024-11-13 12:47:54,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:47:54" (3/3) ... [2024-11-13 12:47:54,264 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-5.i [2024-11-13 12:47:54,282 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 12:47:54,284 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-5.i that has 2 procedures, 49 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 12:47:54,371 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 12:47:54,393 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;@4af4844d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 12:47:54,394 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 12:47:54,399 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 32 states have (on average 1.34375) internal successors, (43), 33 states have internal predecessors, (43), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-13 12:47:54,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-13 12:47:54,414 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:47:54,415 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:47:54,415 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:47:54,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:47:54,423 INFO L85 PathProgramCache]: Analyzing trace with hash -2011236978, now seen corresponding path program 1 times [2024-11-13 12:47:54,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:47:54,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839609702] [2024-11-13 12:47:54,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:47:54,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:47:54,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:54,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:47:54,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:54,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 12:47:54,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:54,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 12:47:54,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:54,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 12:47:54,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:54,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 12:47:54,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:54,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 12:47:54,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:54,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 12:47:54,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:54,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 12:47:54,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:54,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 12:47:54,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:54,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 12:47:54,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:54,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 12:47:54,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:54,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:47:54,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:54,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 12:47:54,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:54,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 12:47:54,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:54,899 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-13 12:47:54,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:47:54,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839609702] [2024-11-13 12:47:54,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839609702] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:47:54,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:47:54,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 12:47:54,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053530929] [2024-11-13 12:47:54,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:47:54,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 12:47:54,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:47:54,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 12:47:54,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 12:47:54,935 INFO L87 Difference]: Start difference. First operand has 49 states, 32 states have (on average 1.34375) internal successors, (43), 33 states have internal predecessors, (43), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-13 12:47:54,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:47:54,967 INFO L93 Difference]: Finished difference Result 95 states and 153 transitions. [2024-11-13 12:47:54,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:47:54,969 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 93 [2024-11-13 12:47:54,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:47:54,978 INFO L225 Difference]: With dead ends: 95 [2024-11-13 12:47:54,978 INFO L226 Difference]: Without dead ends: 45 [2024-11-13 12:47:54,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 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 12:47:54,987 INFO L432 NwaCegarLoop]: 68 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, 68 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 12:47:54,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 12:47:55,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-13 12:47:55,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-11-13 12:47:55,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-13 12:47:55,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 64 transitions. [2024-11-13 12:47:55,033 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 64 transitions. Word has length 93 [2024-11-13 12:47:55,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:47:55,034 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 64 transitions. [2024-11-13 12:47:55,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-13 12:47:55,034 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 64 transitions. [2024-11-13 12:47:55,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-13 12:47:55,037 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:47:55,038 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:47:55,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 12:47:55,038 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:47:55,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:47:55,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1078087374, now seen corresponding path program 1 times [2024-11-13 12:47:55,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:47:55,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543209675] [2024-11-13 12:47:55,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:47:55,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:47:55,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:57,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:47:57,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:57,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 12:47:57,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:57,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 12:47:57,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:57,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 12:47:57,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:57,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 12:47:57,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:57,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 12:47:57,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:57,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 12:47:57,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:57,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 12:47:57,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:57,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 12:47:57,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:57,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 12:47:57,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:57,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 12:47:57,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:57,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:47:57,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:57,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 12:47:57,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:57,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 12:47:57,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:47:57,693 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-13 12:47:57,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:47:57,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543209675] [2024-11-13 12:47:57,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543209675] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:47:57,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:47:57,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 12:47:57,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793839633] [2024-11-13 12:47:57,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:47:57,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:47:57,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:47:57,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:47:57,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:47:57,697 INFO L87 Difference]: Start difference. First operand 45 states and 64 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 12:47:58,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:47:58,283 INFO L93 Difference]: Finished difference Result 160 states and 228 transitions. [2024-11-13 12:47:58,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:47:58,286 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 93 [2024-11-13 12:47:58,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:47:58,289 INFO L225 Difference]: With dead ends: 160 [2024-11-13 12:47:58,289 INFO L226 Difference]: Without dead ends: 118 [2024-11-13 12:47:58,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-13 12:47:58,295 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 61 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 12:47:58,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 177 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 12:47:58,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-13 12:47:58,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 111. [2024-11-13 12:47:58,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 69 states have (on average 1.2028985507246377) internal successors, (83), 70 states have internal predecessors, (83), 38 states have call successors, (38), 3 states have call predecessors, (38), 3 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-13 12:47:58,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 159 transitions. [2024-11-13 12:47:58,355 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 159 transitions. Word has length 93 [2024-11-13 12:47:58,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:47:58,355 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 159 transitions. [2024-11-13 12:47:58,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 12:47:58,356 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 159 transitions. [2024-11-13 12:47:58,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-13 12:47:58,361 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:47:58,362 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:47:58,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 12:47:58,362 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:47:58,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:47:58,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1079934416, now seen corresponding path program 1 times [2024-11-13 12:47:58,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:47:58,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300397151] [2024-11-13 12:47:58,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:47:58,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:47:58,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:03,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:48:03,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:03,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 12:48:03,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:03,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 12:48:03,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:03,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 12:48:03,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:03,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 12:48:03,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:03,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 12:48:03,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:03,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 12:48:03,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:03,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 12:48:03,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:03,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 12:48:03,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:03,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 12:48:03,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:03,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 12:48:03,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:03,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:48:03,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:03,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 12:48:03,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:03,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 12:48:03,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:03,472 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-13 12:48:03,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:48:03,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300397151] [2024-11-13 12:48:03,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300397151] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:48:03,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:48:03,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 12:48:03,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588521539] [2024-11-13 12:48:03,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:48:03,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 12:48:03,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:48:03,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 12:48:03,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-13 12:48:03,475 INFO L87 Difference]: Start difference. First operand 111 states and 159 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-13 12:48:04,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:48:04,555 INFO L93 Difference]: Finished difference Result 126 states and 174 transitions. [2024-11-13 12:48:04,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:48:04,556 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 93 [2024-11-13 12:48:04,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:48:04,560 INFO L225 Difference]: With dead ends: 126 [2024-11-13 12:48:04,560 INFO L226 Difference]: Without dead ends: 124 [2024-11-13 12:48:04,560 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2024-11-13 12:48:04,561 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 108 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 12:48:04,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 254 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 12:48:04,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-13 12:48:04,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 116. [2024-11-13 12:48:04,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 74 states have (on average 1.1891891891891893) internal successors, (88), 75 states have internal predecessors, (88), 38 states have call successors, (38), 3 states have call predecessors, (38), 3 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-13 12:48:04,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 164 transitions. [2024-11-13 12:48:04,592 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 164 transitions. Word has length 93 [2024-11-13 12:48:04,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:48:04,593 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 164 transitions. [2024-11-13 12:48:04,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-13 12:48:04,593 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 164 transitions. [2024-11-13 12:48:04,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-13 12:48:04,595 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:48:04,595 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:48:04,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 12:48:04,596 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:48:04,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:48:04,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1440025518, now seen corresponding path program 1 times [2024-11-13 12:48:04,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:48:04,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020700632] [2024-11-13 12:48:04,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:48:04,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:48:04,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:04,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:48:04,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:04,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 12:48:04,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:04,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 12:48:04,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:04,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 12:48:04,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:04,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 12:48:04,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:04,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 12:48:04,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:04,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 12:48:04,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:04,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 12:48:04,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:04,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 12:48:04,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:04,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 12:48:04,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:04,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 12:48:04,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:04,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:48:04,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:04,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 12:48:04,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:04,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 12:48:04,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:04,740 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-13 12:48:04,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:48:04,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020700632] [2024-11-13 12:48:04,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020700632] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:48:04,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:48:04,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:48:04,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647520407] [2024-11-13 12:48:04,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:48:04,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:48:04,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:48:04,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:48:04,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:48:04,749 INFO L87 Difference]: Start difference. First operand 116 states and 164 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 12:48:04,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:48:04,785 INFO L93 Difference]: Finished difference Result 224 states and 319 transitions. [2024-11-13 12:48:04,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:48:04,786 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 93 [2024-11-13 12:48:04,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:48:04,790 INFO L225 Difference]: With dead ends: 224 [2024-11-13 12:48:04,790 INFO L226 Difference]: Without dead ends: 111 [2024-11-13 12:48:04,792 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:48:04,795 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 12:48:04,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 12:48:04,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-13 12:48:04,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-13 12:48:04,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 69 states have (on average 1.144927536231884) internal successors, (79), 70 states have internal predecessors, (79), 38 states have call successors, (38), 3 states have call predecessors, (38), 3 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-13 12:48:04,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 155 transitions. [2024-11-13 12:48:04,836 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 155 transitions. Word has length 93 [2024-11-13 12:48:04,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:48:04,841 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 155 transitions. [2024-11-13 12:48:04,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 12:48:04,841 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 155 transitions. [2024-11-13 12:48:04,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-13 12:48:04,843 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:48:04,843 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:48:04,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 12:48:04,843 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:48:04,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:48:04,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1758145744, now seen corresponding path program 1 times [2024-11-13 12:48:04,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:48:04,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59421852] [2024-11-13 12:48:04,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:48:04,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:48:04,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:04,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:48:04,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:04,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 12:48:04,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:04,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 12:48:04,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:04,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 12:48:04,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:04,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 12:48:04,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:04,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 12:48:04,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:04,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 12:48:04,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:04,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 12:48:04,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:04,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 12:48:04,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:04,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 12:48:04,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:04,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 12:48:04,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:04,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:48:04,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:04,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 12:48:04,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:04,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 12:48:05,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:05,006 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-13 12:48:05,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:48:05,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59421852] [2024-11-13 12:48:05,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59421852] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:48:05,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:48:05,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:48:05,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711611628] [2024-11-13 12:48:05,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:48:05,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:48:05,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:48:05,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:48:05,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:48:05,011 INFO L87 Difference]: Start difference. First operand 111 states and 155 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 12:48:05,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:48:05,043 INFO L93 Difference]: Finished difference Result 211 states and 297 transitions. [2024-11-13 12:48:05,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:48:05,044 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 93 [2024-11-13 12:48:05,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:48:05,048 INFO L225 Difference]: With dead ends: 211 [2024-11-13 12:48:05,049 INFO L226 Difference]: Without dead ends: 103 [2024-11-13 12:48:05,050 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:48:05,053 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 0 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 12:48:05,054 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 12:48:05,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-13 12:48:05,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-13 12:48:05,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 61 states have (on average 1.098360655737705) internal successors, (67), 62 states have internal predecessors, (67), 38 states have call successors, (38), 3 states have call predecessors, (38), 3 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-13 12:48:05,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 143 transitions. [2024-11-13 12:48:05,090 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 143 transitions. Word has length 93 [2024-11-13 12:48:05,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:48:05,092 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 143 transitions. [2024-11-13 12:48:05,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 12:48:05,093 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 143 transitions. [2024-11-13 12:48:05,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-13 12:48:05,095 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:48:05,095 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:48:05,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 12:48:05,099 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:48:05,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:48:05,100 INFO L85 PathProgramCache]: Analyzing trace with hash 894870316, now seen corresponding path program 1 times [2024-11-13 12:48:05,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:48:05,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32028640] [2024-11-13 12:48:05,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:48:05,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:48:05,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:06,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:48:06,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:06,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 12:48:06,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:06,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 12:48:06,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:06,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 12:48:06,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:06,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 12:48:06,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:06,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 12:48:06,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:06,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 12:48:06,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:06,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 12:48:06,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:06,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 12:48:06,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:06,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 12:48:06,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:06,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 12:48:06,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:06,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:48:06,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:06,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 12:48:06,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:06,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 12:48:06,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:06,503 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-13 12:48:06,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:48:06,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32028640] [2024-11-13 12:48:06,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32028640] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:48:06,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:48:06,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 12:48:06,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877042666] [2024-11-13 12:48:06,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:48:06,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:48:06,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:48:06,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:48:06,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:48:06,505 INFO L87 Difference]: Start difference. First operand 103 states and 143 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 12:48:07,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:48:07,008 INFO L93 Difference]: Finished difference Result 183 states and 249 transitions. [2024-11-13 12:48:07,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:48:07,009 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 94 [2024-11-13 12:48:07,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:48:07,011 INFO L225 Difference]: With dead ends: 183 [2024-11-13 12:48:07,011 INFO L226 Difference]: Without dead ends: 141 [2024-11-13 12:48:07,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-13 12:48:07,015 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 59 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 12:48:07,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 214 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 12:48:07,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-13 12:48:07,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 117. [2024-11-13 12:48:07,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 74 states have (on average 1.0945945945945945) internal successors, (81), 75 states have internal predecessors, (81), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-13 12:48:07,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 157 transitions. [2024-11-13 12:48:07,049 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 157 transitions. Word has length 94 [2024-11-13 12:48:07,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:48:07,049 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 157 transitions. [2024-11-13 12:48:07,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 12:48:07,050 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 157 transitions. [2024-11-13 12:48:07,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-13 12:48:07,051 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:48:07,051 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:48:07,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 12:48:07,052 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:48:07,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:48:07,052 INFO L85 PathProgramCache]: Analyzing trace with hash 896717358, now seen corresponding path program 1 times [2024-11-13 12:48:07,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:48:07,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675535459] [2024-11-13 12:48:07,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:48:07,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:48:07,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:12,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:48:12,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:12,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 12:48:12,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:12,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 12:48:12,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:12,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 12:48:12,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:12,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 12:48:12,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:12,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 12:48:12,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:12,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 12:48:12,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:12,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 12:48:12,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:12,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 12:48:12,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:12,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 12:48:12,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:12,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 12:48:12,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:12,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:48:12,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:12,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 12:48:12,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:12,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 12:48:12,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:12,435 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-13 12:48:12,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:48:12,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675535459] [2024-11-13 12:48:12,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675535459] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:48:12,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:48:12,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 12:48:12,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201038922] [2024-11-13 12:48:12,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:48:12,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 12:48:12,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:48:12,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 12:48:12,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-13 12:48:12,441 INFO L87 Difference]: Start difference. First operand 117 states and 157 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 12:48:13,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:48:13,001 INFO L93 Difference]: Finished difference Result 127 states and 167 transitions. [2024-11-13 12:48:13,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 12:48:13,002 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 94 [2024-11-13 12:48:13,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:48:13,004 INFO L225 Difference]: With dead ends: 127 [2024-11-13 12:48:13,004 INFO L226 Difference]: Without dead ends: 125 [2024-11-13 12:48:13,005 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-13 12:48:13,009 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 14 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 12:48:13,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 351 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 12:48:13,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-13 12:48:13,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 117. [2024-11-13 12:48:13,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 74 states have (on average 1.0810810810810811) internal successors, (80), 75 states have internal predecessors, (80), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-13 12:48:13,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 156 transitions. [2024-11-13 12:48:13,060 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 156 transitions. Word has length 94 [2024-11-13 12:48:13,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:48:13,060 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 156 transitions. [2024-11-13 12:48:13,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 12:48:13,061 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 156 transitions. [2024-11-13 12:48:13,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-13 12:48:13,064 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:48:13,065 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:48:13,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 12:48:13,065 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:48:13,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:48:13,066 INFO L85 PathProgramCache]: Analyzing trace with hash 679427331, now seen corresponding path program 1 times [2024-11-13 12:48:13,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:48:13,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632463302] [2024-11-13 12:48:13,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:48:13,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:48:13,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:13,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:48:13,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:13,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 12:48:13,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:13,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 12:48:13,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:13,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 12:48:13,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:13,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 12:48:13,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:13,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 12:48:13,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:13,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 12:48:13,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:13,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 12:48:13,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:13,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 12:48:13,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:13,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 12:48:13,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:13,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 12:48:13,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:13,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:48:13,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:13,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 12:48:13,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:13,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 12:48:13,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:13,526 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-13 12:48:13,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:48:13,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632463302] [2024-11-13 12:48:13,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632463302] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:48:13,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:48:13,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 12:48:13,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304317416] [2024-11-13 12:48:13,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:48:13,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:48:13,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:48:13,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:48:13,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-13 12:48:13,531 INFO L87 Difference]: Start difference. First operand 117 states and 156 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 12:48:13,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:48:13,790 INFO L93 Difference]: Finished difference Result 222 states and 297 transitions. [2024-11-13 12:48:13,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:48:13,791 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 95 [2024-11-13 12:48:13,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:48:13,793 INFO L225 Difference]: With dead ends: 222 [2024-11-13 12:48:13,793 INFO L226 Difference]: Without dead ends: 150 [2024-11-13 12:48:13,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-13 12:48:13,797 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 36 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 12:48:13,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 261 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 12:48:13,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-13 12:48:13,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 126. [2024-11-13 12:48:13,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 83 states have (on average 1.0843373493975903) internal successors, (90), 84 states have internal predecessors, (90), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-13 12:48:13,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 166 transitions. [2024-11-13 12:48:13,835 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 166 transitions. Word has length 95 [2024-11-13 12:48:13,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:48:13,836 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 166 transitions. [2024-11-13 12:48:13,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 12:48:13,837 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 166 transitions. [2024-11-13 12:48:13,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-13 12:48:13,839 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 12:48:13,839 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:48:13,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 12:48:13,840 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 12:48:13,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:48:13,840 INFO L85 PathProgramCache]: Analyzing trace with hash 681274373, now seen corresponding path program 1 times [2024-11-13 12:48:13,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:48:13,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321523109] [2024-11-13 12:48:13,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:48:13,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:48:13,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:16,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 12:48:16,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:16,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 12:48:16,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:16,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 12:48:16,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:16,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 12:48:16,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:16,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 12:48:16,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:16,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 12:48:16,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:16,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 12:48:16,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:16,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 12:48:16,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:16,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 12:48:16,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:16,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 12:48:16,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:16,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 12:48:16,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:16,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 12:48:16,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:16,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 12:48:16,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:16,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 12:48:16,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:48:16,340 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-13 12:48:16,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:48:16,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321523109] [2024-11-13 12:48:16,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321523109] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:48:16,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:48:16,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-13 12:48:16,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800783971] [2024-11-13 12:48:16,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:48:16,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 12:48:16,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:48:16,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 12:48:16,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-13 12:48:16,342 INFO L87 Difference]: Start difference. First operand 126 states and 166 transitions. Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 12:48:17,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 12:48:17,613 INFO L93 Difference]: Finished difference Result 217 states and 285 transitions. [2024-11-13 12:48:17,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-13 12:48:17,614 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 95 [2024-11-13 12:48:17,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 12:48:17,614 INFO L225 Difference]: With dead ends: 217 [2024-11-13 12:48:17,615 INFO L226 Difference]: Without dead ends: 0 [2024-11-13 12:48:17,615 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2024-11-13 12:48:17,616 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 36 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 12:48:17,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 323 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 12:48:17,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-13 12:48:17,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-13 12:48:17,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:48:17,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-13 12:48:17,618 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 95 [2024-11-13 12:48:17,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 12:48:17,618 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-13 12:48:17,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-13 12:48:17,618 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-13 12:48:17,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-13 12:48:17,621 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 12:48:17,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 12:48:17,626 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 12:48:17,629 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-13 12:48:18,741 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 12:48:18,785 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 12:48:18 BoogieIcfgContainer [2024-11-13 12:48:18,785 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 12:48:18,786 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 12:48:18,786 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 12:48:18,789 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 12:48:18,790 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:47:54" (3/4) ... [2024-11-13 12:48:18,793 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-13 12:48:18,800 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-13 12:48:18,807 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-13 12:48:18,807 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-13 12:48:18,808 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-13 12:48:18,808 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-13 12:48:18,941 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c710f713-ced8-4f33-a74a-597bc36e85e7/bin/uautomizer-verify-qhAvR1uOyd/witness.graphml [2024-11-13 12:48:18,942 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c710f713-ced8-4f33-a74a-597bc36e85e7/bin/uautomizer-verify-qhAvR1uOyd/witness.yml [2024-11-13 12:48:18,942 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 12:48:18,943 INFO L158 Benchmark]: Toolchain (without parser) took 25763.50ms. Allocated memory was 117.4MB in the beginning and 427.8MB in the end (delta: 310.4MB). Free memory was 93.1MB in the beginning and 329.4MB in the end (delta: -236.3MB). Peak memory consumption was 72.7MB. Max. memory is 16.1GB. [2024-11-13 12:48:18,943 INFO L158 Benchmark]: CDTParser took 0.63ms. Allocated memory is still 167.8MB. Free memory is still 103.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 12:48:18,944 INFO L158 Benchmark]: CACSL2BoogieTranslator took 416.33ms. Allocated memory is still 117.4MB. Free memory was 92.7MB in the beginning and 80.2MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 12:48:18,945 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.94ms. Allocated memory is still 117.4MB. Free memory was 80.2MB in the beginning and 77.4MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 12:48:18,945 INFO L158 Benchmark]: Boogie Preprocessor took 66.17ms. Allocated memory is still 117.4MB. Free memory was 77.4MB in the beginning and 73.8MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 12:48:18,945 INFO L158 Benchmark]: RCFGBuilder took 515.18ms. Allocated memory is still 117.4MB. Free memory was 73.8MB in the beginning and 57.1MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 12:48:18,946 INFO L158 Benchmark]: TraceAbstraction took 24530.87ms. Allocated memory was 117.4MB in the beginning and 427.8MB in the end (delta: 310.4MB). Free memory was 56.7MB in the beginning and 333.6MB in the end (delta: -276.9MB). Peak memory consumption was 215.7MB. Max. memory is 16.1GB. [2024-11-13 12:48:18,946 INFO L158 Benchmark]: Witness Printer took 155.76ms. Allocated memory is still 427.8MB. Free memory was 333.6MB in the beginning and 329.4MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 12:48:18,949 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.63ms. Allocated memory is still 167.8MB. Free memory is still 103.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 416.33ms. Allocated memory is still 117.4MB. Free memory was 92.7MB in the beginning and 80.2MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.94ms. Allocated memory is still 117.4MB. Free memory was 80.2MB in the beginning and 77.4MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.17ms. Allocated memory is still 117.4MB. Free memory was 77.4MB in the beginning and 73.8MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 515.18ms. Allocated memory is still 117.4MB. Free memory was 73.8MB in the beginning and 57.1MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 24530.87ms. Allocated memory was 117.4MB in the beginning and 427.8MB in the end (delta: 310.4MB). Free memory was 56.7MB in the beginning and 333.6MB in the end (delta: -276.9MB). Peak memory consumption was 215.7MB. Max. memory is 16.1GB. * Witness Printer took 155.76ms. Allocated memory is still 427.8MB. Free memory was 333.6MB in the beginning and 329.4MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 49 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.3s, OverallIterations: 9, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 314 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 314 mSDsluCounter, 1888 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1246 mSDsCounter, 103 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 777 IncrementalHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 103 mSolverCounterUnsat, 642 mSDtfsCounter, 777 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 360 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=126occurred in iteration=8, InterpolantAutomatonStates: 61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 71 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 17.6s InterpolantComputationTime, 843 NumberOfCodeBlocks, 843 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 834 ConstructedInterpolants, 0 QuantifiedInterpolants, 3651 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 3276/3276 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: (((((((var_1_9 == 0) || (((var_1_11 != 0) || (var_1_13 == 10)) && ((var_1_11 == 0) || (((((long long) last_1_var_1_8 + var_1_4) < ((int) var_1_7 + var_1_10)) || (var_1_13 == 10)) && ((((int) var_1_7 + var_1_10) < (((long long) last_1_var_1_8 + var_1_4) + 1)) || (10 == var_1_12)))))) && (var_1_8 == 10)) && (var_1_15 == var_1_12)) || (((var_1_8 == var_1_15) && (0 <= 0)) && (var_1_12 <= var_1_8))) || ((((((var_1_11 != 0) || (var_1_9 == 0)) || (var_1_8 == var_1_13)) && (var_1_1 == 0)) && ((var_1_11 == 0) || ((((((int) var_1_7 + var_1_10) < (((long long) last_1_var_1_8 + var_1_4) + 1)) || (var_1_9 == 0)) || (var_1_8 == var_1_12)) && (((((long long) last_1_var_1_8 + var_1_4) < ((int) var_1_7 + var_1_10)) || (var_1_9 == 0)) || (var_1_8 == var_1_13))))) && (((var_1_8 == var_1_15) && (var_1_12 <= var_1_8)) || (((var_1_8 + 1) <= var_1_12) && (var_1_15 == var_1_12))))) || (((((var_1_12 <= 10) && (10 != var_1_12)) || ((var_1_13 <= (var_1_13 + 10)) && (var_1_13 <= (245 + var_1_13)))) && ((var_1_9 == 0) || (((var_1_11 != 0) || (var_1_13 == 10)) && ((var_1_11 == 0) || (((((long long) last_1_var_1_8 + var_1_4) < ((int) var_1_7 + var_1_10)) || (var_1_13 == 10)) && ((((int) var_1_7 + var_1_10) < (((long long) last_1_var_1_8 + var_1_4) + 1)) || (10 == var_1_12))))))) && (var_1_8 == 10))) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (((((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_4 == \old(var_1_4))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) && (var_1_9 == \old(var_1_9))) && (var_1_10 == \old(var_1_10))) && (var_1_11 == \old(var_1_11))) && (var_1_12 == \old(var_1_12))) && (var_1_13 == \old(var_1_13))) && (var_1_14 == \old(var_1_14))) && (var_1_15 == \old(var_1_15))) && (last_1_var_1_8 == \old(last_1_var_1_8))) RESULT: Ultimate proved your program to be correct! [2024-11-13 12:48:18,996 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c710f713-ced8-4f33-a74a-597bc36e85e7/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE