./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/toy.cil.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_cc971c60-86e9-42e1-836b-99d9cb585eda/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc971c60-86e9-42e1-836b-99d9cb585eda/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_cc971c60-86e9-42e1-836b-99d9cb585eda/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc971c60-86e9-42e1-836b-99d9cb585eda/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/toy.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc971c60-86e9-42e1-836b-99d9cb585eda/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_cc971c60-86e9-42e1-836b-99d9cb585eda/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 4a8eabec1830ab654b41f6937ec2f9359cd3dd371ede66eafc352bac48edda3b --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 15:03:32,444 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 15:03:32,527 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc971c60-86e9-42e1-836b-99d9cb585eda/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 15:03:32,535 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 15:03:32,537 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 15:03:32,559 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 15:03:32,560 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 15:03:32,560 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 15:03:32,560 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 15:03:32,560 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 15:03:32,560 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 15:03:32,560 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 15:03:32,561 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 15:03:32,561 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 15:03:32,561 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 15:03:32,561 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 15:03:32,561 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 15:03:32,561 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 15:03:32,561 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 15:03:32,561 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 15:03:32,562 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 15:03:32,562 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 15:03:32,562 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 15:03:32,562 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 15:03:32,562 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 15:03:32,562 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 15:03:32,562 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 15:03:32,562 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 15:03:32,562 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 15:03:32,562 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 15:03:32,563 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 15:03:32,563 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 15:03:32,563 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:03:32,563 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 15:03:32,563 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 15:03:32,563 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 15:03:32,563 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 15:03:32,563 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 15:03:32,563 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 15:03:32,564 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 15:03:32,564 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 15:03:32,564 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 15:03:32,564 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_cc971c60-86e9-42e1-836b-99d9cb585eda/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 -> 4a8eabec1830ab654b41f6937ec2f9359cd3dd371ede66eafc352bac48edda3b [2024-11-13 15:03:32,850 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 15:03:32,866 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 15:03:32,869 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 15:03:32,871 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 15:03:32,871 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 15:03:32,873 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc971c60-86e9-42e1-836b-99d9cb585eda/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/systemc/toy.cil.c Unable to find full path for "g++" [2024-11-13 15:03:34,822 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 15:03:35,135 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 15:03:35,140 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc971c60-86e9-42e1-836b-99d9cb585eda/sv-benchmarks/c/systemc/toy.cil.c [2024-11-13 15:03:35,150 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc971c60-86e9-42e1-836b-99d9cb585eda/bin/uautomizer-verify-qhAvR1uOyd/data/8a032a62b/24b78c42f45d451a8bca908cf88586d0/FLAGf9cf9091f [2024-11-13 15:03:35,397 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc971c60-86e9-42e1-836b-99d9cb585eda/bin/uautomizer-verify-qhAvR1uOyd/data/8a032a62b/24b78c42f45d451a8bca908cf88586d0 [2024-11-13 15:03:35,399 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 15:03:35,401 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 15:03:35,402 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 15:03:35,402 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 15:03:35,406 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 15:03:35,407 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:03:35" (1/1) ... [2024-11-13 15:03:35,408 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@444c6d0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:03:35, skipping insertion in model container [2024-11-13 15:03:35,408 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 03:03:35" (1/1) ... [2024-11-13 15:03:35,440 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 15:03:35,605 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_cc971c60-86e9-42e1-836b-99d9cb585eda/sv-benchmarks/c/systemc/toy.cil.c[697,710] [2024-11-13 15:03:35,676 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:03:35,686 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 15:03:35,696 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_cc971c60-86e9-42e1-836b-99d9cb585eda/sv-benchmarks/c/systemc/toy.cil.c[697,710] [2024-11-13 15:03:35,772 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 15:03:35,792 INFO L204 MainTranslator]: Completed translation [2024-11-13 15:03:35,792 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:03:35 WrapperNode [2024-11-13 15:03:35,794 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 15:03:35,796 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 15:03:35,796 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 15:03:35,796 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 15:03:35,803 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:03:35" (1/1) ... [2024-11-13 15:03:35,813 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:03:35" (1/1) ... [2024-11-13 15:03:35,839 INFO L138 Inliner]: procedures = 20, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 360 [2024-11-13 15:03:35,839 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 15:03:35,840 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 15:03:35,840 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 15:03:35,840 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 15:03:35,848 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:03:35" (1/1) ... [2024-11-13 15:03:35,849 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:03:35" (1/1) ... [2024-11-13 15:03:35,855 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:03:35" (1/1) ... [2024-11-13 15:03:35,879 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-13 15:03:35,880 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:03:35" (1/1) ... [2024-11-13 15:03:35,880 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:03:35" (1/1) ... [2024-11-13 15:03:35,889 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:03:35" (1/1) ... [2024-11-13 15:03:35,896 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:03:35" (1/1) ... [2024-11-13 15:03:35,898 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:03:35" (1/1) ... [2024-11-13 15:03:35,899 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:03:35" (1/1) ... [2024-11-13 15:03:35,901 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 15:03:35,902 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 15:03:35,902 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 15:03:35,902 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 15:03:35,903 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:03:35" (1/1) ... [2024-11-13 15:03:35,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 15:03:35,935 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc971c60-86e9-42e1-836b-99d9cb585eda/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:03:35,950 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc971c60-86e9-42e1-836b-99d9cb585eda/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 15:03:35,958 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc971c60-86e9-42e1-836b-99d9cb585eda/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 15:03:35,984 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 15:03:35,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 15:03:35,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 15:03:35,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 15:03:36,097 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 15:03:36,100 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 15:03:36,809 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-11-13 15:03:36,809 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 15:03:36,828 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 15:03:36,829 INFO L316 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-13 15:03:36,829 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:03:36 BoogieIcfgContainer [2024-11-13 15:03:36,829 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 15:03:36,836 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 15:03:36,836 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 15:03:36,843 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 15:03:36,843 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 03:03:35" (1/3) ... [2024-11-13 15:03:36,843 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67cb73a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:03:36, skipping insertion in model container [2024-11-13 15:03:36,844 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 03:03:35" (2/3) ... [2024-11-13 15:03:36,844 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67cb73a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 03:03:36, skipping insertion in model container [2024-11-13 15:03:36,844 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:03:36" (3/3) ... [2024-11-13 15:03:36,845 INFO L112 eAbstractionObserver]: Analyzing ICFG toy.cil.c [2024-11-13 15:03:36,859 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 15:03:36,861 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG toy.cil.c that has 1 procedures, 132 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2024-11-13 15:03:36,920 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 15:03:36,936 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;@b345dad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 15:03:36,937 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 15:03:36,944 INFO L276 IsEmpty]: Start isEmpty. Operand has 132 states, 130 states have (on average 1.8384615384615384) internal successors, (239), 131 states have internal predecessors, (239), 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 15:03:36,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 15:03:36,953 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:03:36,954 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] [2024-11-13 15:03:36,954 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:03:36,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:03:36,959 INFO L85 PathProgramCache]: Analyzing trace with hash -539797716, now seen corresponding path program 1 times [2024-11-13 15:03:36,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:03:36,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248386142] [2024-11-13 15:03:36,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:03:36,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:03:37,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:03:37,275 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 15:03:37,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:03:37,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248386142] [2024-11-13 15:03:37,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248386142] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:03:37,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:03:37,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:03:37,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855845978] [2024-11-13 15:03:37,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:03:37,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:03:37,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:03:37,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:03:37,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:03:37,305 INFO L87 Difference]: Start difference. First operand has 132 states, 130 states have (on average 1.8384615384615384) internal successors, (239), 131 states have internal predecessors, (239), 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 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 15:03:37,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:03:37,346 INFO L93 Difference]: Finished difference Result 255 states and 464 transitions. [2024-11-13 15:03:37,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:03:37,350 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 36 [2024-11-13 15:03:37,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:03:37,361 INFO L225 Difference]: With dead ends: 255 [2024-11-13 15:03:37,361 INFO L226 Difference]: Without dead ends: 127 [2024-11-13 15:03:37,368 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 15:03:37,371 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 219 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:03:37,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 223 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:03:37,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-13 15:03:37,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2024-11-13 15:03:37,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 1.746031746031746) internal successors, (220), 126 states have internal predecessors, (220), 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 15:03:37,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 220 transitions. [2024-11-13 15:03:37,418 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 220 transitions. Word has length 36 [2024-11-13 15:03:37,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:03:37,420 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 220 transitions. [2024-11-13 15:03:37,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 15:03:37,420 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 220 transitions. [2024-11-13 15:03:37,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 15:03:37,425 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:03:37,425 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] [2024-11-13 15:03:37,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 15:03:37,426 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:03:37,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:03:37,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1241397590, now seen corresponding path program 1 times [2024-11-13 15:03:37,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:03:37,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482850942] [2024-11-13 15:03:37,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:03:37,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:03:37,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:03:37,639 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 15:03:37,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:03:37,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482850942] [2024-11-13 15:03:37,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482850942] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:03:37,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:03:37,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:03:37,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407448442] [2024-11-13 15:03:37,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:03:37,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:03:37,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:03:37,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:03:37,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:03:37,642 INFO L87 Difference]: Start difference. First operand 127 states and 220 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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 15:03:37,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:03:37,721 INFO L93 Difference]: Finished difference Result 343 states and 592 transitions. [2024-11-13 15:03:37,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:03:37,722 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2024-11-13 15:03:37,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:03:37,724 INFO L225 Difference]: With dead ends: 343 [2024-11-13 15:03:37,724 INFO L226 Difference]: Without dead ends: 219 [2024-11-13 15:03:37,725 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:03:37,725 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 574 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 574 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:03:37,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [574 Valid, 370 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:03:37,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-11-13 15:03:37,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 216. [2024-11-13 15:03:37,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 215 states have (on average 1.7255813953488373) internal successors, (371), 215 states have internal predecessors, (371), 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 15:03:37,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 371 transitions. [2024-11-13 15:03:37,747 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 371 transitions. Word has length 36 [2024-11-13 15:03:37,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:03:37,748 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 371 transitions. [2024-11-13 15:03:37,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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 15:03:37,748 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 371 transitions. [2024-11-13 15:03:37,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 15:03:37,750 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:03:37,751 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] [2024-11-13 15:03:37,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 15:03:37,751 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:03:37,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:03:37,753 INFO L85 PathProgramCache]: Analyzing trace with hash 144805804, now seen corresponding path program 1 times [2024-11-13 15:03:37,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:03:37,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367087915] [2024-11-13 15:03:37,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:03:37,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:03:37,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:03:37,918 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 15:03:37,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:03:37,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367087915] [2024-11-13 15:03:37,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367087915] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:03:37,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:03:37,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:03:37,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194400207] [2024-11-13 15:03:37,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:03:37,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:03:37,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:03:37,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:03:37,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:03:37,921 INFO L87 Difference]: Start difference. First operand 216 states and 371 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 15:03:37,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:03:37,991 INFO L93 Difference]: Finished difference Result 423 states and 729 transitions. [2024-11-13 15:03:37,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:03:37,992 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 36 [2024-11-13 15:03:37,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:03:37,994 INFO L225 Difference]: With dead ends: 423 [2024-11-13 15:03:37,994 INFO L226 Difference]: Without dead ends: 216 [2024-11-13 15:03:37,994 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 15:03:38,022 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 189 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:03:38,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 203 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:03:38,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-11-13 15:03:38,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2024-11-13 15:03:38,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 215 states have (on average 1.669767441860465) internal successors, (359), 215 states have internal predecessors, (359), 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 15:03:38,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 359 transitions. [2024-11-13 15:03:38,058 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 359 transitions. Word has length 36 [2024-11-13 15:03:38,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:03:38,058 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 359 transitions. [2024-11-13 15:03:38,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 15:03:38,059 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 359 transitions. [2024-11-13 15:03:38,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 15:03:38,060 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:03:38,060 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] [2024-11-13 15:03:38,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 15:03:38,060 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:03:38,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:03:38,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1385735640, now seen corresponding path program 1 times [2024-11-13 15:03:38,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:03:38,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970907338] [2024-11-13 15:03:38,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:03:38,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:03:38,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:03:38,183 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 15:03:38,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:03:38,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970907338] [2024-11-13 15:03:38,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970907338] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:03:38,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:03:38,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:03:38,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714463770] [2024-11-13 15:03:38,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:03:38,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:03:38,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:03:38,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:03:38,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:03:38,188 INFO L87 Difference]: Start difference. First operand 216 states and 359 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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 15:03:38,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:03:38,379 INFO L93 Difference]: Finished difference Result 589 states and 980 transitions. [2024-11-13 15:03:38,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:03:38,380 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2024-11-13 15:03:38,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:03:38,382 INFO L225 Difference]: With dead ends: 589 [2024-11-13 15:03:38,383 INFO L226 Difference]: Without dead ends: 383 [2024-11-13 15:03:38,384 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:03:38,388 INFO L432 NwaCegarLoop]: 320 mSDtfsCounter, 369 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:03:38,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 458 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:03:38,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2024-11-13 15:03:38,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 216. [2024-11-13 15:03:38,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 215 states have (on average 1.655813953488372) internal successors, (356), 215 states have internal predecessors, (356), 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 15:03:38,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 356 transitions. [2024-11-13 15:03:38,429 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 356 transitions. Word has length 36 [2024-11-13 15:03:38,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:03:38,429 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 356 transitions. [2024-11-13 15:03:38,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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 15:03:38,430 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 356 transitions. [2024-11-13 15:03:38,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 15:03:38,431 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:03:38,431 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] [2024-11-13 15:03:38,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 15:03:38,431 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:03:38,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:03:38,435 INFO L85 PathProgramCache]: Analyzing trace with hash 537492394, now seen corresponding path program 1 times [2024-11-13 15:03:38,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:03:38,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530566120] [2024-11-13 15:03:38,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:03:38,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:03:38,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:03:38,520 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 15:03:38,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:03:38,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530566120] [2024-11-13 15:03:38,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530566120] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:03:38,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:03:38,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:03:38,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916704850] [2024-11-13 15:03:38,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:03:38,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:03:38,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:03:38,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:03:38,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:03:38,521 INFO L87 Difference]: Start difference. First operand 216 states and 356 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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 15:03:38,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:03:38,653 INFO L93 Difference]: Finished difference Result 590 states and 974 transitions. [2024-11-13 15:03:38,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:03:38,654 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2024-11-13 15:03:38,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:03:38,657 INFO L225 Difference]: With dead ends: 590 [2024-11-13 15:03:38,657 INFO L226 Difference]: Without dead ends: 385 [2024-11-13 15:03:38,659 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:03:38,660 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 367 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:03:38,660 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 465 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:03:38,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2024-11-13 15:03:38,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 216. [2024-11-13 15:03:38,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 215 states have (on average 1.6418604651162791) internal successors, (353), 215 states have internal predecessors, (353), 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 15:03:38,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 353 transitions. [2024-11-13 15:03:38,696 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 353 transitions. Word has length 36 [2024-11-13 15:03:38,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:03:38,697 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 353 transitions. [2024-11-13 15:03:38,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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 15:03:38,697 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 353 transitions. [2024-11-13 15:03:38,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 15:03:38,698 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:03:38,701 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] [2024-11-13 15:03:38,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 15:03:38,702 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:03:38,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:03:38,702 INFO L85 PathProgramCache]: Analyzing trace with hash 599532008, now seen corresponding path program 1 times [2024-11-13 15:03:38,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:03:38,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440952018] [2024-11-13 15:03:38,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:03:38,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:03:38,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:03:38,814 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 15:03:38,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:03:38,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440952018] [2024-11-13 15:03:38,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440952018] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:03:38,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:03:38,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:03:38,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37536342] [2024-11-13 15:03:38,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:03:38,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:03:38,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:03:38,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:03:38,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:03:38,816 INFO L87 Difference]: Start difference. First operand 216 states and 353 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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 15:03:38,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:03:38,941 INFO L93 Difference]: Finished difference Result 604 states and 987 transitions. [2024-11-13 15:03:38,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:03:38,942 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2024-11-13 15:03:38,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:03:38,946 INFO L225 Difference]: With dead ends: 604 [2024-11-13 15:03:38,949 INFO L226 Difference]: Without dead ends: 400 [2024-11-13 15:03:38,950 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:03:38,951 INFO L432 NwaCegarLoop]: 328 mSDtfsCounter, 373 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:03:38,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 475 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:03:38,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2024-11-13 15:03:38,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 222. [2024-11-13 15:03:38,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 221 states have (on average 1.6153846153846154) internal successors, (357), 221 states have internal predecessors, (357), 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 15:03:38,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 357 transitions. [2024-11-13 15:03:38,976 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 357 transitions. Word has length 36 [2024-11-13 15:03:38,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:03:38,976 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 357 transitions. [2024-11-13 15:03:38,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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 15:03:38,979 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 357 transitions. [2024-11-13 15:03:38,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 15:03:38,980 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:03:38,980 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] [2024-11-13 15:03:38,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 15:03:38,981 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:03:38,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:03:38,981 INFO L85 PathProgramCache]: Analyzing trace with hash 740080618, now seen corresponding path program 1 times [2024-11-13 15:03:38,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:03:38,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840867333] [2024-11-13 15:03:38,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:03:38,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:03:39,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:03:39,083 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 15:03:39,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:03:39,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840867333] [2024-11-13 15:03:39,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840867333] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:03:39,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:03:39,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:03:39,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308364884] [2024-11-13 15:03:39,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:03:39,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:03:39,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:03:39,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:03:39,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:03:39,085 INFO L87 Difference]: Start difference. First operand 222 states and 357 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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 15:03:39,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:03:39,237 INFO L93 Difference]: Finished difference Result 759 states and 1219 transitions. [2024-11-13 15:03:39,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:03:39,238 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2024-11-13 15:03:39,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:03:39,241 INFO L225 Difference]: With dead ends: 759 [2024-11-13 15:03:39,241 INFO L226 Difference]: Without dead ends: 550 [2024-11-13 15:03:39,242 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:03:39,242 INFO L432 NwaCegarLoop]: 320 mSDtfsCounter, 369 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:03:39,243 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 569 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:03:39,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2024-11-13 15:03:39,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 365. [2024-11-13 15:03:39,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 364 states have (on average 1.598901098901099) internal successors, (582), 364 states have internal predecessors, (582), 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 15:03:39,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 582 transitions. [2024-11-13 15:03:39,295 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 582 transitions. Word has length 36 [2024-11-13 15:03:39,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:03:39,296 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 582 transitions. [2024-11-13 15:03:39,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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 15:03:39,296 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 582 transitions. [2024-11-13 15:03:39,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 15:03:39,300 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:03:39,300 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] [2024-11-13 15:03:39,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 15:03:39,301 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:03:39,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:03:39,301 INFO L85 PathProgramCache]: Analyzing trace with hash 606067112, now seen corresponding path program 1 times [2024-11-13 15:03:39,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:03:39,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029970728] [2024-11-13 15:03:39,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:03:39,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:03:39,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:03:39,402 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 15:03:39,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:03:39,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029970728] [2024-11-13 15:03:39,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029970728] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:03:39,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:03:39,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:03:39,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220151659] [2024-11-13 15:03:39,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:03:39,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:03:39,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:03:39,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:03:39,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:03:39,406 INFO L87 Difference]: Start difference. First operand 365 states and 582 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 15:03:39,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:03:39,486 INFO L93 Difference]: Finished difference Result 872 states and 1395 transitions. [2024-11-13 15:03:39,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:03:39,486 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 36 [2024-11-13 15:03:39,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:03:39,489 INFO L225 Difference]: With dead ends: 872 [2024-11-13 15:03:39,489 INFO L226 Difference]: Without dead ends: 531 [2024-11-13 15:03:39,491 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 15:03:39,492 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 177 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:03:39,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 343 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:03:39,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2024-11-13 15:03:39,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 529. [2024-11-13 15:03:39,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 528 states have (on average 1.5946969696969697) internal successors, (842), 528 states have internal predecessors, (842), 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 15:03:39,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 842 transitions. [2024-11-13 15:03:39,555 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 842 transitions. Word has length 36 [2024-11-13 15:03:39,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:03:39,555 INFO L471 AbstractCegarLoop]: Abstraction has 529 states and 842 transitions. [2024-11-13 15:03:39,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 15:03:39,557 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 842 transitions. [2024-11-13 15:03:39,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 15:03:39,558 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:03:39,558 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] [2024-11-13 15:03:39,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 15:03:39,559 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:03:39,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:03:39,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1895772452, now seen corresponding path program 1 times [2024-11-13 15:03:39,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:03:39,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712643141] [2024-11-13 15:03:39,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:03:39,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:03:39,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:03:39,647 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 15:03:39,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:03:39,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712643141] [2024-11-13 15:03:39,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712643141] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:03:39,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:03:39,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:03:39,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846120233] [2024-11-13 15:03:39,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:03:39,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:03:39,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:03:39,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:03:39,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:03:39,649 INFO L87 Difference]: Start difference. First operand 529 states and 842 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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 15:03:39,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:03:39,799 INFO L93 Difference]: Finished difference Result 1347 states and 2145 transitions. [2024-11-13 15:03:39,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:03:39,800 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2024-11-13 15:03:39,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:03:39,805 INFO L225 Difference]: With dead ends: 1347 [2024-11-13 15:03:39,805 INFO L226 Difference]: Without dead ends: 835 [2024-11-13 15:03:39,806 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:03:39,809 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 483 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:03:39,809 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 331 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:03:39,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2024-11-13 15:03:39,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 529. [2024-11-13 15:03:39,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 528 states have (on average 1.5795454545454546) internal successors, (834), 528 states have internal predecessors, (834), 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 15:03:39,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 834 transitions. [2024-11-13 15:03:39,869 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 834 transitions. Word has length 36 [2024-11-13 15:03:39,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:03:39,869 INFO L471 AbstractCegarLoop]: Abstraction has 529 states and 834 transitions. [2024-11-13 15:03:39,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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 15:03:39,869 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 834 transitions. [2024-11-13 15:03:39,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 15:03:39,870 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:03:39,870 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] [2024-11-13 15:03:39,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 15:03:39,870 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:03:39,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:03:39,872 INFO L85 PathProgramCache]: Analyzing trace with hash 307424550, now seen corresponding path program 1 times [2024-11-13 15:03:39,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:03:39,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163894586] [2024-11-13 15:03:39,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:03:39,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:03:39,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:03:39,963 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 15:03:39,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:03:39,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163894586] [2024-11-13 15:03:39,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163894586] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:03:39,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:03:39,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:03:39,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96867850] [2024-11-13 15:03:39,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:03:39,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:03:39,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:03:39,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:03:39,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:03:39,965 INFO L87 Difference]: Start difference. First operand 529 states and 834 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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 15:03:40,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:03:40,120 INFO L93 Difference]: Finished difference Result 1347 states and 2122 transitions. [2024-11-13 15:03:40,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:03:40,121 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2024-11-13 15:03:40,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:03:40,125 INFO L225 Difference]: With dead ends: 1347 [2024-11-13 15:03:40,125 INFO L226 Difference]: Without dead ends: 841 [2024-11-13 15:03:40,126 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:03:40,127 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 467 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:03:40,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 320 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:03:40,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2024-11-13 15:03:40,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 529. [2024-11-13 15:03:40,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 528 states have (on average 1.5643939393939394) internal successors, (826), 528 states have internal predecessors, (826), 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 15:03:40,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 826 transitions. [2024-11-13 15:03:40,190 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 826 transitions. Word has length 36 [2024-11-13 15:03:40,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:03:40,190 INFO L471 AbstractCegarLoop]: Abstraction has 529 states and 826 transitions. [2024-11-13 15:03:40,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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 15:03:40,191 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 826 transitions. [2024-11-13 15:03:40,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 15:03:40,192 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:03:40,192 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] [2024-11-13 15:03:40,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 15:03:40,193 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:03:40,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:03:40,193 INFO L85 PathProgramCache]: Analyzing trace with hash -972439128, now seen corresponding path program 1 times [2024-11-13 15:03:40,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:03:40,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370933685] [2024-11-13 15:03:40,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:03:40,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:03:40,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:03:40,263 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 15:03:40,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:03:40,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370933685] [2024-11-13 15:03:40,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370933685] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:03:40,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:03:40,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:03:40,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131826537] [2024-11-13 15:03:40,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:03:40,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:03:40,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:03:40,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:03:40,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:03:40,265 INFO L87 Difference]: Start difference. First operand 529 states and 826 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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 15:03:40,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:03:40,416 INFO L93 Difference]: Finished difference Result 1276 states and 1990 transitions. [2024-11-13 15:03:40,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 15:03:40,417 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2024-11-13 15:03:40,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:03:40,421 INFO L225 Difference]: With dead ends: 1276 [2024-11-13 15:03:40,421 INFO L226 Difference]: Without dead ends: 764 [2024-11-13 15:03:40,422 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:03:40,423 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 479 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:03:40,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 350 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:03:40,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2024-11-13 15:03:40,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 577. [2024-11-13 15:03:40,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 576 states have (on average 1.5329861111111112) internal successors, (883), 576 states have internal predecessors, (883), 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 15:03:40,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 883 transitions. [2024-11-13 15:03:40,469 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 883 transitions. Word has length 36 [2024-11-13 15:03:40,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:03:40,470 INFO L471 AbstractCegarLoop]: Abstraction has 577 states and 883 transitions. [2024-11-13 15:03:40,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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 15:03:40,470 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 883 transitions. [2024-11-13 15:03:40,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-13 15:03:40,470 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:03:40,470 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] [2024-11-13 15:03:40,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 15:03:40,471 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:03:40,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:03:40,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1559245142, now seen corresponding path program 1 times [2024-11-13 15:03:40,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:03:40,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480513766] [2024-11-13 15:03:40,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:03:40,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:03:40,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:03:40,518 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 15:03:40,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:03:40,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480513766] [2024-11-13 15:03:40,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480513766] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:03:40,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:03:40,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:03:40,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691686982] [2024-11-13 15:03:40,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:03:40,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:03:40,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:03:40,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:03:40,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:03:40,520 INFO L87 Difference]: Start difference. First operand 577 states and 883 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 15:03:40,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:03:40,610 INFO L93 Difference]: Finished difference Result 1372 states and 2104 transitions. [2024-11-13 15:03:40,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:03:40,611 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 36 [2024-11-13 15:03:40,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:03:40,616 INFO L225 Difference]: With dead ends: 1372 [2024-11-13 15:03:40,616 INFO L226 Difference]: Without dead ends: 809 [2024-11-13 15:03:40,617 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 15:03:40,618 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 118 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:03:40,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 312 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:03:40,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2024-11-13 15:03:40,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 806. [2024-11-13 15:03:40,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 805 states have (on average 1.5142857142857142) internal successors, (1219), 805 states have internal predecessors, (1219), 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 15:03:40,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1219 transitions. [2024-11-13 15:03:40,677 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1219 transitions. Word has length 36 [2024-11-13 15:03:40,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:03:40,677 INFO L471 AbstractCegarLoop]: Abstraction has 806 states and 1219 transitions. [2024-11-13 15:03:40,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 15:03:40,677 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1219 transitions. [2024-11-13 15:03:40,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-13 15:03:40,678 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:03:40,678 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-13 15:03:40,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-13 15:03:40,678 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:03:40,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:03:40,678 INFO L85 PathProgramCache]: Analyzing trace with hash -497346069, now seen corresponding path program 1 times [2024-11-13 15:03:40,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:03:40,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758617103] [2024-11-13 15:03:40,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:03:40,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:03:40,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:03:40,727 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:03:40,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:03:40,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758617103] [2024-11-13 15:03:40,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758617103] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:03:40,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:03:40,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:03:40,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630377870] [2024-11-13 15:03:40,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:03:40,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:03:40,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:03:40,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:03:40,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:03:40,729 INFO L87 Difference]: Start difference. First operand 806 states and 1219 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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 15:03:40,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:03:40,837 INFO L93 Difference]: Finished difference Result 1999 states and 3056 transitions. [2024-11-13 15:03:40,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:03:40,838 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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 47 [2024-11-13 15:03:40,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:03:40,843 INFO L225 Difference]: With dead ends: 1999 [2024-11-13 15:03:40,843 INFO L226 Difference]: Without dead ends: 1220 [2024-11-13 15:03:40,845 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 15:03:40,846 INFO L432 NwaCegarLoop]: 247 mSDtfsCounter, 81 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:03:40,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 414 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:03:40,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2024-11-13 15:03:40,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 1218. [2024-11-13 15:03:40,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1218 states, 1217 states have (on average 1.5209531635168447) internal successors, (1851), 1217 states have internal predecessors, (1851), 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 15:03:40,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1851 transitions. [2024-11-13 15:03:40,939 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1851 transitions. Word has length 47 [2024-11-13 15:03:40,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:03:40,939 INFO L471 AbstractCegarLoop]: Abstraction has 1218 states and 1851 transitions. [2024-11-13 15:03:40,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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 15:03:40,939 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1851 transitions. [2024-11-13 15:03:40,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-13 15:03:40,940 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:03:40,941 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-13 15:03:40,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-13 15:03:40,941 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:03:40,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:03:40,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1394739347, now seen corresponding path program 1 times [2024-11-13 15:03:40,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:03:40,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583242647] [2024-11-13 15:03:40,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:03:40,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:03:40,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:03:40,997 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-13 15:03:40,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:03:40,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583242647] [2024-11-13 15:03:40,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583242647] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:03:40,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:03:40,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:03:40,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122514455] [2024-11-13 15:03:40,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:03:40,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:03:40,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:03:40,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:03:40,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:03:40,999 INFO L87 Difference]: Start difference. First operand 1218 states and 1851 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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 15:03:41,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:03:41,104 INFO L93 Difference]: Finished difference Result 2387 states and 3643 transitions. [2024-11-13 15:03:41,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:03:41,104 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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 47 [2024-11-13 15:03:41,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:03:41,109 INFO L225 Difference]: With dead ends: 2387 [2024-11-13 15:03:41,109 INFO L226 Difference]: Without dead ends: 1196 [2024-11-13 15:03:41,110 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 15:03:41,112 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 179 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:03:41,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 182 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:03:41,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2024-11-13 15:03:41,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 1196. [2024-11-13 15:03:41,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1196 states, 1195 states have (on average 1.5263598326359833) internal successors, (1824), 1195 states have internal predecessors, (1824), 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 15:03:41,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1196 states to 1196 states and 1824 transitions. [2024-11-13 15:03:41,197 INFO L78 Accepts]: Start accepts. Automaton has 1196 states and 1824 transitions. Word has length 47 [2024-11-13 15:03:41,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:03:41,197 INFO L471 AbstractCegarLoop]: Abstraction has 1196 states and 1824 transitions. [2024-11-13 15:03:41,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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 15:03:41,197 INFO L276 IsEmpty]: Start isEmpty. Operand 1196 states and 1824 transitions. [2024-11-13 15:03:41,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-13 15:03:41,198 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:03:41,198 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-13 15:03:41,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-13 15:03:41,198 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:03:41,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:03:41,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1725049013, now seen corresponding path program 1 times [2024-11-13 15:03:41,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:03:41,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758071182] [2024-11-13 15:03:41,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:03:41,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:03:41,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:03:41,243 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:03:41,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:03:41,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758071182] [2024-11-13 15:03:41,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758071182] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:03:41,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:03:41,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:03:41,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678623759] [2024-11-13 15:03:41,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:03:41,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:03:41,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:03:41,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:03:41,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:03:41,245 INFO L87 Difference]: Start difference. First operand 1196 states and 1824 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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 15:03:41,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:03:41,382 INFO L93 Difference]: Finished difference Result 3056 states and 4711 transitions. [2024-11-13 15:03:41,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:03:41,382 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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 48 [2024-11-13 15:03:41,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:03:41,390 INFO L225 Difference]: With dead ends: 3056 [2024-11-13 15:03:41,390 INFO L226 Difference]: Without dead ends: 1887 [2024-11-13 15:03:41,392 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 15:03:41,393 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 82 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:03:41,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 322 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:03:41,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1887 states. [2024-11-13 15:03:41,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1887 to 1885. [2024-11-13 15:03:41,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1885 states, 1884 states have (on average 1.5345010615711252) internal successors, (2891), 1884 states have internal predecessors, (2891), 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 15:03:41,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1885 states to 1885 states and 2891 transitions. [2024-11-13 15:03:41,521 INFO L78 Accepts]: Start accepts. Automaton has 1885 states and 2891 transitions. Word has length 48 [2024-11-13 15:03:41,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:03:41,521 INFO L471 AbstractCegarLoop]: Abstraction has 1885 states and 2891 transitions. [2024-11-13 15:03:41,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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 15:03:41,522 INFO L276 IsEmpty]: Start isEmpty. Operand 1885 states and 2891 transitions. [2024-11-13 15:03:41,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-13 15:03:41,524 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:03:41,524 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-13 15:03:41,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-13 15:03:41,524 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:03:41,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:03:41,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1197001418, now seen corresponding path program 1 times [2024-11-13 15:03:41,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:03:41,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682800464] [2024-11-13 15:03:41,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:03:41,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:03:41,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:03:41,570 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:03:41,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:03:41,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682800464] [2024-11-13 15:03:41,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682800464] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:03:41,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:03:41,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:03:41,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796664742] [2024-11-13 15:03:41,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:03:41,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:03:41,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:03:41,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:03:41,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:03:41,574 INFO L87 Difference]: Start difference. First operand 1885 states and 2891 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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 15:03:41,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:03:41,813 INFO L93 Difference]: Finished difference Result 5076 states and 7877 transitions. [2024-11-13 15:03:41,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:03:41,813 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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 49 [2024-11-13 15:03:41,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:03:41,828 INFO L225 Difference]: With dead ends: 5076 [2024-11-13 15:03:41,828 INFO L226 Difference]: Without dead ends: 3220 [2024-11-13 15:03:41,830 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 15:03:41,831 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 86 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:03:41,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 385 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:03:41,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3220 states. [2024-11-13 15:03:42,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3220 to 3218. [2024-11-13 15:03:42,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3218 states, 3217 states have (on average 1.5461610195834627) internal successors, (4974), 3217 states have internal predecessors, (4974), 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 15:03:42,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3218 states to 3218 states and 4974 transitions. [2024-11-13 15:03:42,067 INFO L78 Accepts]: Start accepts. Automaton has 3218 states and 4974 transitions. Word has length 49 [2024-11-13 15:03:42,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:03:42,067 INFO L471 AbstractCegarLoop]: Abstraction has 3218 states and 4974 transitions. [2024-11-13 15:03:42,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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 15:03:42,068 INFO L276 IsEmpty]: Start isEmpty. Operand 3218 states and 4974 transitions. [2024-11-13 15:03:42,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-13 15:03:42,069 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:03:42,069 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-13 15:03:42,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-13 15:03:42,070 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:03:42,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:03:42,071 INFO L85 PathProgramCache]: Analyzing trace with hash -2094394696, now seen corresponding path program 1 times [2024-11-13 15:03:42,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:03:42,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481892963] [2024-11-13 15:03:42,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:03:42,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:03:42,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:03:42,111 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-13 15:03:42,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:03:42,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481892963] [2024-11-13 15:03:42,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481892963] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:03:42,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:03:42,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:03:42,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305344591] [2024-11-13 15:03:42,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:03:42,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:03:42,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:03:42,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:03:42,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:03:42,113 INFO L87 Difference]: Start difference. First operand 3218 states and 4974 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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 15:03:42,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:03:42,357 INFO L93 Difference]: Finished difference Result 6385 states and 9889 transitions. [2024-11-13 15:03:42,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:03:42,357 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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 49 [2024-11-13 15:03:42,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:03:42,370 INFO L225 Difference]: With dead ends: 6385 [2024-11-13 15:03:42,370 INFO L226 Difference]: Without dead ends: 3196 [2024-11-13 15:03:42,373 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 15:03:42,374 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 176 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:03:42,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 181 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:03:42,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3196 states. [2024-11-13 15:03:42,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3196 to 3196. [2024-11-13 15:03:42,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3196 states, 3195 states have (on average 1.5486697965571206) internal successors, (4948), 3195 states have internal predecessors, (4948), 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 15:03:42,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3196 states to 3196 states and 4948 transitions. [2024-11-13 15:03:42,581 INFO L78 Accepts]: Start accepts. Automaton has 3196 states and 4948 transitions. Word has length 49 [2024-11-13 15:03:42,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:03:42,581 INFO L471 AbstractCegarLoop]: Abstraction has 3196 states and 4948 transitions. [2024-11-13 15:03:42,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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 15:03:42,581 INFO L276 IsEmpty]: Start isEmpty. Operand 3196 states and 4948 transitions. [2024-11-13 15:03:42,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-13 15:03:42,583 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:03:42,583 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-13 15:03:42,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-13 15:03:42,583 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:03:42,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:03:42,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1178300416, now seen corresponding path program 1 times [2024-11-13 15:03:42,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:03:42,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518363844] [2024-11-13 15:03:42,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:03:42,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:03:42,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:03:42,657 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:03:42,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:03:42,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518363844] [2024-11-13 15:03:42,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518363844] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:03:42,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:03:42,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:03:42,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69102238] [2024-11-13 15:03:42,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:03:42,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:03:42,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:03:42,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:03:42,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:03:42,659 INFO L87 Difference]: Start difference. First operand 3196 states and 4948 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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 15:03:43,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:03:43,055 INFO L93 Difference]: Finished difference Result 8133 states and 12621 transitions. [2024-11-13 15:03:43,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:03:43,055 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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 50 [2024-11-13 15:03:43,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:03:43,072 INFO L225 Difference]: With dead ends: 8133 [2024-11-13 15:03:43,073 INFO L226 Difference]: Without dead ends: 4173 [2024-11-13 15:03:43,078 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:03:43,078 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 400 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:03:43,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 306 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:03:43,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4173 states. [2024-11-13 15:03:43,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4173 to 4173. [2024-11-13 15:03:43,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4173 states, 4172 states have (on average 1.537392138063279) internal successors, (6414), 4172 states have internal predecessors, (6414), 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 15:03:43,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4173 states to 4173 states and 6414 transitions. [2024-11-13 15:03:43,341 INFO L78 Accepts]: Start accepts. Automaton has 4173 states and 6414 transitions. Word has length 50 [2024-11-13 15:03:43,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:03:43,341 INFO L471 AbstractCegarLoop]: Abstraction has 4173 states and 6414 transitions. [2024-11-13 15:03:43,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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 15:03:43,342 INFO L276 IsEmpty]: Start isEmpty. Operand 4173 states and 6414 transitions. [2024-11-13 15:03:43,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-13 15:03:43,344 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:03:43,344 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-13 15:03:43,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-13 15:03:43,345 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:03:43,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:03:43,345 INFO L85 PathProgramCache]: Analyzing trace with hash -641369523, now seen corresponding path program 1 times [2024-11-13 15:03:43,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:03:43,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849185732] [2024-11-13 15:03:43,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:03:43,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:03:43,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:03:43,460 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:03:43,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:03:43,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849185732] [2024-11-13 15:03:43,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849185732] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:03:43,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:03:43,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 15:03:43,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223759967] [2024-11-13 15:03:43,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:03:43,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 15:03:43,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:03:43,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 15:03:43,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:03:43,462 INFO L87 Difference]: Start difference. First operand 4173 states and 6414 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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 15:03:43,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:03:43,935 INFO L93 Difference]: Finished difference Result 10612 states and 16218 transitions. [2024-11-13 15:03:43,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 15:03:43,936 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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 56 [2024-11-13 15:03:43,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:03:43,964 INFO L225 Difference]: With dead ends: 10612 [2024-11-13 15:03:43,965 INFO L226 Difference]: Without dead ends: 6462 [2024-11-13 15:03:43,969 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-13 15:03:43,970 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 685 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 685 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:03:43,970 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [685 Valid, 513 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:03:43,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6462 states. [2024-11-13 15:03:44,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6462 to 4868. [2024-11-13 15:03:44,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4868 states, 4867 states have (on average 1.5062666940620506) internal successors, (7331), 4867 states have internal predecessors, (7331), 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 15:03:44,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4868 states to 4868 states and 7331 transitions. [2024-11-13 15:03:44,326 INFO L78 Accepts]: Start accepts. Automaton has 4868 states and 7331 transitions. Word has length 56 [2024-11-13 15:03:44,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:03:44,327 INFO L471 AbstractCegarLoop]: Abstraction has 4868 states and 7331 transitions. [2024-11-13 15:03:44,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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 15:03:44,327 INFO L276 IsEmpty]: Start isEmpty. Operand 4868 states and 7331 transitions. [2024-11-13 15:03:44,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-13 15:03:44,330 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:03:44,331 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-11-13 15:03:44,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-13 15:03:44,331 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:03:44,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:03:44,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1708712745, now seen corresponding path program 1 times [2024-11-13 15:03:44,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:03:44,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530560388] [2024-11-13 15:03:44,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:03:44,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:03:44,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:03:44,381 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:03:44,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:03:44,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530560388] [2024-11-13 15:03:44,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530560388] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:03:44,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:03:44,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:03:44,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127746243] [2024-11-13 15:03:44,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:03:44,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:03:44,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:03:44,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:03:44,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:03:44,382 INFO L87 Difference]: Start difference. First operand 4868 states and 7331 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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 15:03:44,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:03:44,713 INFO L93 Difference]: Finished difference Result 10083 states and 15152 transitions. [2024-11-13 15:03:44,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:03:44,713 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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 90 [2024-11-13 15:03:44,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:03:44,729 INFO L225 Difference]: With dead ends: 10083 [2024-11-13 15:03:44,729 INFO L226 Difference]: Without dead ends: 5244 [2024-11-13 15:03:44,735 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 15:03:44,736 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 128 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:03:44,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 311 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:03:44,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5244 states. [2024-11-13 15:03:45,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5244 to 5212. [2024-11-13 15:03:45,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5212 states, 5211 states have (on average 1.459220878909998) internal successors, (7604), 5211 states have internal predecessors, (7604), 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 15:03:45,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5212 states to 5212 states and 7604 transitions. [2024-11-13 15:03:45,224 INFO L78 Accepts]: Start accepts. Automaton has 5212 states and 7604 transitions. Word has length 90 [2024-11-13 15:03:45,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:03:45,224 INFO L471 AbstractCegarLoop]: Abstraction has 5212 states and 7604 transitions. [2024-11-13 15:03:45,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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 15:03:45,225 INFO L276 IsEmpty]: Start isEmpty. Operand 5212 states and 7604 transitions. [2024-11-13 15:03:45,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-13 15:03:45,230 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:03:45,230 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-11-13 15:03:45,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-13 15:03:45,231 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:03:45,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:03:45,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1049097186, now seen corresponding path program 1 times [2024-11-13 15:03:45,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:03:45,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344256487] [2024-11-13 15:03:45,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:03:45,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:03:45,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:03:45,298 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:03:45,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:03:45,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344256487] [2024-11-13 15:03:45,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344256487] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:03:45,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:03:45,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:03:45,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716762862] [2024-11-13 15:03:45,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:03:45,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:03:45,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:03:45,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:03:45,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:03:45,300 INFO L87 Difference]: Start difference. First operand 5212 states and 7604 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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 15:03:45,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:03:45,675 INFO L93 Difference]: Finished difference Result 10937 states and 15918 transitions. [2024-11-13 15:03:45,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:03:45,675 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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 91 [2024-11-13 15:03:45,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:03:45,696 INFO L225 Difference]: With dead ends: 10937 [2024-11-13 15:03:45,696 INFO L226 Difference]: Without dead ends: 5766 [2024-11-13 15:03:45,701 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 15:03:45,702 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 127 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:03:45,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 310 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:03:45,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5766 states. [2024-11-13 15:03:46,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5766 to 5718. [2024-11-13 15:03:46,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5718 states, 5717 states have (on average 1.4131537519678152) internal successors, (8079), 5717 states have internal predecessors, (8079), 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 15:03:46,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5718 states to 5718 states and 8079 transitions. [2024-11-13 15:03:46,056 INFO L78 Accepts]: Start accepts. Automaton has 5718 states and 8079 transitions. Word has length 91 [2024-11-13 15:03:46,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:03:46,057 INFO L471 AbstractCegarLoop]: Abstraction has 5718 states and 8079 transitions. [2024-11-13 15:03:46,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 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 15:03:46,057 INFO L276 IsEmpty]: Start isEmpty. Operand 5718 states and 8079 transitions. [2024-11-13 15:03:46,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-13 15:03:46,062 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:03:46,062 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-11-13 15:03:46,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-13 15:03:46,062 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:03:46,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:03:46,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1428487719, now seen corresponding path program 1 times [2024-11-13 15:03:46,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:03:46,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611756992] [2024-11-13 15:03:46,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:03:46,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:03:46,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:03:46,110 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 15:03:46,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:03:46,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611756992] [2024-11-13 15:03:46,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611756992] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:03:46,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:03:46,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:03:46,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465497028] [2024-11-13 15:03:46,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:03:46,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:03:46,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:03:46,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:03:46,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:03:46,112 INFO L87 Difference]: Start difference. First operand 5718 states and 8079 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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 15:03:46,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:03:46,513 INFO L93 Difference]: Finished difference Result 11756 states and 16622 transitions. [2024-11-13 15:03:46,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:03:46,513 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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 92 [2024-11-13 15:03:46,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:03:46,529 INFO L225 Difference]: With dead ends: 11756 [2024-11-13 15:03:46,529 INFO L226 Difference]: Without dead ends: 6099 [2024-11-13 15:03:46,536 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 15:03:46,538 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 123 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:03:46,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 307 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:03:46,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6099 states. [2024-11-13 15:03:46,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6099 to 5484. [2024-11-13 15:03:46,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5484 states, 5483 states have (on average 1.3549151924129126) internal successors, (7429), 5483 states have internal predecessors, (7429), 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 15:03:46,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5484 states to 5484 states and 7429 transitions. [2024-11-13 15:03:46,938 INFO L78 Accepts]: Start accepts. Automaton has 5484 states and 7429 transitions. Word has length 92 [2024-11-13 15:03:46,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:03:46,938 INFO L471 AbstractCegarLoop]: Abstraction has 5484 states and 7429 transitions. [2024-11-13 15:03:46,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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 15:03:46,939 INFO L276 IsEmpty]: Start isEmpty. Operand 5484 states and 7429 transitions. [2024-11-13 15:03:46,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-13 15:03:46,944 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:03:46,944 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-11-13 15:03:46,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-13 15:03:46,944 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:03:46,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:03:46,945 INFO L85 PathProgramCache]: Analyzing trace with hash -408927004, now seen corresponding path program 1 times [2024-11-13 15:03:46,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:03:46,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505480172] [2024-11-13 15:03:46,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:03:46,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:03:46,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:03:47,053 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 15:03:47,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:03:47,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505480172] [2024-11-13 15:03:47,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505480172] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:03:47,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:03:47,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:03:47,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533806131] [2024-11-13 15:03:47,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:03:47,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:03:47,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:03:47,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:03:47,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:03:47,057 INFO L87 Difference]: Start difference. First operand 5484 states and 7429 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 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 15:03:47,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:03:47,632 INFO L93 Difference]: Finished difference Result 10260 states and 13825 transitions. [2024-11-13 15:03:47,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:03:47,633 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 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 93 [2024-11-13 15:03:47,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:03:47,648 INFO L225 Difference]: With dead ends: 10260 [2024-11-13 15:03:47,649 INFO L226 Difference]: Without dead ends: 5263 [2024-11-13 15:03:47,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:03:47,655 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 440 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:03:47,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 392 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:03:47,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5263 states. [2024-11-13 15:03:48,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5263 to 5149. [2024-11-13 15:03:48,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5149 states, 5148 states have (on average 1.3090520590520591) internal successors, (6739), 5148 states have internal predecessors, (6739), 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 15:03:48,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5149 states to 5149 states and 6739 transitions. [2024-11-13 15:03:48,209 INFO L78 Accepts]: Start accepts. Automaton has 5149 states and 6739 transitions. Word has length 93 [2024-11-13 15:03:48,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:03:48,209 INFO L471 AbstractCegarLoop]: Abstraction has 5149 states and 6739 transitions. [2024-11-13 15:03:48,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 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 15:03:48,210 INFO L276 IsEmpty]: Start isEmpty. Operand 5149 states and 6739 transitions. [2024-11-13 15:03:48,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-13 15:03:48,223 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:03:48,223 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 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] [2024-11-13 15:03:48,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-13 15:03:48,224 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:03:48,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:03:48,225 INFO L85 PathProgramCache]: Analyzing trace with hash -278038243, now seen corresponding path program 1 times [2024-11-13 15:03:48,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:03:48,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017021411] [2024-11-13 15:03:48,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:03:48,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:03:48,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:03:48,309 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 15:03:48,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:03:48,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017021411] [2024-11-13 15:03:48,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017021411] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:03:48,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:03:48,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:03:48,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968588704] [2024-11-13 15:03:48,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:03:48,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:03:48,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:03:48,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:03:48,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:03:48,312 INFO L87 Difference]: Start difference. First operand 5149 states and 6739 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 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 15:03:48,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:03:48,645 INFO L93 Difference]: Finished difference Result 9832 states and 12854 transitions. [2024-11-13 15:03:48,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:03:48,646 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 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 122 [2024-11-13 15:03:48,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:03:48,659 INFO L225 Difference]: With dead ends: 9832 [2024-11-13 15:03:48,659 INFO L226 Difference]: Without dead ends: 5095 [2024-11-13 15:03:48,665 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 15:03:48,665 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 34 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:03:48,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 301 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:03:48,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5095 states. [2024-11-13 15:03:49,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5095 to 5095. [2024-11-13 15:03:49,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5095 states, 5094 states have (on average 1.302120141342756) internal successors, (6633), 5094 states have internal predecessors, (6633), 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 15:03:49,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5095 states to 5095 states and 6633 transitions. [2024-11-13 15:03:49,026 INFO L78 Accepts]: Start accepts. Automaton has 5095 states and 6633 transitions. Word has length 122 [2024-11-13 15:03:49,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:03:49,026 INFO L471 AbstractCegarLoop]: Abstraction has 5095 states and 6633 transitions. [2024-11-13 15:03:49,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 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 15:03:49,026 INFO L276 IsEmpty]: Start isEmpty. Operand 5095 states and 6633 transitions. [2024-11-13 15:03:49,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-13 15:03:49,035 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:03:49,035 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 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] [2024-11-13 15:03:49,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-13 15:03:49,036 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:03:49,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:03:49,036 INFO L85 PathProgramCache]: Analyzing trace with hash -12986158, now seen corresponding path program 1 times [2024-11-13 15:03:49,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:03:49,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384650604] [2024-11-13 15:03:49,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:03:49,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:03:49,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:03:49,176 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 15:03:49,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:03:49,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384650604] [2024-11-13 15:03:49,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384650604] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:03:49,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:03:49,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:03:49,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737223256] [2024-11-13 15:03:49,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:03:49,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:03:49,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:03:49,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:03:49,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:03:49,178 INFO L87 Difference]: Start difference. First operand 5095 states and 6633 transitions. Second operand has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 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 15:03:49,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:03:49,502 INFO L93 Difference]: Finished difference Result 9065 states and 11821 transitions. [2024-11-13 15:03:49,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:03:49,503 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 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 135 [2024-11-13 15:03:49,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:03:49,518 INFO L225 Difference]: With dead ends: 9065 [2024-11-13 15:03:49,518 INFO L226 Difference]: Without dead ends: 5011 [2024-11-13 15:03:49,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:03:49,524 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 306 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:03:49,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 312 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:03:49,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5011 states. [2024-11-13 15:03:49,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5011 to 5009. [2024-11-13 15:03:49,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5009 states, 5008 states have (on average 1.279552715654952) internal successors, (6408), 5008 states have internal predecessors, (6408), 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 15:03:49,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5009 states to 5009 states and 6408 transitions. [2024-11-13 15:03:49,891 INFO L78 Accepts]: Start accepts. Automaton has 5009 states and 6408 transitions. Word has length 135 [2024-11-13 15:03:49,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:03:49,892 INFO L471 AbstractCegarLoop]: Abstraction has 5009 states and 6408 transitions. [2024-11-13 15:03:49,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 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 15:03:49,892 INFO L276 IsEmpty]: Start isEmpty. Operand 5009 states and 6408 transitions. [2024-11-13 15:03:49,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-13 15:03:49,901 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:03:49,901 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 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] [2024-11-13 15:03:49,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-13 15:03:49,902 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:03:49,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:03:49,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1851833332, now seen corresponding path program 1 times [2024-11-13 15:03:49,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:03:49,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131668395] [2024-11-13 15:03:49,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:03:49,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:03:49,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:03:49,974 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-13 15:03:49,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:03:49,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131668395] [2024-11-13 15:03:49,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131668395] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:03:49,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:03:49,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:03:49,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109075532] [2024-11-13 15:03:49,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:03:49,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:03:49,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:03:49,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:03:49,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:03:49,975 INFO L87 Difference]: Start difference. First operand 5009 states and 6408 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 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 15:03:50,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:03:50,275 INFO L93 Difference]: Finished difference Result 9603 states and 12276 transitions. [2024-11-13 15:03:50,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:03:50,276 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 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 141 [2024-11-13 15:03:50,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:03:50,288 INFO L225 Difference]: With dead ends: 9603 [2024-11-13 15:03:50,288 INFO L226 Difference]: Without dead ends: 5008 [2024-11-13 15:03:50,292 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 15:03:50,293 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 24 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:03:50,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 300 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:03:50,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5008 states. [2024-11-13 15:03:50,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5008 to 4968. [2024-11-13 15:03:50,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4968 states, 4967 states have (on average 1.2734044694986915) internal successors, (6325), 4967 states have internal predecessors, (6325), 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 15:03:50,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4968 states to 4968 states and 6325 transitions. [2024-11-13 15:03:50,628 INFO L78 Accepts]: Start accepts. Automaton has 4968 states and 6325 transitions. Word has length 141 [2024-11-13 15:03:50,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:03:50,628 INFO L471 AbstractCegarLoop]: Abstraction has 4968 states and 6325 transitions. [2024-11-13 15:03:50,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 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 15:03:50,628 INFO L276 IsEmpty]: Start isEmpty. Operand 4968 states and 6325 transitions. [2024-11-13 15:03:50,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-13 15:03:50,638 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:03:50,639 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 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] [2024-11-13 15:03:50,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-13 15:03:50,640 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:03:50,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:03:50,641 INFO L85 PathProgramCache]: Analyzing trace with hash -736637918, now seen corresponding path program 1 times [2024-11-13 15:03:50,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:03:50,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337110414] [2024-11-13 15:03:50,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:03:50,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:03:50,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:03:50,700 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-13 15:03:50,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:03:50,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337110414] [2024-11-13 15:03:50,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337110414] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:03:50,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:03:50,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:03:50,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351636192] [2024-11-13 15:03:50,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:03:50,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:03:50,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:03:50,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:03:50,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:03:50,703 INFO L87 Difference]: Start difference. First operand 4968 states and 6325 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 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 15:03:51,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:03:51,000 INFO L93 Difference]: Finished difference Result 9542 states and 12137 transitions. [2024-11-13 15:03:51,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:03:51,001 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 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 141 [2024-11-13 15:03:51,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:03:51,012 INFO L225 Difference]: With dead ends: 9542 [2024-11-13 15:03:51,012 INFO L226 Difference]: Without dead ends: 4978 [2024-11-13 15:03:51,017 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 15:03:51,017 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 22 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:03:51,018 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 299 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:03:51,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4978 states. [2024-11-13 15:03:51,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4978 to 4938. [2024-11-13 15:03:51,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4938 states, 4937 states have (on average 1.2667611910066843) internal successors, (6254), 4937 states have internal predecessors, (6254), 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 15:03:51,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4938 states to 4938 states and 6254 transitions. [2024-11-13 15:03:51,309 INFO L78 Accepts]: Start accepts. Automaton has 4938 states and 6254 transitions. Word has length 141 [2024-11-13 15:03:51,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:03:51,310 INFO L471 AbstractCegarLoop]: Abstraction has 4938 states and 6254 transitions. [2024-11-13 15:03:51,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 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 15:03:51,310 INFO L276 IsEmpty]: Start isEmpty. Operand 4938 states and 6254 transitions. [2024-11-13 15:03:51,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-13 15:03:51,319 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:03:51,319 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 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] [2024-11-13 15:03:51,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-13 15:03:51,319 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:03:51,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:03:51,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1534996603, now seen corresponding path program 1 times [2024-11-13 15:03:51,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:03:51,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784085761] [2024-11-13 15:03:51,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:03:51,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:03:51,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:03:51,481 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-13 15:03:51,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:03:51,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784085761] [2024-11-13 15:03:51,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784085761] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:03:51,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:03:51,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:03:51,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670375474] [2024-11-13 15:03:51,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:03:51,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:03:51,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:03:51,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:03:51,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:03:51,483 INFO L87 Difference]: Start difference. First operand 4938 states and 6254 transitions. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 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 15:03:51,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:03:51,875 INFO L93 Difference]: Finished difference Result 8060 states and 10251 transitions. [2024-11-13 15:03:51,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:03:51,876 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 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 145 [2024-11-13 15:03:51,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:03:51,886 INFO L225 Difference]: With dead ends: 8060 [2024-11-13 15:03:51,886 INFO L226 Difference]: Without dead ends: 3522 [2024-11-13 15:03:51,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:03:51,893 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 278 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:03:51,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 286 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:03:51,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3522 states. [2024-11-13 15:03:52,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3522 to 3520. [2024-11-13 15:03:52,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3520 states, 3519 states have (on average 1.2358624609263995) internal successors, (4349), 3519 states have internal predecessors, (4349), 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 15:03:52,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3520 states to 3520 states and 4349 transitions. [2024-11-13 15:03:52,265 INFO L78 Accepts]: Start accepts. Automaton has 3520 states and 4349 transitions. Word has length 145 [2024-11-13 15:03:52,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:03:52,266 INFO L471 AbstractCegarLoop]: Abstraction has 3520 states and 4349 transitions. [2024-11-13 15:03:52,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 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 15:03:52,267 INFO L276 IsEmpty]: Start isEmpty. Operand 3520 states and 4349 transitions. [2024-11-13 15:03:52,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-13 15:03:52,274 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:03:52,274 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 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] [2024-11-13 15:03:52,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-13 15:03:52,275 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:03:52,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:03:52,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1336709417, now seen corresponding path program 1 times [2024-11-13 15:03:52,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:03:52,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330954216] [2024-11-13 15:03:52,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:03:52,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:03:52,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:03:52,459 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 15:03:52,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:03:52,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330954216] [2024-11-13 15:03:52,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330954216] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:03:52,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:03:52,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:03:52,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158491717] [2024-11-13 15:03:52,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:03:52,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:03:52,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:03:52,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:03:52,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:03:52,462 INFO L87 Difference]: Start difference. First operand 3520 states and 4349 transitions. Second operand has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 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 15:03:52,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:03:52,663 INFO L93 Difference]: Finished difference Result 5695 states and 7039 transitions. [2024-11-13 15:03:52,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:03:52,664 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 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 145 [2024-11-13 15:03:52,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:03:52,671 INFO L225 Difference]: With dead ends: 5695 [2024-11-13 15:03:52,672 INFO L226 Difference]: Without dead ends: 2256 [2024-11-13 15:03:52,674 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:03:52,680 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 282 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:03:52,680 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 284 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:03:52,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2256 states. [2024-11-13 15:03:52,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2256 to 2254. [2024-11-13 15:03:52,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2254 states, 2253 states have (on average 1.2041722148246783) internal successors, (2713), 2253 states have internal predecessors, (2713), 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 15:03:52,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2254 states to 2254 states and 2713 transitions. [2024-11-13 15:03:52,822 INFO L78 Accepts]: Start accepts. Automaton has 2254 states and 2713 transitions. Word has length 145 [2024-11-13 15:03:52,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:03:52,823 INFO L471 AbstractCegarLoop]: Abstraction has 2254 states and 2713 transitions. [2024-11-13 15:03:52,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 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 15:03:52,823 INFO L276 IsEmpty]: Start isEmpty. Operand 2254 states and 2713 transitions. [2024-11-13 15:03:52,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-13 15:03:52,826 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:03:52,828 INFO L215 NwaCegarLoop]: trace histogram [6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:03:52,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-13 15:03:52,828 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:03:52,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:03:52,828 INFO L85 PathProgramCache]: Analyzing trace with hash 164131203, now seen corresponding path program 1 times [2024-11-13 15:03:52,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:03:52,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068137244] [2024-11-13 15:03:52,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:03:52,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:03:52,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:03:52,908 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-13 15:03:52,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:03:52,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068137244] [2024-11-13 15:03:52,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068137244] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:03:52,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:03:52,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:03:52,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935821625] [2024-11-13 15:03:52,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:03:52,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:03:52,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:03:52,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:03:52,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:03:52,914 INFO L87 Difference]: Start difference. First operand 2254 states and 2713 transitions. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 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 15:03:53,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:03:53,062 INFO L93 Difference]: Finished difference Result 4070 states and 4934 transitions. [2024-11-13 15:03:53,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:03:53,062 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 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 184 [2024-11-13 15:03:53,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:03:53,070 INFO L225 Difference]: With dead ends: 4070 [2024-11-13 15:03:53,070 INFO L226 Difference]: Without dead ends: 2192 [2024-11-13 15:03:53,071 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 15:03:53,073 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 3 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:03:53,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 300 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:03:53,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2192 states. [2024-11-13 15:03:53,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2192 to 2114. [2024-11-13 15:03:53,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2114 states, 2113 states have (on average 1.1902508282063418) internal successors, (2515), 2113 states have internal predecessors, (2515), 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 15:03:53,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2114 states to 2114 states and 2515 transitions. [2024-11-13 15:03:53,237 INFO L78 Accepts]: Start accepts. Automaton has 2114 states and 2515 transitions. Word has length 184 [2024-11-13 15:03:53,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:03:53,239 INFO L471 AbstractCegarLoop]: Abstraction has 2114 states and 2515 transitions. [2024-11-13 15:03:53,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 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 15:03:53,239 INFO L276 IsEmpty]: Start isEmpty. Operand 2114 states and 2515 transitions. [2024-11-13 15:03:53,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-13 15:03:53,242 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:03:53,242 INFO L215 NwaCegarLoop]: trace histogram [6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:03:53,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-13 15:03:53,243 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:03:53,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:03:53,243 INFO L85 PathProgramCache]: Analyzing trace with hash -84006103, now seen corresponding path program 1 times [2024-11-13 15:03:53,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:03:53,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869564674] [2024-11-13 15:03:53,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:03:53,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:03:53,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:03:53,309 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-13 15:03:53,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:03:53,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869564674] [2024-11-13 15:03:53,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869564674] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:03:53,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:03:53,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:03:53,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138261568] [2024-11-13 15:03:53,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:03:53,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:03:53,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:03:53,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:03:53,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:03:53,311 INFO L87 Difference]: Start difference. First operand 2114 states and 2515 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 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 15:03:53,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:03:53,495 INFO L93 Difference]: Finished difference Result 4533 states and 5432 transitions. [2024-11-13 15:03:53,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:03:53,495 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 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 191 [2024-11-13 15:03:53,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:03:53,503 INFO L225 Difference]: With dead ends: 4533 [2024-11-13 15:03:53,503 INFO L226 Difference]: Without dead ends: 2789 [2024-11-13 15:03:53,505 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 15:03:53,506 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 143 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:03:53,506 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 298 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:03:53,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2789 states. [2024-11-13 15:03:53,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2789 to 2408. [2024-11-13 15:03:53,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2408 states, 2407 states have (on average 1.1761528874117158) internal successors, (2831), 2407 states have internal predecessors, (2831), 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 15:03:53,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2408 states to 2408 states and 2831 transitions. [2024-11-13 15:03:53,666 INFO L78 Accepts]: Start accepts. Automaton has 2408 states and 2831 transitions. Word has length 191 [2024-11-13 15:03:53,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:03:53,667 INFO L471 AbstractCegarLoop]: Abstraction has 2408 states and 2831 transitions. [2024-11-13 15:03:53,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 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 15:03:53,669 INFO L276 IsEmpty]: Start isEmpty. Operand 2408 states and 2831 transitions. [2024-11-13 15:03:53,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-13 15:03:53,671 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:03:53,672 INFO L215 NwaCegarLoop]: trace histogram [6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 15:03:53,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-13 15:03:53,672 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:03:53,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:03:53,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1478741560, now seen corresponding path program 1 times [2024-11-13 15:03:53,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:03:53,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407035931] [2024-11-13 15:03:53,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:03:53,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:03:53,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:03:54,267 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 15:03:54,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:03:54,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407035931] [2024-11-13 15:03:54,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407035931] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 15:03:54,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150932378] [2024-11-13 15:03:54,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:03:54,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 15:03:54,269 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc971c60-86e9-42e1-836b-99d9cb585eda/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 15:03:54,272 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc971c60-86e9-42e1-836b-99d9cb585eda/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 15:03:54,273 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc971c60-86e9-42e1-836b-99d9cb585eda/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 15:03:54,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:03:54,438 INFO L255 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-13 15:03:54,446 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 15:03:54,899 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 85 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 15:03:54,899 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 15:03:55,705 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 85 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-13 15:03:55,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150932378] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 15:03:55,706 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 15:03:55,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 27 [2024-11-13 15:03:55,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449788025] [2024-11-13 15:03:55,706 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 15:03:55,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-13 15:03:55,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:03:55,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-13 15:03:55,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=623, Unknown=0, NotChecked=0, Total=702 [2024-11-13 15:03:55,708 INFO L87 Difference]: Start difference. First operand 2408 states and 2831 transitions. Second operand has 27 states, 27 states have (on average 17.51851851851852) internal successors, (473), 27 states have internal predecessors, (473), 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 15:03:58,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:03:58,549 INFO L93 Difference]: Finished difference Result 9888 states and 11621 transitions. [2024-11-13 15:03:58,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-11-13 15:03:58,550 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 17.51851851851852) internal successors, (473), 27 states have internal predecessors, (473), 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 194 [2024-11-13 15:03:58,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:03:58,569 INFO L225 Difference]: With dead ends: 9888 [2024-11-13 15:03:58,569 INFO L226 Difference]: Without dead ends: 7837 [2024-11-13 15:03:58,573 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 464 GetRequests, 395 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1030 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=608, Invalid=4362, Unknown=0, NotChecked=0, Total=4970 [2024-11-13 15:03:58,573 INFO L432 NwaCegarLoop]: 543 mSDtfsCounter, 2643 mSDsluCounter, 9793 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2643 SdHoareTripleChecker+Valid, 10336 SdHoareTripleChecker+Invalid, 945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-13 15:03:58,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2643 Valid, 10336 Invalid, 945 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [26 Valid, 919 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-13 15:03:58,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7837 states. [2024-11-13 15:03:58,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7837 to 3429. [2024-11-13 15:03:58,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3429 states, 3428 states have (on average 1.175029171528588) internal successors, (4028), 3428 states have internal predecessors, (4028), 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 15:03:58,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3429 states to 3429 states and 4028 transitions. [2024-11-13 15:03:58,853 INFO L78 Accepts]: Start accepts. Automaton has 3429 states and 4028 transitions. Word has length 194 [2024-11-13 15:03:58,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:03:58,853 INFO L471 AbstractCegarLoop]: Abstraction has 3429 states and 4028 transitions. [2024-11-13 15:03:58,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 17.51851851851852) internal successors, (473), 27 states have internal predecessors, (473), 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 15:03:58,854 INFO L276 IsEmpty]: Start isEmpty. Operand 3429 states and 4028 transitions. [2024-11-13 15:03:58,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-13 15:03:58,858 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:03:58,858 INFO L215 NwaCegarLoop]: trace histogram [9, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2024-11-13 15:03:58,879 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc971c60-86e9-42e1-836b-99d9cb585eda/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 15:03:59,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc971c60-86e9-42e1-836b-99d9cb585eda/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2024-11-13 15:03:59,071 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:03:59,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:03:59,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1320092993, now seen corresponding path program 1 times [2024-11-13 15:03:59,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:03:59,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624707024] [2024-11-13 15:03:59,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:03:59,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:03:59,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:03:59,154 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-11-13 15:03:59,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:03:59,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624707024] [2024-11-13 15:03:59,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624707024] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:03:59,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:03:59,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:03:59,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730770488] [2024-11-13 15:03:59,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:03:59,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:03:59,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:03:59,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:03:59,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:03:59,156 INFO L87 Difference]: Start difference. First operand 3429 states and 4028 transitions. Second operand has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 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 15:03:59,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:03:59,332 INFO L93 Difference]: Finished difference Result 5329 states and 6235 transitions. [2024-11-13 15:03:59,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:03:59,332 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 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 263 [2024-11-13 15:03:59,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:03:59,340 INFO L225 Difference]: With dead ends: 5329 [2024-11-13 15:03:59,340 INFO L226 Difference]: Without dead ends: 2305 [2024-11-13 15:03:59,342 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 15:03:59,343 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 3 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:03:59,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 314 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:03:59,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2305 states. [2024-11-13 15:03:59,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2305 to 2272. [2024-11-13 15:03:59,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2272 states, 2271 states have (on average 1.1501541171290182) internal successors, (2612), 2271 states have internal predecessors, (2612), 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 15:03:59,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2272 states to 2272 states and 2612 transitions. [2024-11-13 15:03:59,554 INFO L78 Accepts]: Start accepts. Automaton has 2272 states and 2612 transitions. Word has length 263 [2024-11-13 15:03:59,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:03:59,554 INFO L471 AbstractCegarLoop]: Abstraction has 2272 states and 2612 transitions. [2024-11-13 15:03:59,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 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 15:03:59,555 INFO L276 IsEmpty]: Start isEmpty. Operand 2272 states and 2612 transitions. [2024-11-13 15:03:59,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2024-11-13 15:03:59,559 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:03:59,559 INFO L215 NwaCegarLoop]: trace histogram [10, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2024-11-13 15:03:59,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-13 15:03:59,559 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:03:59,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:03:59,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1242117585, now seen corresponding path program 1 times [2024-11-13 15:03:59,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:03:59,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579129562] [2024-11-13 15:03:59,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:03:59,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:03:59,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:03:59,751 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 286 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-13 15:03:59,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:03:59,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579129562] [2024-11-13 15:03:59,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579129562] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:03:59,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:03:59,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 15:03:59,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103643918] [2024-11-13 15:03:59,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:03:59,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 15:03:59,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:03:59,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 15:03:59,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 15:03:59,754 INFO L87 Difference]: Start difference. First operand 2272 states and 2612 transitions. Second operand has 4 states, 4 states have (on average 60.75) internal successors, (243), 4 states have internal predecessors, (243), 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 15:04:00,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:04:00,023 INFO L93 Difference]: Finished difference Result 4253 states and 4901 transitions. [2024-11-13 15:04:00,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 15:04:00,024 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 60.75) internal successors, (243), 4 states have internal predecessors, (243), 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 271 [2024-11-13 15:04:00,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:04:00,031 INFO L225 Difference]: With dead ends: 4253 [2024-11-13 15:04:00,031 INFO L226 Difference]: Without dead ends: 2273 [2024-11-13 15:04:00,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 15:04:00,033 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 191 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 15:04:00,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 225 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 15:04:00,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2273 states. [2024-11-13 15:04:00,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2273 to 2272. [2024-11-13 15:04:00,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2272 states, 2271 states have (on average 1.141347424042272) internal successors, (2592), 2271 states have internal predecessors, (2592), 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 15:04:00,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2272 states to 2272 states and 2592 transitions. [2024-11-13 15:04:00,211 INFO L78 Accepts]: Start accepts. Automaton has 2272 states and 2592 transitions. Word has length 271 [2024-11-13 15:04:00,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:04:00,212 INFO L471 AbstractCegarLoop]: Abstraction has 2272 states and 2592 transitions. [2024-11-13 15:04:00,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.75) internal successors, (243), 4 states have internal predecessors, (243), 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 15:04:00,212 INFO L276 IsEmpty]: Start isEmpty. Operand 2272 states and 2592 transitions. [2024-11-13 15:04:00,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2024-11-13 15:04:00,216 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:04:00,217 INFO L215 NwaCegarLoop]: trace histogram [10, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2024-11-13 15:04:00,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-13 15:04:00,217 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:04:00,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:04:00,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1113678328, now seen corresponding path program 1 times [2024-11-13 15:04:00,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:04:00,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832427144] [2024-11-13 15:04:00,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:04:00,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:04:00,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:04:00,304 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 290 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-13 15:04:00,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:04:00,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832427144] [2024-11-13 15:04:00,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832427144] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:04:00,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:04:00,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:04:00,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541115318] [2024-11-13 15:04:00,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:04:00,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:04:00,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:04:00,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:04:00,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:04:00,306 INFO L87 Difference]: Start difference. First operand 2272 states and 2592 transitions. Second operand has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 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 15:04:00,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:04:00,396 INFO L93 Difference]: Finished difference Result 2676 states and 3041 transitions. [2024-11-13 15:04:00,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:04:00,397 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 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 273 [2024-11-13 15:04:00,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:04:00,402 INFO L225 Difference]: With dead ends: 2676 [2024-11-13 15:04:00,402 INFO L226 Difference]: Without dead ends: 809 [2024-11-13 15:04:00,403 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 15:04:00,404 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 28 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:04:00,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 302 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:04:00,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2024-11-13 15:04:00,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 809. [2024-11-13 15:04:00,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 809 states, 808 states have (on average 1.103960396039604) internal successors, (892), 808 states have internal predecessors, (892), 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 15:04:00,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 892 transitions. [2024-11-13 15:04:00,481 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 892 transitions. Word has length 273 [2024-11-13 15:04:00,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:04:00,482 INFO L471 AbstractCegarLoop]: Abstraction has 809 states and 892 transitions. [2024-11-13 15:04:00,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 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 15:04:00,482 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 892 transitions. [2024-11-13 15:04:00,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2024-11-13 15:04:00,486 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 15:04:00,486 INFO L215 NwaCegarLoop]: trace histogram [9, 5, 5, 5, 5, 4, 4, 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, 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, 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] [2024-11-13 15:04:00,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-13 15:04:00,487 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 15:04:00,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 15:04:00,487 INFO L85 PathProgramCache]: Analyzing trace with hash -111141387, now seen corresponding path program 1 times [2024-11-13 15:04:00,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 15:04:00,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700351545] [2024-11-13 15:04:00,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 15:04:00,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 15:04:00,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 15:04:00,571 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2024-11-13 15:04:00,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 15:04:00,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700351545] [2024-11-13 15:04:00,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700351545] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 15:04:00,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 15:04:00,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 15:04:00,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242716379] [2024-11-13 15:04:00,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 15:04:00,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 15:04:00,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 15:04:00,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 15:04:00,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 15:04:00,573 INFO L87 Difference]: Start difference. First operand 809 states and 892 transitions. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 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 15:04:00,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 15:04:00,641 INFO L93 Difference]: Finished difference Result 1090 states and 1202 transitions. [2024-11-13 15:04:00,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 15:04:00,641 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 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 290 [2024-11-13 15:04:00,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 15:04:00,644 INFO L225 Difference]: With dead ends: 1090 [2024-11-13 15:04:00,644 INFO L226 Difference]: Without dead ends: 0 [2024-11-13 15:04:00,645 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 15:04:00,646 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 3 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 15:04:00,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 283 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 15:04:00,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-13 15:04:00,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-13 15:04:00,647 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 15:04:00,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-13 15:04:00,649 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 290 [2024-11-13 15:04:00,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 15:04:00,649 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-13 15:04:00,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 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 15:04:00,650 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-13 15:04:00,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-13 15:04:00,652 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 15:04:00,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-13 15:04:00,656 INFO L407 BasicCegarLoop]: Path program 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] [2024-11-13 15:04:00,658 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-13 15:04:55,171 WARN L286 SmtUtils]: Spent 54.51s on a formula simplification. DAG size of input: 402 DAG size of output: 504 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-11-13 15:05:02,968 WARN L286 SmtUtils]: Spent 7.80s on a formula simplification. DAG size of input: 229 DAG size of output: 289 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-11-13 15:05:20,906 WARN L286 SmtUtils]: Spent 17.94s on a formula simplification. DAG size of input: 290 DAG size of output: 368 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-11-13 15:05:26,680 WARN L286 SmtUtils]: Spent 5.77s on a formula simplification. DAG size of input: 214 DAG size of output: 277 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-11-13 15:05:46,920 WARN L286 SmtUtils]: Spent 20.24s on a formula simplification. DAG size of input: 290 DAG size of output: 368 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-11-13 15:06:32,197 WARN L286 SmtUtils]: Spent 45.28s on a formula simplification. DAG size of input: 198 DAG size of output: 218 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-11-13 15:06:38,194 WARN L286 SmtUtils]: Spent 5.99s on a formula simplification. DAG size of input: 504 DAG size of output: 124 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-11-13 15:06:45,474 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 15:06:45,557 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 03:06:45 BoogieIcfgContainer [2024-11-13 15:06:45,557 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 15:06:45,558 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 15:06:45,558 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 15:06:45,558 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 15:06:45,559 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 03:03:36" (3/4) ... [2024-11-13 15:06:45,561 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-13 15:06:45,587 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2024-11-13 15:06:45,588 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-13 15:06:45,588 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-13 15:06:45,589 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-13 15:06:45,782 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc971c60-86e9-42e1-836b-99d9cb585eda/bin/uautomizer-verify-qhAvR1uOyd/witness.graphml [2024-11-13 15:06:45,783 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc971c60-86e9-42e1-836b-99d9cb585eda/bin/uautomizer-verify-qhAvR1uOyd/witness.yml [2024-11-13 15:06:45,783 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 15:06:45,784 INFO L158 Benchmark]: Toolchain (without parser) took 190383.02ms. Allocated memory was 117.4MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 93.8MB in the beginning and 1.0GB in the end (delta: -919.9MB). Peak memory consumption was 261.7MB. Max. memory is 16.1GB. [2024-11-13 15:06:45,784 INFO L158 Benchmark]: CDTParser took 1.79ms. Allocated memory is still 167.8MB. Free memory is still 103.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 15:06:45,784 INFO L158 Benchmark]: CACSL2BoogieTranslator took 393.03ms. Allocated memory is still 117.4MB. Free memory was 93.5MB in the beginning and 78.8MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 15:06:45,784 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.70ms. Allocated memory is still 117.4MB. Free memory was 78.8MB in the beginning and 76.9MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 15:06:45,784 INFO L158 Benchmark]: Boogie Preprocessor took 61.85ms. Allocated memory is still 117.4MB. Free memory was 76.9MB in the beginning and 74.4MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 15:06:45,784 INFO L158 Benchmark]: RCFGBuilder took 929.66ms. Allocated memory is still 117.4MB. Free memory was 74.4MB in the beginning and 48.7MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 15:06:45,784 INFO L158 Benchmark]: TraceAbstraction took 188721.46ms. Allocated memory was 117.4MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 48.0MB in the beginning and 1.0GB in the end (delta: -986.7MB). Peak memory consumption was 754.6MB. Max. memory is 16.1GB. [2024-11-13 15:06:45,784 INFO L158 Benchmark]: Witness Printer took 224.98ms. Allocated memory is still 1.3GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 21.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 15:06:45,788 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.79ms. Allocated memory is still 167.8MB. Free memory is still 103.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 393.03ms. Allocated memory is still 117.4MB. Free memory was 93.5MB in the beginning and 78.8MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.70ms. Allocated memory is still 117.4MB. Free memory was 78.8MB in the beginning and 76.9MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 61.85ms. Allocated memory is still 117.4MB. Free memory was 76.9MB in the beginning and 74.4MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 929.66ms. Allocated memory is still 117.4MB. Free memory was 74.4MB in the beginning and 48.7MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 188721.46ms. Allocated memory was 117.4MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 48.0MB in the beginning and 1.0GB in the end (delta: -986.7MB). Peak memory consumption was 754.6MB. Max. memory is 16.1GB. * Witness Printer took 224.98ms. Allocated memory is still 1.3GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 21.0MB). Peak memory consumption was 25.2MB. 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: 23]: 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, 132 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.8s, OverallIterations: 36, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 11.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10651 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10651 mSDsluCounter, 21882 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14121 mSDsCounter, 234 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1649 IncrementalHoareTripleChecker+Invalid, 1883 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 234 mSolverCounterUnsat, 7761 mSDtfsCounter, 1649 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 617 GetRequests, 481 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1031 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5718occurred in iteration=21, InterpolantAutomatonStates: 183, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.5s AutomataMinimizationTime, 36 MinimizatonAttempts, 8908 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 3833 NumberOfCodeBlocks, 3833 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 3989 ConstructedInterpolants, 0 QuantifiedInterpolants, 8244 SizeOfPredicates, 5 NumberOfNonLiveVariables, 507 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 38 InterpolantComputations, 35 PerfectInterpolantSequences, 2142/2272 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: 545]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((e_g != 0) && (c1_st != 0)) && (d == 0)) && (c2_st != 0)) && (wb_pc == 1)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (2 != wl_pc)) && (0 != wl_pc)) && (r_i != 1)) && (e_e != 1)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (wb_st != 0)) && (c2_pc == 1)) && (processed == 0)) && (e_wl != 0)) && (c_req_up == r_i)) && (wb_i == 1)) || ((((((((((((((0 != wl_st) && (e_g != 0)) && (e_g != 1)) && (e_e != 0)) && (e_c != 0)) && (r_i != 1)) && (e_e != 1)) && (e_wl != 1)) && (c1_i == 1)) && (c2_i == 1)) && (e_f == 2)) && (e_wl != 0)) && (0 == wl_pc)) && (wb_i == 1))) || (((((((((((((((((((((((((e_g != 0) && (d == 0)) && (c2_st == 0)) && (c2_pc == 0)) && (c1_pc == 0)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (r_i != 1)) && (e_e != 1)) && (wb_pc == 0)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (processed == 0)) && (e_wl != 0)) && (c1_st == 0)) && (0 == wl_pc)) && (wb_st == 0)) && (c_req_up == r_i)) && (wb_i == 1))) || (((((((((((((((((0 != wl_st) && (e_g != 0)) && (wb_pc == 1)) && (e_g != 1)) && (e_e != 0)) && (e_c != 0)) && (2 != wl_pc)) && (r_i != 1)) && (e_e != 1)) && (e_wl != 1)) && (c1_i == 1)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (c2_pc == 1)) && (e_wl != 0)) && (wb_i == 1))) || ((e_f == 2) && ((((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (c1_st != 0)) && (c2_st != 0)) && (wb_pc == 1)) && (e_g != 1)) && (e_e != 0)) && (r_i != 1)) && ((((long long) t_b + 2) == c) || (((long long) t_b + 1) == c))) && (e_e != 1)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (c1_pc == 1)) && (wb_st != 0)) && (c2_pc == 1)) && ((c_t == ((long long) t_b + 1)) || (((long long) t_b + 2) == c_t))) && (e_wl != 0)) && (data == ((long long) t_b + 1))) && (wb_i == 1)) || (((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (c1_st != 0)) && (c2_st != 0)) && (wb_pc == 1)) && (((long long) t_b + 2) == data)) && (e_g != 1)) && (e_e != 0)) && (r_i != 1)) && ((((long long) t_b + 2) == c) || (((long long) t_b + 1) == c))) && (e_e != 1)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (c1_pc == 1)) && (wb_st != 0)) && (c2_pc == 1)) && ((c_t == ((long long) t_b + 1)) || (((long long) t_b + 2) == c_t))) && (e_wl != 0)) && (wb_i == 1))))) - InvariantResult [Line: 152]: Location Invariant Derived location invariant: (((((((((((((((((((((((((((((((((((((e_g != 0) && (c1_st != 0)) && (d == 0)) && (c2_st == 0)) && (c2_pc == 0)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (r_i != 1)) && (e_e != 1)) && (wb_pc == 0)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (processed == 0)) && (e_wl != 0)) && (0 == wl_pc)) && (wb_st == 0)) && (c_req_up == r_i)) && (wb_i == 1)) || (((((((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (c1_st != 0)) && (d == 0)) && (c2_st != 0)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (2 != wl_pc)) && (0 != wl_pc)) && (r_i != 1)) && (e_e != 1)) && (wb_pc == 0)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c2_pc == 1)) && (processed == 0)) && (wb_st == 0)) && (c_req_up == r_i)) && (wb_i == 1))) || (((((((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (c1_st != 0)) && (d == 0)) && (wb_pc == 1)) && (c2_st == 0)) && (c2_pc == 0)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (2 != wl_pc)) && (0 != wl_pc)) && (r_i != 1)) && (e_e != 1)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (wb_st != 0)) && (processed == 0)) && (c_req_up == r_i)) && (wb_i == 1))) || (((((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (c1_st != 0)) && (c2_st != 0)) && (wb_pc == 1)) && (e_g != 1)) && (e_e != 0)) && (r_i != 1)) && (e_e != 1)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (c1_pc == 1)) && (wb_st != 0)) && (r_st != 0)) && (c2_pc == 1)) && ((c_t == ((long long) t_b + 1)) || (((long long) t_b + 2) == c_t))) && (e_wl != 0)) && (data == ((long long) t_b + 1))) && (wb_i == 1)) || (((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (c1_st != 0)) && (c2_st != 0)) && (wb_pc == 1)) && (((long long) t_b + 2) == data)) && (e_g != 1)) && (e_e != 0)) && (r_i != 1)) && (e_e != 1)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (c1_pc == 1)) && (wb_st != 0)) && (r_st != 0)) && (c2_pc == 1)) && ((c_t == ((long long) t_b + 1)) || (((long long) t_b + 2) == c_t))) && (e_wl != 0)) && (wb_i == 1))) && (e_f == 2))) || ((((((((((((((((((((((((e_g != 0) && (c1_st != 0)) && (d == 0)) && (wb_pc == 1)) && (c2_st == 0)) && (c2_pc == 0)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (r_i != 1)) && (e_e != 1)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (wb_st != 0)) && (processed == 0)) && (e_wl != 0)) && (0 == wl_pc)) && (c_req_up == r_i)) && (wb_i == 1))) || (((((((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (c1_st != 0)) && (d == 0)) && (c2_st != 0)) && (wb_pc == 1)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (2 != wl_pc)) && (0 != wl_pc)) && (r_i != 1)) && (e_e != 1)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (wb_st != 0)) && (c2_pc == 1)) && (processed == 0)) && (c_req_up == r_i)) && (wb_i == 1))) || ((((((((((((((0 != wl_st) && (e_g != 0)) && (e_g != 1)) && (e_e != 0)) && (e_c != 0)) && (r_i != 1)) && (e_e != 1)) && (e_wl != 1)) && (c1_i == 1)) && (c2_i == 1)) && (e_f == 2)) && (e_wl != 0)) && (0 == wl_pc)) && (wb_i == 1))) || ((((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (c1_st != 0)) && (c2_st != 0)) && (wb_pc == 1)) && (((long long) t_b + 2) == data)) && (e_g != 1)) && (e_e != 0)) && (r_i != 1)) && (e_e != 1)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (r_st != 0)) && (c2_pc == 1)) && (processed == 0)) && (e_wl != 0)) && (wb_st == 0)) && (wb_i == 1))) || ((((((((((((((((((((((((e_g != 0) && (c1_st != 0)) && (d == 0)) && (c2_st != 0)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (r_i != 1)) && (e_e != 1)) && (wb_pc == 0)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c2_pc == 1)) && (processed == 0)) && (e_wl != 0)) && (0 == wl_pc)) && (wb_st == 0)) && (c_req_up == r_i)) && (wb_i == 1))) || ((((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (c1_st != 0)) && (wb_pc == 1)) && (c2_st == 0)) && (e_g != 1)) && (e_e != 0)) && (r_i != 1)) && (e_e != 1)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (r_st != 0)) && (c2_pc == 1)) && (processed == 0)) && (e_wl != 0)) && (data == ((long long) t_b + 1))) && (wb_st == 0)) && (wb_i == 1))) || ((((((((((((((((((((((((e_g != 0) && (c1_st != 0)) && (d == 0)) && (c2_st != 0)) && (wb_pc == 1)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (r_i != 1)) && (e_e != 1)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (wb_st != 0)) && (c2_pc == 1)) && (processed == 0)) && (e_wl != 0)) && (0 == wl_pc)) && (c_req_up == r_i)) && (wb_i == 1))) || (((((((((((((((((0 != wl_st) && (e_g != 0)) && (wb_pc == 1)) && (e_g != 1)) && (e_e != 0)) && (e_c != 0)) && (2 != wl_pc)) && (r_i != 1)) && (e_e != 1)) && (e_wl != 1)) && (c1_i == 1)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (c2_pc == 1)) && (e_wl != 0)) && (wb_i == 1))) || (((((((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (c1_st != 0)) && (d == 0)) && (c2_st == 0)) && (c2_pc == 0)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (2 != wl_pc)) && (0 != wl_pc)) && (r_i != 1)) && (e_e != 1)) && (wb_pc == 0)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (processed == 0)) && (wb_st == 0)) && (c_req_up == r_i)) && (wb_i == 1))) || (((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (c1_st != 0)) && (c2_st != 0)) && (wb_pc == 1)) && (e_g != 1)) && (e_e != 0)) && (r_i != 1)) && (e_e != 1)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (wb_st != 0)) && (r_st != 0)) && (c2_pc == 1)) && (e_wl != 0)) && (c_req_up == r_i)) && (wb_i == 1))) - InvariantResult [Line: 87]: Location Invariant Derived location invariant: (((((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (wb_pc == 1)) && (((long long) t_b + 2) == data)) && (e_g != 1)) && (e_e != 0)) && (r_i != 1)) && (e_e != 1)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (c1_pc == 1)) && (wb_st != 0)) && (r_st != 0)) && (c2_pc == 1)) && (e_wl != 0)) && (wb_i == 1)) || ((((((((((((((((((0 != wl_st) && (e_g != 0)) && (wb_pc == 1)) && (e_g != 1)) && (e_e != 0)) && (r_i != 1)) && (e_e != 1)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (data == t_b)) && (c1_pc == 1)) && (wb_st != 0)) && (r_st != 0)) && (c2_pc == 1)) && (e_wl != 0)) && (wb_i == 1))) || ((((((((((((((((((0 != wl_st) && (e_g != 0)) && (wb_pc == 1)) && (e_g != 1)) && (e_e != 0)) && (r_i != 1)) && (e_e != 1)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (c1_pc == 1)) && (wb_st != 0)) && (r_st != 0)) && (c2_pc == 1)) && (e_wl != 0)) && (data == ((long long) t_b + 1))) && (wb_i == 1))) && (e_f == 2)) && (2 == wl_pc)) || ((((((((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (c1_st != 0)) && (d == 0)) && (c2_st != 0)) && (wb_pc == 1)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (0 != wl_pc)) && (r_i != 1)) && (e_e != 1)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (wb_st != 0)) && (c2_pc == 1)) && (processed == 0)) && (e_wl != 0)) && (c_req_up == r_i)) && (wb_i == 1))) - InvariantResult [Line: 197]: Location Invariant Derived location invariant: (((((((((((((((((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (c2_st != 0)) && (wb_pc == 1)) && (e_g != 1)) && (e_e != 0)) && (r_i != 1)) && (e_e != 1)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (r_st != 0)) && (c2_pc == 1)) && (processed == 0)) && (e_wl != 0)) && (data == ((long long) t_b + 1))) && (c1_st == 0)) && (wb_st == 0)) && (wb_i == 1)) || ((((((((((((((((((((((((e_g != 0) && (d == 0)) && (c2_st != 0)) && (c1_pc == 0)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (r_i != 1)) && (e_e != 1)) && (wb_pc == 0)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (processed == 0)) && (e_wl != 0)) && (c1_st == 0)) && (0 == wl_pc)) && (wb_st == 0)) && (c_req_up == r_i)) && (wb_i == 1))) || ((((((((((((((((((((((((e_g != 0) && (d == 0)) && (c2_st != 0)) && (wb_pc == 1)) && (c1_pc == 0)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (r_i != 1)) && (e_e != 1)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (wb_st != 0)) && (processed == 0)) && (e_wl != 0)) && (c1_st == 0)) && (0 == wl_pc)) && (c_req_up == r_i)) && (wb_i == 1))) || (((((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (c1_st != 0)) && (c2_st != 0)) && (wb_pc == 1)) && (e_g != 1)) && (e_e != 0)) && (r_i != 1)) && (e_e != 1)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (c1_pc == 1)) && (wb_st != 0)) && (r_st != 0)) && (c2_pc == 1)) && ((c_t == ((long long) t_b + 1)) || (((long long) t_b + 2) == c_t))) && (e_wl != 0)) && (data == ((long long) t_b + 1))) && (wb_i == 1)) || (((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (c1_st != 0)) && (c2_st != 0)) && (wb_pc == 1)) && (((long long) t_b + 2) == data)) && (e_g != 1)) && (e_e != 0)) && (r_i != 1)) && (e_e != 1)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (c1_pc == 1)) && (wb_st != 0)) && (r_st != 0)) && (c2_pc == 1)) && ((c_t == ((long long) t_b + 1)) || (((long long) t_b + 2) == c_t))) && (e_wl != 0)) && (wb_i == 1))) && (e_f == 2))) || ((((((((((((((0 != wl_st) && (e_g != 0)) && (e_g != 1)) && (e_e != 0)) && (e_c != 0)) && (r_i != 1)) && (e_e != 1)) && (e_wl != 1)) && (c1_i == 1)) && (c2_i == 1)) && (e_f == 2)) && (e_wl != 0)) && (0 == wl_pc)) && (wb_i == 1))) || (((((((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (d == 0)) && (c2_st != 0)) && (c1_pc == 0)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (2 != wl_pc)) && (0 != wl_pc)) && (r_i != 1)) && (e_e != 1)) && (wb_pc == 0)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (processed == 0)) && (c1_st == 0)) && (wb_st == 0)) && (c_req_up == r_i)) && (wb_i == 1))) || ((((((((((((((((((((((((e_g != 0) && (c1_st != 0)) && (d == 0)) && (c2_st != 0)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (r_i != 1)) && (e_e != 1)) && (wb_pc == 0)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (processed == 0)) && (e_wl != 0)) && (0 == wl_pc)) && (wb_st == 0)) && (c_req_up == r_i)) && (wb_i == 1))) || ((((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (c1_st != 0)) && (c2_st != 0)) && (wb_pc == 1)) && (((long long) t_b + 2) == data)) && (e_g != 1)) && (e_e != 0)) && (r_i != 1)) && (e_e != 1)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (r_st != 0)) && (c2_pc == 1)) && (processed == 0)) && (e_wl != 0)) && (wb_st == 0)) && (wb_i == 1))) || (((((((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (d == 0)) && (c2_st != 0)) && (wb_pc == 1)) && (c1_pc == 0)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (2 != wl_pc)) && (0 != wl_pc)) && (r_i != 1)) && (e_e != 1)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (wb_st != 0)) && (processed == 0)) && (c1_st == 0)) && (c_req_up == r_i)) && (wb_i == 1))) || (((((((((((((((((0 != wl_st) && (e_g != 0)) && (wb_pc == 1)) && (e_g != 1)) && (e_e != 0)) && (e_c != 0)) && (2 != wl_pc)) && (r_i != 1)) && (e_e != 1)) && (e_wl != 1)) && (c1_i == 1)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (c2_pc == 1)) && (e_wl != 0)) && (wb_i == 1))) || (((((((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (c1_st != 0)) && (d == 0)) && (c2_st != 0)) && (wb_pc == 1)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (2 != wl_pc)) && (0 != wl_pc)) && (r_i != 1)) && (e_e != 1)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (wb_st != 0)) && (processed == 0)) && (c_req_up == r_i)) && (wb_i == 1))) || ((((((((((((((((((((((((e_g != 0) && (c1_st != 0)) && (d == 0)) && (c2_st != 0)) && (wb_pc == 1)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (r_i != 1)) && (e_e != 1)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (wb_st != 0)) && (processed == 0)) && (e_wl != 0)) && (0 == wl_pc)) && (c_req_up == r_i)) && (wb_i == 1))) || (((((((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (c1_st != 0)) && (d == 0)) && (c2_st != 0)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (2 != wl_pc)) && (0 != wl_pc)) && (r_i != 1)) && (e_e != 1)) && (wb_pc == 0)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (processed == 0)) && (wb_st == 0)) && (c_req_up == r_i)) && (wb_i == 1))) || (((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (c1_st != 0)) && (c2_st != 0)) && (wb_pc == 1)) && (e_g != 1)) && (e_e != 0)) && (r_i != 1)) && (e_e != 1)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (wb_st != 0)) && (r_st != 0)) && (c2_pc == 1)) && (e_wl != 0)) && (c_req_up == r_i)) && (wb_i == 1))) - InvariantResult [Line: 242]: Location Invariant Derived location invariant: (((((((((((((((((((((((((((((((((((((e_g != 0) && (d == 0)) && (c2_st != 0)) && (c1_pc == 0)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (r_i != 1)) && (e_e != 1)) && (wb_pc == 0)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (wb_st != 0)) && (c2_pc == 1)) && (processed == 0)) && (e_wl != 0)) && (c1_st == 0)) && (0 == wl_pc)) && (c_req_up == r_i)) && (wb_i == 1)) || ((((((((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (d == 0)) && (c2_st != 0)) && (c1_pc == 0)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (2 != wl_pc)) && (0 != wl_pc)) && (r_i != 1)) && (e_e != 1)) && (wb_pc == 0)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (wb_st != 0)) && (c2_pc == 1)) && (processed == 0)) && (c1_st == 0)) && (c_req_up == r_i)) && (wb_i == 1))) || ((((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (c2_st != 0)) && (wb_pc == 1)) && (e_g != 1)) && (e_e != 0)) && (r_i != 1)) && (e_e != 1)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (wb_st != 0)) && (r_st != 0)) && (c2_pc == 1)) && ((c_t == ((long long) t_b + 1)) || (((long long) t_b + 2) == c_t))) && (e_wl != 0)) && (data == ((long long) t_b + 1))) && (c1_st == 0)) && (wb_i == 1))) || (((((((((((((((((((((((((e_g != 0) && (c1_st != 0)) && (d == 0)) && (c2_st != 0)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (r_i != 1)) && (e_e != 1)) && (wb_pc == 0)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (wb_st != 0)) && (c2_pc == 1)) && (processed == 0)) && (e_wl != 0)) && (0 == wl_pc)) && (c_req_up == r_i)) && (wb_i == 1))) || ((((((((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (c1_st != 0)) && (d == 0)) && (c2_st != 0)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (2 != wl_pc)) && (0 != wl_pc)) && (r_i != 1)) && (e_e != 1)) && (wb_pc == 0)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (wb_st != 0)) && (c2_pc == 1)) && (processed == 0)) && (c_req_up == r_i)) && (wb_i == 1))) || ((((((((((((((0 != wl_st) && (e_g != 0)) && (e_g != 1)) && (e_e != 0)) && (e_c != 0)) && (r_i != 1)) && (e_e != 1)) && (e_wl != 1)) && (c1_i == 1)) && (c2_i == 1)) && (e_f == 2)) && (e_wl != 0)) && (0 == wl_pc)) && (wb_i == 1))) || ((((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (c1_st != 0)) && (c2_st != 0)) && (wb_pc == 1)) && (((long long) t_b + 2) == data)) && (e_g != 1)) && (e_e != 0)) && (r_i != 1)) && (e_e != 1)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (wb_st != 0)) && (r_st != 0)) && (c2_pc == 1)) && (((long long) t_b + 2) == c_t)) && (e_wl != 0)) && (wb_i == 1))) || (((((((((((((((((0 != wl_st) && (e_g != 0)) && (wb_pc == 1)) && (e_g != 1)) && (e_e != 0)) && (e_c != 0)) && (2 != wl_pc)) && (r_i != 1)) && (e_e != 1)) && (e_wl != 1)) && (c1_i == 1)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (c2_pc == 1)) && (e_wl != 0)) && (wb_i == 1))) || ((((((((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (d == 0)) && (c2_st == 0)) && (c2_pc == 0)) && (c1_pc == 0)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (2 != wl_pc)) && (0 != wl_pc)) && (r_i != 1)) && (e_e != 1)) && (wb_pc == 0)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (wb_st != 0)) && (processed == 0)) && (c1_st == 0)) && (c_req_up == r_i)) && (wb_i == 1))) || ((((((((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (c1_st != 0)) && (d == 0)) && (c2_st == 0)) && (c2_pc == 0)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (2 != wl_pc)) && (0 != wl_pc)) && (r_i != 1)) && (e_e != 1)) && (wb_pc == 0)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (wb_st != 0)) && (processed == 0)) && (c_req_up == r_i)) && (wb_i == 1))) || ((((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (c1_st != 0)) && (wb_pc == 1)) && (c2_st == 0)) && (e_g != 1)) && (e_e != 0)) && (r_i != 1)) && (e_e != 1)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (wb_st != 0)) && (r_st != 0)) && (c2_pc == 1)) && ((c_t == ((long long) t_b + 1)) || (((long long) t_b + 2) == c_t))) && (e_wl != 0)) && (data == ((long long) t_b + 1))) && (wb_i == 1))) || (((((((((((((((((((((((((e_g != 0) && (c1_st != 0)) && (d == 0)) && (c2_st == 0)) && (c2_pc == 0)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (r_i != 1)) && (e_e != 1)) && (wb_pc == 0)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (wb_st != 0)) && (processed == 0)) && (e_wl != 0)) && (0 == wl_pc)) && (c_req_up == r_i)) && (wb_i == 1))) || (((((((((((((((((((((((((e_g != 0) && (d == 0)) && (c2_st == 0)) && (c2_pc == 0)) && (c1_pc == 0)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (r_i != 1)) && (e_e != 1)) && (wb_pc == 0)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (wb_st != 0)) && (processed == 0)) && (e_wl != 0)) && (c1_st == 0)) && (0 == wl_pc)) && (c_req_up == r_i)) && (wb_i == 1))) - InvariantResult [Line: 298]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (d == 0)) && (c2_st == 0)) && (c2_pc == 0)) && (c1_pc == 0)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (2 != wl_pc)) && (0 != wl_pc)) && (r_i != 1)) && (e_e != 1)) && (wb_pc == 0)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (processed == 0)) && (c1_st == 0)) && (wb_st == 0)) && (c_req_up == r_i)) && (wb_i == 1)) || ((((((((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (c1_st != 0)) && (d == 0)) && (c2_st == 0)) && (c2_pc == 0)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (2 != wl_pc)) && (0 != wl_pc)) && (r_i != 1)) && (e_e != 1)) && (wb_pc == 0)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (processed == 0)) && (wb_st == 0)) && (c_req_up == r_i)) && (wb_i == 1))) || (((((((((((((((((((((((((e_g != 0) && (c1_st != 0)) && (d == 0)) && (wb_pc == 1)) && (c2_st == 0)) && (c2_pc == 0)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (r_i != 1)) && (e_e != 1)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (wb_st != 0)) && (processed == 0)) && (e_wl != 0)) && (0 == wl_pc)) && (c_req_up == r_i)) && (wb_i == 1))) || (((e_f == 2) && (2 == wl_pc)) && (((((((((((((((((((((((e_g != 0) && (c1_st != 0)) && ((((long long) t_b + 1) == d) || (((long long) t_b + 2) == d))) && (c2_st != 0)) && (wb_pc == 1)) && (((long long) t_b + 2) == data)) && (e_g != 1)) && (e_e != 0)) && (r_i != 1)) && ((((long long) t_b + 2) == c) || (((long long) t_b + 1) == c))) && (e_e != 1)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (c1_pc == 1)) && (wb_st != 0)) && (r_st != 0)) && (c2_pc == 1)) && ((c_t == ((long long) t_b + 1)) || (((long long) t_b + 2) == c_t))) && (e_wl != 0)) && (wb_i == 1)) || ((((((((((((((((((((((e_g != 0) && (c1_st != 0)) && ((((long long) t_b + 1) == d) || (((long long) t_b + 2) == d))) && (c2_st != 0)) && (wb_pc == 1)) && (e_g != 1)) && (e_e != 0)) && (r_i != 1)) && ((((long long) t_b + 2) == c) || (((long long) t_b + 1) == c))) && (e_e != 1)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (c1_pc == 1)) && (wb_st != 0)) && (r_st != 0)) && (c2_pc == 1)) && ((c_t == ((long long) t_b + 1)) || (((long long) t_b + 2) == c_t))) && (e_wl != 0)) && (data == ((long long) t_b + 1))) && (wb_i == 1))))) || ((((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (c2_st != 0)) && (wb_pc == 1)) && (e_g != 1)) && (e_e != 0)) && (r_i != 1)) && (e_e != 1)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (r_st != 0)) && (c2_pc == 1)) && (processed == 0)) && (e_wl != 0)) && (data == ((long long) t_b + 1))) && (c1_st == 0)) && (wb_st == 0)) && (wb_i == 1))) || (((((((((((((((((((((((((e_g != 0) && (d == 0)) && (c2_st != 0)) && (wb_pc == 1)) && (c1_pc == 0)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (r_i != 1)) && (e_e != 1)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (wb_st != 0)) && (c2_pc == 1)) && (processed == 0)) && (e_wl != 0)) && (c1_st == 0)) && (0 == wl_pc)) && (c_req_up == r_i)) && (wb_i == 1))) || ((((((((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (c1_st != 0)) && (d == 0)) && (c2_st != 0)) && (wb_pc == 1)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (2 != wl_pc)) && (0 != wl_pc)) && (r_i != 1)) && (e_e != 1)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (wb_st != 0)) && (c2_pc == 1)) && (processed == 0)) && (c_req_up == r_i)) && (wb_i == 1))) || ((((((((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (d == 0)) && (c2_st != 0)) && (wb_pc == 1)) && (c1_pc == 0)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (2 != wl_pc)) && (0 != wl_pc)) && (r_i != 1)) && (e_e != 1)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (wb_st != 0)) && (c2_pc == 1)) && (processed == 0)) && (c1_st == 0)) && (c_req_up == r_i)) && (wb_i == 1))) || ((((((((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (c1_st != 0)) && (d == 0)) && (wb_pc == 1)) && (c2_st == 0)) && (c2_pc == 0)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (2 != wl_pc)) && (0 != wl_pc)) && (r_i != 1)) && (e_e != 1)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (wb_st != 0)) && (processed == 0)) && (c_req_up == r_i)) && (wb_i == 1))) || (((((((((((((((((((((((((e_g != 0) && (d == 0)) && (wb_pc == 1)) && (c2_st == 0)) && (c2_pc == 0)) && (c1_pc == 0)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (r_i != 1)) && (e_e != 1)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (wb_st != 0)) && (processed == 0)) && (e_wl != 0)) && (c1_st == 0)) && (0 == wl_pc)) && (c_req_up == r_i)) && (wb_i == 1))) || (((((((((((((((((((((((((e_g != 0) && (d == 0)) && (c2_st != 0)) && (c1_pc == 0)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (r_i != 1)) && (e_e != 1)) && (wb_pc == 0)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c2_pc == 1)) && (processed == 0)) && (e_wl != 0)) && (c1_st == 0)) && (0 == wl_pc)) && (wb_st == 0)) && (c_req_up == r_i)) && (wb_i == 1))) || ((((((((((((((0 != wl_st) && (e_g != 0)) && (e_g != 1)) && (e_e != 0)) && (e_c != 0)) && (r_i != 1)) && (e_e != 1)) && (e_wl != 1)) && (c1_i == 1)) && (c2_i == 1)) && (e_f == 2)) && (e_wl != 0)) && (0 == wl_pc)) && (wb_i == 1))) || (((((((((((((((((((((((((e_g != 0) && (c1_st != 0)) && (d == 0)) && (c2_st == 0)) && (c2_pc == 0)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (r_i != 1)) && (e_e != 1)) && (wb_pc == 0)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (processed == 0)) && (e_wl != 0)) && (0 == wl_pc)) && (wb_st == 0)) && (c_req_up == r_i)) && (wb_i == 1))) || (((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (c2_st != 0)) && (wb_pc == 1)) && (e_g != 1)) && (e_e != 0)) && (r_i != 1)) && (e_e != 1)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (wb_st != 0)) && (r_st != 0)) && (c2_pc == 1)) && ((c_t == ((long long) t_b + 1)) || (((long long) t_b + 2) == c_t))) && (e_wl != 0)) && (data == ((long long) t_b + 1))) && (wb_i == 1))) || ((((((((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (c1_st != 0)) && (d == 0)) && (c2_st != 0)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (2 != wl_pc)) && (0 != wl_pc)) && (r_i != 1)) && (e_e != 1)) && (wb_pc == 0)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (c2_pc == 1)) && (processed == 0)) && (wb_st == 0)) && (c_req_up == r_i)) && (wb_i == 1))) || ((((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (c1_st != 0)) && (c2_st != 0)) && (wb_pc == 1)) && (((long long) t_b + 2) == data)) && (e_g != 1)) && (e_e != 0)) && (r_i != 1)) && (e_e != 1)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (r_st != 0)) && (c2_pc == 1)) && (processed == 0)) && (e_wl != 0)) && (wb_st == 0)) && (wb_i == 1))) || ((((((((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (d == 0)) && (wb_pc == 1)) && (c2_st == 0)) && (c2_pc == 0)) && (c1_pc == 0)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (2 != wl_pc)) && (0 != wl_pc)) && (r_i != 1)) && (e_e != 1)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (wb_st != 0)) && (processed == 0)) && (c1_st == 0)) && (c_req_up == r_i)) && (wb_i == 1))) || (((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (c1_st != 0)) && (wb_pc == 1)) && (e_g != 1)) && (e_e != 0)) && (r_i != 1)) && (e_e != 1)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (wb_st != 0)) && (r_st != 0)) && (c2_pc == 1)) && ((c_t == ((long long) t_b + 1)) || (((long long) t_b + 2) == c_t))) && (e_wl != 0)) && (data == ((long long) t_b + 1))) && (wb_i == 1))) || (((((((((((((((((((((((((e_g != 0) && (d == 0)) && (c2_st == 0)) && (c2_pc == 0)) && (c1_pc == 0)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (r_i != 1)) && (e_e != 1)) && (wb_pc == 0)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (processed == 0)) && (e_wl != 0)) && (c1_st == 0)) && (0 == wl_pc)) && (wb_st == 0)) && (c_req_up == r_i)) && (wb_i == 1))) || (((((((((((((((((((((((((e_g != 0) && (c1_st != 0)) && (d == 0)) && (c2_st != 0)) && (wb_pc == 1)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (2 != wl_pc)) && (r_i != 1)) && (e_e != 1)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (wb_st != 0)) && (c2_pc == 1)) && (processed == 0)) && (e_wl != 0)) && (c_req_up == r_i)) && (wb_i == 1))) || ((((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (c1_st != 0)) && (c2_st != 0)) && (wb_pc == 1)) && (((long long) t_b + 2) == data)) && (e_g != 1)) && (e_e != 0)) && (r_i != 1)) && (e_e != 1)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (wb_st != 0)) && (r_st != 0)) && (c2_pc == 1)) && ((c_t == ((long long) t_b + 1)) || (((long long) t_b + 2) == c_t))) && (e_wl != 0)) && (wb_i == 1))) || ((((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (c1_st != 0)) && (wb_pc == 1)) && (c2_st == 0)) && (e_g != 1)) && (e_e != 0)) && (r_i != 1)) && (e_e != 1)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (r_st != 0)) && (c2_pc == 1)) && (processed == 0)) && (e_wl != 0)) && (data == ((long long) t_b + 1))) && (wb_st == 0)) && (wb_i == 1))) || (((((((((((((((((0 != wl_st) && (e_g != 0)) && (wb_pc == 1)) && (e_g != 1)) && (e_e != 0)) && (e_c != 0)) && (2 != wl_pc)) && (r_i != 1)) && (e_e != 1)) && (e_wl != 1)) && (c1_i == 1)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (c2_pc == 1)) && (e_wl != 0)) && (wb_i == 1))) || (((((((((((((((((((((((((e_g != 0) && (c1_st != 0)) && (d == 0)) && (c2_st != 0)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (r_i != 1)) && (e_e != 1)) && (wb_pc == 0)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (c2_pc == 1)) && (processed == 0)) && (e_wl != 0)) && (0 == wl_pc)) && (wb_st == 0)) && (c_req_up == r_i)) && (wb_i == 1))) || ((((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (wb_pc == 1)) && (c2_st == 0)) && (e_g != 1)) && (e_e != 0)) && (r_i != 1)) && (e_e != 1)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (data == t_b)) && (e_f == 2)) && (c1_pc == 1)) && (wb_st != 0)) && (r_st != 0)) && (c2_pc == 1)) && (processed == 0)) && (e_wl != 0)) && (c1_st == 0)) && (wb_i == 1))) || (((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (c1_st != 0)) && (c2_st != 0)) && (wb_pc == 1)) && (e_g != 1)) && (e_e != 0)) && (r_i != 1)) && (e_e != 1)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c1_pc == 1)) && (wb_st != 0)) && (r_st != 0)) && (c2_pc == 1)) && (e_wl != 0)) && (c_req_up == r_i)) && (wb_i == 1))) || ((((((((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (d == 0)) && (c2_st != 0)) && (c1_pc == 0)) && (e_g != 1)) && (t_b == 0)) && (e_e != 0)) && (data == 0)) && (2 != wl_pc)) && (0 != wl_pc)) && (r_i != 1)) && (e_e != 1)) && (wb_pc == 0)) && (r_st == 2)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (e_f == 2)) && (c2_pc == 1)) && (processed == 0)) && (c1_st == 0)) && (wb_st == 0)) && (c_req_up == r_i)) && (wb_i == 1))) || ((e_f == 2) && ((((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (c1_st != 0)) && (c2_st != 0)) && (wb_pc == 1)) && (e_g != 1)) && (e_e != 0)) && (r_i != 1)) && ((((long long) t_b + 2) == c) || (((long long) t_b + 1) == c))) && (e_e != 1)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (c1_pc == 1)) && (wb_st != 0)) && (c2_pc == 1)) && ((c_t == ((long long) t_b + 1)) || (((long long) t_b + 2) == c_t))) && (e_wl != 0)) && (data == ((long long) t_b + 1))) && (wb_i == 1)) || (((((((((((((((((((((0 != wl_st) && (e_g != 0)) && (c1_st != 0)) && (c2_st != 0)) && (wb_pc == 1)) && (((long long) t_b + 2) == data)) && (e_g != 1)) && (e_e != 0)) && (r_i != 1)) && ((((long long) t_b + 2) == c) || (((long long) t_b + 1) == c))) && (e_e != 1)) && (e_wl != 1)) && (c1_i == 1)) && (e_c == 2)) && (c2_i == 1)) && (c1_pc == 1)) && (wb_st != 0)) && (c2_pc == 1)) && ((c_t == ((long long) t_b + 1)) || (((long long) t_b + 2) == c_t))) && (e_wl != 0)) && (wb_i == 1))))) RESULT: Ultimate proved your program to be correct! [2024-11-13 15:06:45,826 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc971c60-86e9-42e1-836b-99d9cb585eda/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE