./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label15.c --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_b99dfd16-1005-400d-ab9c-1b2bcca5fc01/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b99dfd16-1005-400d-ab9c-1b2bcca5fc01/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_b99dfd16-1005-400d-ab9c-1b2bcca5fc01/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b99dfd16-1005-400d-ab9c-1b2bcca5fc01/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label15.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b99dfd16-1005-400d-ab9c-1b2bcca5fc01/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_b99dfd16-1005-400d-ab9c-1b2bcca5fc01/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 303e81240b0a1989638e497fa3fbaa4e2ebd948d9aafa1986663f2c99e7f43f3 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 14:57:18,292 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 14:57:18,359 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b99dfd16-1005-400d-ab9c-1b2bcca5fc01/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 14:57:18,365 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 14:57:18,366 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 14:57:18,394 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 14:57:18,395 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 14:57:18,395 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 14:57:18,395 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 14:57:18,395 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 14:57:18,395 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 14:57:18,396 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 14:57:18,396 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 14:57:18,396 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 14:57:18,396 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 14:57:18,396 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 14:57:18,396 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 14:57:18,397 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 14:57:18,397 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 14:57:18,400 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 14:57:18,400 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 14:57:18,400 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 14:57:18,400 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 14:57:18,400 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 14:57:18,400 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 14:57:18,400 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 14:57:18,401 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 14:57:18,401 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 14:57:18,401 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 14:57:18,401 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 14:57:18,401 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 14:57:18,401 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 14:57:18,401 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:57:18,401 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 14:57:18,401 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 14:57:18,402 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 14:57:18,402 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 14:57:18,402 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 14:57:18,402 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 14:57:18,402 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 14:57:18,402 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 14:57:18,402 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 14:57:18,402 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_b99dfd16-1005-400d-ab9c-1b2bcca5fc01/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 -> 303e81240b0a1989638e497fa3fbaa4e2ebd948d9aafa1986663f2c99e7f43f3 [2024-11-13 14:57:18,762 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 14:57:18,777 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 14:57:18,779 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 14:57:18,782 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 14:57:18,782 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 14:57:18,784 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b99dfd16-1005-400d-ab9c-1b2bcca5fc01/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/eca-rers2012/Problem02_label15.c Unable to find full path for "g++" [2024-11-13 14:57:20,926 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 14:57:21,411 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 14:57:21,412 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b99dfd16-1005-400d-ab9c-1b2bcca5fc01/sv-benchmarks/c/eca-rers2012/Problem02_label15.c [2024-11-13 14:57:21,426 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b99dfd16-1005-400d-ab9c-1b2bcca5fc01/bin/uautomizer-verify-qhAvR1uOyd/data/39d67d682/2200d079d0bb410bb48787572c198667/FLAGca0430c3d [2024-11-13 14:57:21,460 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b99dfd16-1005-400d-ab9c-1b2bcca5fc01/bin/uautomizer-verify-qhAvR1uOyd/data/39d67d682/2200d079d0bb410bb48787572c198667 [2024-11-13 14:57:21,464 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 14:57:21,465 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 14:57:21,469 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 14:57:21,469 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 14:57:21,475 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 14:57:21,476 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:57:21" (1/1) ... [2024-11-13 14:57:21,477 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40e07402 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:57:21, skipping insertion in model container [2024-11-13 14:57:21,479 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:57:21" (1/1) ... [2024-11-13 14:57:21,535 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 14:57:21,945 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_b99dfd16-1005-400d-ab9c-1b2bcca5fc01/sv-benchmarks/c/eca-rers2012/Problem02_label15.c[20193,20206] [2024-11-13 14:57:21,975 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:57:21,991 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 14:57:22,087 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_b99dfd16-1005-400d-ab9c-1b2bcca5fc01/sv-benchmarks/c/eca-rers2012/Problem02_label15.c[20193,20206] [2024-11-13 14:57:22,095 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:57:22,112 INFO L204 MainTranslator]: Completed translation [2024-11-13 14:57:22,112 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:57:22 WrapperNode [2024-11-13 14:57:22,113 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 14:57:22,114 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 14:57:22,114 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 14:57:22,114 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 14:57:22,122 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:57:22" (1/1) ... [2024-11-13 14:57:22,148 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:57:22" (1/1) ... [2024-11-13 14:57:22,228 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 668 [2024-11-13 14:57:22,228 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 14:57:22,229 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 14:57:22,229 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 14:57:22,229 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 14:57:22,240 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:57:22" (1/1) ... [2024-11-13 14:57:22,241 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:57:22" (1/1) ... [2024-11-13 14:57:22,250 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:57:22" (1/1) ... [2024-11-13 14:57:22,277 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 14:57:22,277 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:57:22" (1/1) ... [2024-11-13 14:57:22,277 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:57:22" (1/1) ... [2024-11-13 14:57:22,296 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:57:22" (1/1) ... [2024-11-13 14:57:22,305 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:57:22" (1/1) ... [2024-11-13 14:57:22,309 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:57:22" (1/1) ... [2024-11-13 14:57:22,312 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:57:22" (1/1) ... [2024-11-13 14:57:22,318 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 14:57:22,319 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 14:57:22,319 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 14:57:22,319 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 14:57:22,323 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:57:22" (1/1) ... [2024-11-13 14:57:22,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:57:22,348 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b99dfd16-1005-400d-ab9c-1b2bcca5fc01/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:57:22,363 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b99dfd16-1005-400d-ab9c-1b2bcca5fc01/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 14:57:22,367 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b99dfd16-1005-400d-ab9c-1b2bcca5fc01/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 14:57:22,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 14:57:22,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 14:57:22,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 14:57:22,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 14:57:22,479 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 14:57:22,481 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 14:57:23,975 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-13 14:57:23,976 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 14:57:23,996 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 14:57:24,000 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 14:57:24,000 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:57:24 BoogieIcfgContainer [2024-11-13 14:57:24,001 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 14:57:24,003 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 14:57:24,004 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 14:57:24,009 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 14:57:24,009 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 02:57:21" (1/3) ... [2024-11-13 14:57:24,010 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cba1a5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:57:24, skipping insertion in model container [2024-11-13 14:57:24,010 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:57:22" (2/3) ... [2024-11-13 14:57:24,011 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cba1a5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:57:24, skipping insertion in model container [2024-11-13 14:57:24,011 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:57:24" (3/3) ... [2024-11-13 14:57:24,012 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label15.c [2024-11-13 14:57:24,028 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 14:57:24,030 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem02_label15.c that has 1 procedures, 227 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 14:57:24,125 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 14:57:24,143 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;@312819a7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 14:57:24,143 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 14:57:24,151 INFO L276 IsEmpty]: Start isEmpty. Operand has 227 states, 225 states have (on average 1.6666666666666667) internal successors, (375), 226 states have internal predecessors, (375), 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 14:57:24,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-13 14:57:24,169 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:57:24,170 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:57:24,171 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:57:24,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:57:24,179 INFO L85 PathProgramCache]: Analyzing trace with hash 942602381, now seen corresponding path program 1 times [2024-11-13 14:57:24,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:57:24,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308787479] [2024-11-13 14:57:24,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:57:24,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:57:24,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:57:24,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:57:24,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:57:24,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308787479] [2024-11-13 14:57:24,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308787479] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:57:24,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:57:24,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:57:24,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501612491] [2024-11-13 14:57:24,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:57:24,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:57:24,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:57:25,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:57:25,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:57:25,025 INFO L87 Difference]: Start difference. First operand has 227 states, 225 states have (on average 1.6666666666666667) internal successors, (375), 226 states have internal predecessors, (375), 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) Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 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 14:57:26,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:57:26,148 INFO L93 Difference]: Finished difference Result 601 states and 1035 transitions. [2024-11-13 14:57:26,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:57:26,154 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 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) Word has length 130 [2024-11-13 14:57:26,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:57:26,173 INFO L225 Difference]: With dead ends: 601 [2024-11-13 14:57:26,173 INFO L226 Difference]: Without dead ends: 310 [2024-11-13 14:57:26,179 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 14:57:26,185 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 104 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:57:26,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 117 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-13 14:57:26,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2024-11-13 14:57:26,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2024-11-13 14:57:26,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 309 states have (on average 1.4368932038834952) internal successors, (444), 309 states have internal predecessors, (444), 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 14:57:26,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 444 transitions. [2024-11-13 14:57:26,243 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 444 transitions. Word has length 130 [2024-11-13 14:57:26,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:57:26,244 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 444 transitions. [2024-11-13 14:57:26,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 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 14:57:26,244 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 444 transitions. [2024-11-13 14:57:26,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-13 14:57:26,248 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:57:26,248 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:57:26,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 14:57:26,249 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:57:26,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:57:26,249 INFO L85 PathProgramCache]: Analyzing trace with hash -276363986, now seen corresponding path program 1 times [2024-11-13 14:57:26,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:57:26,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186067759] [2024-11-13 14:57:26,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:57:26,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:57:26,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:57:26,569 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:57:26,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:57:26,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186067759] [2024-11-13 14:57:26,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186067759] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:57:26,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:57:26,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:57:26,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396318233] [2024-11-13 14:57:26,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:57:26,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:57:26,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:57:26,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:57:26,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:57:26,575 INFO L87 Difference]: Start difference. First operand 310 states and 444 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 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 14:57:27,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:57:27,301 INFO L93 Difference]: Finished difference Result 911 states and 1313 transitions. [2024-11-13 14:57:27,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:57:27,302 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 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) Word has length 148 [2024-11-13 14:57:27,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:57:27,308 INFO L225 Difference]: With dead ends: 911 [2024-11-13 14:57:27,308 INFO L226 Difference]: Without dead ends: 603 [2024-11-13 14:57:27,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 14:57:27,313 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 156 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-13 14:57:27,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 98 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-13 14:57:27,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2024-11-13 14:57:27,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 598. [2024-11-13 14:57:27,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 597 states have (on average 1.3953098827470687) internal successors, (833), 597 states have internal predecessors, (833), 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 14:57:27,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 833 transitions. [2024-11-13 14:57:27,379 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 833 transitions. Word has length 148 [2024-11-13 14:57:27,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:57:27,379 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 833 transitions. [2024-11-13 14:57:27,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 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 14:57:27,380 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 833 transitions. [2024-11-13 14:57:27,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-13 14:57:27,385 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:57:27,386 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:57:27,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 14:57:27,389 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:57:27,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:57:27,390 INFO L85 PathProgramCache]: Analyzing trace with hash 550026762, now seen corresponding path program 1 times [2024-11-13 14:57:27,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:57:27,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684822449] [2024-11-13 14:57:27,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:57:27,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:57:27,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:57:27,749 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:57:27,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:57:27,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684822449] [2024-11-13 14:57:27,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684822449] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:57:27,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:57:27,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:57:27,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622097443] [2024-11-13 14:57:27,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:57:27,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:57:27,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:57:27,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:57:27,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:57:27,752 INFO L87 Difference]: Start difference. First operand 598 states and 833 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 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 14:57:28,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:57:28,463 INFO L93 Difference]: Finished difference Result 1755 states and 2451 transitions. [2024-11-13 14:57:28,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:57:28,464 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 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) Word has length 158 [2024-11-13 14:57:28,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:57:28,469 INFO L225 Difference]: With dead ends: 1755 [2024-11-13 14:57:28,469 INFO L226 Difference]: Without dead ends: 1159 [2024-11-13 14:57:28,470 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 14:57:28,471 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 144 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-13 14:57:28,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 89 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-13 14:57:28,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2024-11-13 14:57:28,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1159. [2024-11-13 14:57:28,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1159 states, 1158 states have (on average 1.3411053540587219) internal successors, (1553), 1158 states have internal predecessors, (1553), 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 14:57:28,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1159 states to 1159 states and 1553 transitions. [2024-11-13 14:57:28,526 INFO L78 Accepts]: Start accepts. Automaton has 1159 states and 1553 transitions. Word has length 158 [2024-11-13 14:57:28,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:57:28,526 INFO L471 AbstractCegarLoop]: Abstraction has 1159 states and 1553 transitions. [2024-11-13 14:57:28,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 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 14:57:28,527 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 1553 transitions. [2024-11-13 14:57:28,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-13 14:57:28,530 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:57:28,531 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:57:28,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 14:57:28,531 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:57:28,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:57:28,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1176558838, now seen corresponding path program 1 times [2024-11-13 14:57:28,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:57:28,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221146433] [2024-11-13 14:57:28,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:57:28,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:57:28,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:57:28,815 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 14:57:28,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:57:28,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221146433] [2024-11-13 14:57:28,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221146433] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:57:28,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:57:28,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:57:28,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682211398] [2024-11-13 14:57:28,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:57:28,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:57:28,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:57:28,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:57:28,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:57:28,817 INFO L87 Difference]: Start difference. First operand 1159 states and 1553 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 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 14:57:29,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:57:29,512 INFO L93 Difference]: Finished difference Result 2877 states and 3826 transitions. [2024-11-13 14:57:29,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:57:29,514 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 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) Word has length 166 [2024-11-13 14:57:29,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:57:29,522 INFO L225 Difference]: With dead ends: 2877 [2024-11-13 14:57:29,522 INFO L226 Difference]: Without dead ends: 1720 [2024-11-13 14:57:29,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 14:57:29,526 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 139 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 14:57:29,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 231 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 14:57:29,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1720 states. [2024-11-13 14:57:29,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1720 to 1719. [2024-11-13 14:57:29,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1719 states, 1718 states have (on average 1.229918509895227) internal successors, (2113), 1718 states have internal predecessors, (2113), 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 14:57:29,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1719 states to 1719 states and 2113 transitions. [2024-11-13 14:57:29,582 INFO L78 Accepts]: Start accepts. Automaton has 1719 states and 2113 transitions. Word has length 166 [2024-11-13 14:57:29,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:57:29,582 INFO L471 AbstractCegarLoop]: Abstraction has 1719 states and 2113 transitions. [2024-11-13 14:57:29,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 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 14:57:29,583 INFO L276 IsEmpty]: Start isEmpty. Operand 1719 states and 2113 transitions. [2024-11-13 14:57:29,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-13 14:57:29,593 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:57:29,594 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:57:29,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 14:57:29,594 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:57:29,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:57:29,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1980988047, now seen corresponding path program 1 times [2024-11-13 14:57:29,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:57:29,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592521045] [2024-11-13 14:57:29,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:57:29,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:57:29,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:57:29,833 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-13 14:57:29,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:57:29,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592521045] [2024-11-13 14:57:29,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592521045] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:57:29,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:57:29,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:57:29,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8928145] [2024-11-13 14:57:29,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:57:29,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:57:29,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:57:29,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:57:29,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:57:29,835 INFO L87 Difference]: Start difference. First operand 1719 states and 2113 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 2 states have internal predecessors, (137), 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 14:57:30,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:57:30,561 INFO L93 Difference]: Finished difference Result 5132 states and 6312 transitions. [2024-11-13 14:57:30,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:57:30,562 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 2 states have internal predecessors, (137), 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) Word has length 168 [2024-11-13 14:57:30,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:57:30,577 INFO L225 Difference]: With dead ends: 5132 [2024-11-13 14:57:30,578 INFO L226 Difference]: Without dead ends: 3415 [2024-11-13 14:57:30,580 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 14:57:30,583 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 197 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-13 14:57:30,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 111 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-13 14:57:30,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3415 states. [2024-11-13 14:57:30,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3415 to 3415. [2024-11-13 14:57:30,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3415 states, 3414 states have (on average 1.2000585823081429) internal successors, (4097), 3414 states have internal predecessors, (4097), 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 14:57:30,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3415 states to 3415 states and 4097 transitions. [2024-11-13 14:57:30,684 INFO L78 Accepts]: Start accepts. Automaton has 3415 states and 4097 transitions. Word has length 168 [2024-11-13 14:57:30,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:57:30,685 INFO L471 AbstractCegarLoop]: Abstraction has 3415 states and 4097 transitions. [2024-11-13 14:57:30,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 2 states have internal predecessors, (137), 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 14:57:30,685 INFO L276 IsEmpty]: Start isEmpty. Operand 3415 states and 4097 transitions. [2024-11-13 14:57:30,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-13 14:57:30,692 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:57:30,692 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:57:30,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 14:57:30,692 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:57:30,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:57:30,693 INFO L85 PathProgramCache]: Analyzing trace with hash 67722652, now seen corresponding path program 1 times [2024-11-13 14:57:30,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:57:30,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080609086] [2024-11-13 14:57:30,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:57:30,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:57:30,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:57:30,884 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-13 14:57:30,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:57:30,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080609086] [2024-11-13 14:57:30,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080609086] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:57:30,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:57:30,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:57:30,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936690198] [2024-11-13 14:57:30,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:57:30,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:57:30,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:57:30,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:57:30,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:57:30,887 INFO L87 Difference]: Start difference. First operand 3415 states and 4097 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 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 14:57:31,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:57:31,277 INFO L93 Difference]: Finished difference Result 6533 states and 7829 transitions. [2024-11-13 14:57:31,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:57:31,278 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 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) Word has length 172 [2024-11-13 14:57:31,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:57:31,290 INFO L225 Difference]: With dead ends: 6533 [2024-11-13 14:57:31,290 INFO L226 Difference]: Without dead ends: 3120 [2024-11-13 14:57:31,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 14:57:31,294 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 205 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 14:57:31,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 22 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 14:57:31,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3120 states. [2024-11-13 14:57:31,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3120 to 3120. [2024-11-13 14:57:31,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3120 states, 3119 states have (on average 1.169926258416159) internal successors, (3649), 3119 states have internal predecessors, (3649), 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 14:57:31,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3120 states to 3120 states and 3649 transitions. [2024-11-13 14:57:31,372 INFO L78 Accepts]: Start accepts. Automaton has 3120 states and 3649 transitions. Word has length 172 [2024-11-13 14:57:31,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:57:31,372 INFO L471 AbstractCegarLoop]: Abstraction has 3120 states and 3649 transitions. [2024-11-13 14:57:31,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 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 14:57:31,372 INFO L276 IsEmpty]: Start isEmpty. Operand 3120 states and 3649 transitions. [2024-11-13 14:57:31,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-11-13 14:57:31,383 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:57:31,383 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:57:31,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 14:57:31,384 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:57:31,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:57:31,384 INFO L85 PathProgramCache]: Analyzing trace with hash 2053989213, now seen corresponding path program 1 times [2024-11-13 14:57:31,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:57:31,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017844292] [2024-11-13 14:57:31,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:57:31,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:57:31,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:57:31,957 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-13 14:57:31,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:57:31,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017844292] [2024-11-13 14:57:31,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017844292] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:57:31,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:57:31,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:57:31,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221960850] [2024-11-13 14:57:31,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:57:31,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 14:57:31,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:57:31,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 14:57:31,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:57:31,960 INFO L87 Difference]: Start difference. First operand 3120 states and 3649 transitions. Second operand has 5 states, 5 states have (on average 32.8) internal successors, (164), 4 states have internal predecessors, (164), 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 14:57:33,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:57:33,118 INFO L93 Difference]: Finished difference Result 7078 states and 8281 transitions. [2024-11-13 14:57:33,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:57:33,119 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.8) internal successors, (164), 4 states have internal predecessors, (164), 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) Word has length 195 [2024-11-13 14:57:33,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:57:33,134 INFO L225 Difference]: With dead ends: 7078 [2024-11-13 14:57:33,134 INFO L226 Difference]: Without dead ends: 4100 [2024-11-13 14:57:33,137 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-13 14:57:33,139 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 343 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 930 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:57:33,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 104 Invalid, 995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 930 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-13 14:57:33,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4100 states. [2024-11-13 14:57:33,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4100 to 3400. [2024-11-13 14:57:33,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3400 states, 3399 states have (on average 1.1588702559576345) internal successors, (3939), 3399 states have internal predecessors, (3939), 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 14:57:33,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3400 states to 3400 states and 3939 transitions. [2024-11-13 14:57:33,225 INFO L78 Accepts]: Start accepts. Automaton has 3400 states and 3939 transitions. Word has length 195 [2024-11-13 14:57:33,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:57:33,225 INFO L471 AbstractCegarLoop]: Abstraction has 3400 states and 3939 transitions. [2024-11-13 14:57:33,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.8) internal successors, (164), 4 states have internal predecessors, (164), 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 14:57:33,226 INFO L276 IsEmpty]: Start isEmpty. Operand 3400 states and 3939 transitions. [2024-11-13 14:57:33,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-13 14:57:33,234 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:57:33,234 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:57:33,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 14:57:33,235 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:57:33,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:57:33,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1194137763, now seen corresponding path program 1 times [2024-11-13 14:57:33,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:57:33,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723250040] [2024-11-13 14:57:33,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:57:33,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:57:33,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:57:33,450 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-13 14:57:33,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:57:33,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723250040] [2024-11-13 14:57:33,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723250040] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:57:33,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:57:33,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:57:33,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090998973] [2024-11-13 14:57:33,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:57:33,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:57:33,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:57:33,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:57:33,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:57:33,453 INFO L87 Difference]: Start difference. First operand 3400 states and 3939 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 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 14:57:33,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:57:33,978 INFO L93 Difference]: Finished difference Result 6648 states and 7709 transitions. [2024-11-13 14:57:33,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:57:33,979 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 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) Word has length 198 [2024-11-13 14:57:33,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:57:33,990 INFO L225 Difference]: With dead ends: 6648 [2024-11-13 14:57:33,991 INFO L226 Difference]: Without dead ends: 3390 [2024-11-13 14:57:33,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 14:57:33,995 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 141 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 14:57:33,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 29 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 14:57:34,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3390 states. [2024-11-13 14:57:34,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3390 to 3390. [2024-11-13 14:57:34,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3390 states, 3389 states have (on average 1.142519917379758) internal successors, (3872), 3389 states have internal predecessors, (3872), 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 14:57:34,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3390 states to 3390 states and 3872 transitions. [2024-11-13 14:57:34,076 INFO L78 Accepts]: Start accepts. Automaton has 3390 states and 3872 transitions. Word has length 198 [2024-11-13 14:57:34,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:57:34,076 INFO L471 AbstractCegarLoop]: Abstraction has 3390 states and 3872 transitions. [2024-11-13 14:57:34,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 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 14:57:34,076 INFO L276 IsEmpty]: Start isEmpty. Operand 3390 states and 3872 transitions. [2024-11-13 14:57:34,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-13 14:57:34,084 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:57:34,084 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:57:34,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 14:57:34,085 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:57:34,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:57:34,085 INFO L85 PathProgramCache]: Analyzing trace with hash -616793705, now seen corresponding path program 1 times [2024-11-13 14:57:34,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:57:34,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415476977] [2024-11-13 14:57:34,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:57:34,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:57:34,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:57:34,303 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-13 14:57:34,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:57:34,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415476977] [2024-11-13 14:57:34,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415476977] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:57:34,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:57:34,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:57:34,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965184941] [2024-11-13 14:57:34,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:57:34,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:57:34,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:57:34,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:57:34,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:57:34,306 INFO L87 Difference]: Start difference. First operand 3390 states and 3872 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 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 14:57:34,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:57:34,830 INFO L93 Difference]: Finished difference Result 7337 states and 8381 transitions. [2024-11-13 14:57:34,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:57:34,831 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 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) Word has length 224 [2024-11-13 14:57:34,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:57:34,842 INFO L225 Difference]: With dead ends: 7337 [2024-11-13 14:57:34,843 INFO L226 Difference]: Without dead ends: 3244 [2024-11-13 14:57:34,846 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 14:57:34,847 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 130 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 14:57:34,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 233 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 14:57:34,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3244 states. [2024-11-13 14:57:34,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3244 to 3244. [2024-11-13 14:57:34,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3244 states, 3243 states have (on average 1.1233425840271354) internal successors, (3643), 3243 states have internal predecessors, (3643), 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 14:57:34,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3244 states to 3244 states and 3643 transitions. [2024-11-13 14:57:34,953 INFO L78 Accepts]: Start accepts. Automaton has 3244 states and 3643 transitions. Word has length 224 [2024-11-13 14:57:34,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:57:34,953 INFO L471 AbstractCegarLoop]: Abstraction has 3244 states and 3643 transitions. [2024-11-13 14:57:34,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 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 14:57:34,954 INFO L276 IsEmpty]: Start isEmpty. Operand 3244 states and 3643 transitions. [2024-11-13 14:57:34,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-13 14:57:34,963 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:57:34,963 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:57:34,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 14:57:34,964 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:57:34,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:57:34,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1599656867, now seen corresponding path program 1 times [2024-11-13 14:57:34,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:57:34,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018196641] [2024-11-13 14:57:34,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:57:34,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:57:35,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:57:35,168 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-13 14:57:35,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:57:35,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018196641] [2024-11-13 14:57:35,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018196641] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:57:35,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:57:35,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:57:35,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555585270] [2024-11-13 14:57:35,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:57:35,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:57:35,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:57:35,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:57:35,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:57:35,171 INFO L87 Difference]: Start difference. First operand 3244 states and 3643 transitions. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 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 14:57:35,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:57:35,613 INFO L93 Difference]: Finished difference Result 5786 states and 6475 transitions. [2024-11-13 14:57:35,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:57:35,613 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 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) Word has length 239 [2024-11-13 14:57:35,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:57:35,620 INFO L225 Difference]: With dead ends: 5786 [2024-11-13 14:57:35,621 INFO L226 Difference]: Without dead ends: 2684 [2024-11-13 14:57:35,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 14:57:35,624 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 88 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-13 14:57:35,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 219 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-13 14:57:35,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2684 states. [2024-11-13 14:57:35,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2684 to 2681. [2024-11-13 14:57:35,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2681 states, 2680 states have (on average 1.091044776119403) internal successors, (2924), 2680 states have internal predecessors, (2924), 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 14:57:35,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2681 states to 2681 states and 2924 transitions. [2024-11-13 14:57:35,694 INFO L78 Accepts]: Start accepts. Automaton has 2681 states and 2924 transitions. Word has length 239 [2024-11-13 14:57:35,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:57:35,694 INFO L471 AbstractCegarLoop]: Abstraction has 2681 states and 2924 transitions. [2024-11-13 14:57:35,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 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 14:57:35,695 INFO L276 IsEmpty]: Start isEmpty. Operand 2681 states and 2924 transitions. [2024-11-13 14:57:35,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2024-11-13 14:57:35,700 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:57:35,701 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:57:35,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 14:57:35,701 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:57:35,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:57:35,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1373042248, now seen corresponding path program 1 times [2024-11-13 14:57:35,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:57:35,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536885518] [2024-11-13 14:57:35,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:57:35,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:57:35,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:57:35,861 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-11-13 14:57:35,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:57:35,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536885518] [2024-11-13 14:57:35,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536885518] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:57:35,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:57:35,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 14:57:35,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444033496] [2024-11-13 14:57:35,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:57:35,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 14:57:35,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:57:35,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 14:57:35,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 14:57:35,864 INFO L87 Difference]: Start difference. First operand 2681 states and 2924 transitions. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 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 14:57:36,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:57:36,381 INFO L93 Difference]: Finished difference Result 3383 states and 3683 transitions. [2024-11-13 14:57:36,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 14:57:36,382 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 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) Word has length 249 [2024-11-13 14:57:36,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:57:36,383 INFO L225 Difference]: With dead ends: 3383 [2024-11-13 14:57:36,383 INFO L226 Difference]: Without dead ends: 0 [2024-11-13 14:57:36,386 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 14:57:36,387 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 102 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-13 14:57:36,387 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 213 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-13 14:57:36,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-13 14:57:36,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-13 14:57:36,388 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 14:57:36,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-13 14:57:36,388 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 249 [2024-11-13 14:57:36,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:57:36,388 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-13 14:57:36,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 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 14:57:36,388 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-13 14:57:36,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-13 14:57:36,391 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 14:57:36,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 14:57:36,395 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:57:36,397 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-13 14:57:36,786 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 14:57:36,813 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 02:57:36 BoogieIcfgContainer [2024-11-13 14:57:36,815 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 14:57:36,816 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 14:57:36,816 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 14:57:36,816 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 14:57:36,817 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:57:24" (3/4) ... [2024-11-13 14:57:36,819 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-13 14:57:36,835 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-13 14:57:36,836 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-13 14:57:36,837 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-13 14:57:36,837 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-13 14:57:36,977 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b99dfd16-1005-400d-ab9c-1b2bcca5fc01/bin/uautomizer-verify-qhAvR1uOyd/witness.graphml [2024-11-13 14:57:36,977 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b99dfd16-1005-400d-ab9c-1b2bcca5fc01/bin/uautomizer-verify-qhAvR1uOyd/witness.yml [2024-11-13 14:57:36,977 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 14:57:36,979 INFO L158 Benchmark]: Toolchain (without parser) took 15512.80ms. Allocated memory was 117.4MB in the beginning and 226.5MB in the end (delta: 109.1MB). Free memory was 92.0MB in the beginning and 159.5MB in the end (delta: -67.5MB). Peak memory consumption was 37.1MB. Max. memory is 16.1GB. [2024-11-13 14:57:36,979 INFO L158 Benchmark]: CDTParser took 1.22ms. Allocated memory is still 167.8MB. Free memory is still 104.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:57:36,979 INFO L158 Benchmark]: CACSL2BoogieTranslator took 644.49ms. Allocated memory is still 117.4MB. Free memory was 92.0MB in the beginning and 66.3MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 14:57:36,979 INFO L158 Benchmark]: Boogie Procedure Inliner took 114.53ms. Allocated memory is still 117.4MB. Free memory was 66.3MB in the beginning and 61.0MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 14:57:36,980 INFO L158 Benchmark]: Boogie Preprocessor took 88.97ms. Allocated memory is still 117.4MB. Free memory was 61.0MB in the beginning and 56.5MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:57:36,980 INFO L158 Benchmark]: RCFGBuilder took 1682.25ms. Allocated memory is still 117.4MB. Free memory was 56.5MB in the beginning and 77.4MB in the end (delta: -20.9MB). Peak memory consumption was 40.0MB. Max. memory is 16.1GB. [2024-11-13 14:57:36,980 INFO L158 Benchmark]: TraceAbstraction took 12811.83ms. Allocated memory was 117.4MB in the beginning and 226.5MB in the end (delta: 109.1MB). Free memory was 77.4MB in the beginning and 169.0MB in the end (delta: -91.6MB). Peak memory consumption was 113.9MB. Max. memory is 16.1GB. [2024-11-13 14:57:36,980 INFO L158 Benchmark]: Witness Printer took 161.34ms. Allocated memory is still 226.5MB. Free memory was 169.0MB in the beginning and 159.5MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 14:57:36,984 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.22ms. Allocated memory is still 167.8MB. Free memory is still 104.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 644.49ms. Allocated memory is still 117.4MB. Free memory was 92.0MB in the beginning and 66.3MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 114.53ms. Allocated memory is still 117.4MB. Free memory was 66.3MB in the beginning and 61.0MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 88.97ms. Allocated memory is still 117.4MB. Free memory was 61.0MB in the beginning and 56.5MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1682.25ms. Allocated memory is still 117.4MB. Free memory was 56.5MB in the beginning and 77.4MB in the end (delta: -20.9MB). Peak memory consumption was 40.0MB. Max. memory is 16.1GB. * TraceAbstraction took 12811.83ms. Allocated memory was 117.4MB in the beginning and 226.5MB in the end (delta: 109.1MB). Free memory was 77.4MB in the beginning and 169.0MB in the end (delta: -91.6MB). Peak memory consumption was 113.9MB. Max. memory is 16.1GB. * Witness Printer took 161.34ms. Allocated memory is still 226.5MB. Free memory was 169.0MB in the beginning and 159.5MB in the end (delta: 9.6MB). 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: 572]: 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 1 procedures, 227 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.3s, OverallIterations: 11, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 7.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1749 SdHoareTripleChecker+Valid, 6.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1749 mSDsluCounter, 1466 SdHoareTripleChecker+Invalid, 5.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 184 mSDsCounter, 641 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4335 IncrementalHoareTripleChecker+Invalid, 4976 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 641 mSolverCounterUnsat, 1282 mSDtfsCounter, 4335 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3415occurred in iteration=5, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 11 MinimizatonAttempts, 709 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 2047 NumberOfCodeBlocks, 2047 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 2036 ConstructedInterpolants, 0 QuantifiedInterpolants, 3227 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 1013/1013 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: 616]: Loop Invariant Derived loop invariant: (((((((((((((9 <= a28) && (a17 <= 7)) && (a28 <= 10)) && (a25 <= 0)) || ((((((a17 == 8) && (a25 == 1)) && (a28 == 11)) && (a21 == 1)) && (a11 <= 0)) && (a19 == 1))) || (((((a25 == 1) && (a11 == 1)) && (a17 <= 8)) && (a28 <= 10)) && (a19 == 1))) || (((((a25 == 1) && (a28 <= 9)) && (a17 <= 8)) && (a11 <= 0)) && (a19 == 1))) || ((a17 <= 7) && (a28 == 9))) || ((((a28 <= 9) && (a11 == 1)) && (a17 <= 8)) && (a25 <= 0))) || (((((9 <= a28) && (a25 == 1)) && (a17 <= 8)) && (a11 <= 0)) && (a28 <= 10))) || (((a28 <= 9) && (a17 <= 7)) && (a19 == 1))) || ((((a28 <= 9) && (a17 <= 8)) && (a11 <= 0)) && (a25 <= 0))) || ((((((a17 == 8) && (a21 == 1)) && (a11 <= 0)) && (a28 <= 10)) && (a19 == 1)) && (a25 <= 0))) RESULT: Ultimate proved your program to be correct! [2024-11-13 14:57:37,019 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b99dfd16-1005-400d-ab9c-1b2bcca5fc01/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE