./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy1.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy1.cil.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --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 c40ed6d21fe4d61cae011269f1fdb95d05149cea0f3470f42c6e8f2fc8fb0d6a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 03:15:01,555 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 03:15:01,622 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 03:15:01,628 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 03:15:01,629 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 03:15:01,667 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 03:15:01,668 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 03:15:01,669 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 03:15:01,670 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 03:15:01,672 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 03:15:01,672 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 03:15:01,672 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 03:15:01,673 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 03:15:01,673 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 03:15:01,677 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 03:15:01,678 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 03:15:01,678 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 03:15:01,678 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 03:15:01,679 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 03:15:01,679 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 03:15:01,679 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 03:15:01,680 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 03:15:01,681 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 03:15:01,681 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 03:15:01,681 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 03:15:01,681 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 03:15:01,682 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 03:15:01,682 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 03:15:01,682 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 03:15:01,683 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 03:15:01,683 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 03:15:01,683 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 03:15:01,684 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:15:01,684 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 03:15:01,684 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 03:15:01,685 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 03:15:01,685 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 03:15:01,685 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 03:15:01,685 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 03:15:01,686 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 03:15:01,686 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 03:15:01,687 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 03:15:01,688 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux 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 -> c40ed6d21fe4d61cae011269f1fdb95d05149cea0f3470f42c6e8f2fc8fb0d6a [2024-10-11 03:15:01,968 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 03:15:01,996 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 03:15:02,000 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 03:15:02,001 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 03:15:02,002 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 03:15:02,004 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy1.cil.c [2024-10-11 03:15:03,576 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 03:15:03,794 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 03:15:03,794 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy1.cil.c [2024-10-11 03:15:03,811 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7f41bc5e7/849ecaa8d3984040a3baeea37f3f4654/FLAG327bf5c12 [2024-10-11 03:15:03,827 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7f41bc5e7/849ecaa8d3984040a3baeea37f3f4654 [2024-10-11 03:15:03,831 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 03:15:03,833 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 03:15:03,834 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 03:15:03,834 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 03:15:03,843 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 03:15:03,844 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:15:03" (1/1) ... [2024-10-11 03:15:03,845 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47154d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:15:03, skipping insertion in model container [2024-10-11 03:15:03,847 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:15:03" (1/1) ... [2024-10-11 03:15:03,879 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 03:15:04,052 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy1.cil.c[698,711] [2024-10-11 03:15:04,144 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:15:04,159 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 03:15:04,171 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy1.cil.c[698,711] [2024-10-11 03:15:04,206 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:15:04,228 INFO L204 MainTranslator]: Completed translation [2024-10-11 03:15:04,229 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:15:04 WrapperNode [2024-10-11 03:15:04,229 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 03:15:04,230 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 03:15:04,231 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 03:15:04,231 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 03:15:04,238 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:15:04" (1/1) ... [2024-10-11 03:15:04,246 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:15:04" (1/1) ... [2024-10-11 03:15:04,271 INFO L138 Inliner]: procedures = 20, calls = 16, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 364 [2024-10-11 03:15:04,272 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 03:15:04,273 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 03:15:04,273 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 03:15:04,273 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 03:15:04,282 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:15:04" (1/1) ... [2024-10-11 03:15:04,282 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:15:04" (1/1) ... [2024-10-11 03:15:04,287 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:15:04" (1/1) ... [2024-10-11 03:15:04,304 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-10-11 03:15:04,305 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:15:04" (1/1) ... [2024-10-11 03:15:04,305 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:15:04" (1/1) ... [2024-10-11 03:15:04,310 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:15:04" (1/1) ... [2024-10-11 03:15:04,321 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:15:04" (1/1) ... [2024-10-11 03:15:04,325 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:15:04" (1/1) ... [2024-10-11 03:15:04,327 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:15:04" (1/1) ... [2024-10-11 03:15:04,333 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 03:15:04,334 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 03:15:04,334 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 03:15:04,334 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 03:15:04,335 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:15:04" (1/1) ... [2024-10-11 03:15:04,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:15:04,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:15:04,380 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 03:15:04,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 03:15:04,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 03:15:04,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 03:15:04,427 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-10-11 03:15:04,427 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-10-11 03:15:04,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 03:15:04,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 03:15:04,496 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 03:15:04,500 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 03:15:04,957 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-11 03:15:04,957 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 03:15:04,995 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 03:15:04,997 INFO L314 CfgBuilder]: Removed 6 assume(true) statements. [2024-10-11 03:15:04,997 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:15:04 BoogieIcfgContainer [2024-10-11 03:15:04,997 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 03:15:05,000 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 03:15:05,000 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 03:15:05,004 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 03:15:05,004 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:15:03" (1/3) ... [2024-10-11 03:15:05,005 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c9ad83e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:15:05, skipping insertion in model container [2024-10-11 03:15:05,006 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:15:04" (2/3) ... [2024-10-11 03:15:05,006 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c9ad83e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:15:05, skipping insertion in model container [2024-10-11 03:15:05,006 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:15:04" (3/3) ... [2024-10-11 03:15:05,008 INFO L112 eAbstractionObserver]: Analyzing ICFG toy1.cil.c [2024-10-11 03:15:05,028 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 03:15:05,028 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 03:15:05,087 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 03:15:05,093 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;@1ad9a22d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 03:15:05,093 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 03:15:05,097 INFO L276 IsEmpty]: Start isEmpty. Operand has 124 states, 119 states have (on average 1.9243697478991597) internal successors, (229), 122 states have internal predecessors, (229), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 03:15:05,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 03:15:05,104 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:15:05,105 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] [2024-10-11 03:15:05,105 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:15:05,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:15:05,109 INFO L85 PathProgramCache]: Analyzing trace with hash 2028212331, now seen corresponding path program 1 times [2024-10-11 03:15:05,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:15:05,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201722874] [2024-10-11 03:15:05,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:15:05,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:15:05,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:05,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:15:05,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:15:05,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201722874] [2024-10-11 03:15:05,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201722874] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:15:05,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:15:05,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 03:15:05,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040412777] [2024-10-11 03:15:05,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:15:05,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:15:05,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:15:05,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:15:05,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:15:05,430 INFO L87 Difference]: Start difference. First operand has 124 states, 119 states have (on average 1.9243697478991597) internal successors, (229), 122 states have internal predecessors, (229), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:05,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:15:05,494 INFO L93 Difference]: Finished difference Result 240 states and 454 transitions. [2024-10-11 03:15:05,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:15:05,497 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-10-11 03:15:05,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:15:05,505 INFO L225 Difference]: With dead ends: 240 [2024-10-11 03:15:05,505 INFO L226 Difference]: Without dead ends: 121 [2024-10-11 03:15:05,508 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:15:05,511 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 213 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:15:05,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 206 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:15:05,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-10-11 03:15:05,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-10-11 03:15:05,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 118 states have (on average 1.805084745762712) internal successors, (213), 119 states have internal predecessors, (213), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:05,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 215 transitions. [2024-10-11 03:15:05,550 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 215 transitions. Word has length 34 [2024-10-11 03:15:05,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:15:05,550 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 215 transitions. [2024-10-11 03:15:05,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:05,551 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 215 transitions. [2024-10-11 03:15:05,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 03:15:05,552 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:15:05,552 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] [2024-10-11 03:15:05,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 03:15:05,553 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:15:05,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:15:05,554 INFO L85 PathProgramCache]: Analyzing trace with hash 2005580077, now seen corresponding path program 1 times [2024-10-11 03:15:05,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:15:05,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713971742] [2024-10-11 03:15:05,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:15:05,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:15:05,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:05,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:15:05,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:15:05,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713971742] [2024-10-11 03:15:05,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713971742] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:15:05,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:15:05,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:15:05,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664596638] [2024-10-11 03:15:05,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:15:05,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:15:05,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:15:05,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:15:05,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:15:05,700 INFO L87 Difference]: Start difference. First operand 121 states and 215 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:05,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:15:05,816 INFO L93 Difference]: Finished difference Result 327 states and 579 transitions. [2024-10-11 03:15:05,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:15:05,817 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-10-11 03:15:05,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:15:05,820 INFO L225 Difference]: With dead ends: 327 [2024-10-11 03:15:05,820 INFO L226 Difference]: Without dead ends: 208 [2024-10-11 03:15:05,821 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-10-11 03:15:05,822 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 558 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:15:05,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [558 Valid, 343 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:15:05,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-10-11 03:15:05,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 204. [2024-10-11 03:15:05,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 201 states have (on average 1.7860696517412935) internal successors, (359), 202 states have internal predecessors, (359), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:05,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 361 transitions. [2024-10-11 03:15:05,851 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 361 transitions. Word has length 34 [2024-10-11 03:15:05,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:15:05,852 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 361 transitions. [2024-10-11 03:15:05,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:05,852 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 361 transitions. [2024-10-11 03:15:05,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 03:15:05,854 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:15:05,854 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] [2024-10-11 03:15:05,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 03:15:05,855 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:15:05,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:15:05,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1496106987, now seen corresponding path program 1 times [2024-10-11 03:15:05,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:15:05,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909485653] [2024-10-11 03:15:05,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:15:05,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:15:05,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:05,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:15:05,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:15:05,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909485653] [2024-10-11 03:15:05,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909485653] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:15:05,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:15:05,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 03:15:05,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014547619] [2024-10-11 03:15:05,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:15:05,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:15:05,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:15:05,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:15:05,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:15:05,991 INFO L87 Difference]: Start difference. First operand 204 states and 361 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:06,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:15:06,039 INFO L93 Difference]: Finished difference Result 400 states and 710 transitions. [2024-10-11 03:15:06,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:15:06,040 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-10-11 03:15:06,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:15:06,041 INFO L225 Difference]: With dead ends: 400 [2024-10-11 03:15:06,043 INFO L226 Difference]: Without dead ends: 204 [2024-10-11 03:15:06,044 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:15:06,047 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 185 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 189 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-10-11 03:15:06,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 189 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:15:06,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-10-11 03:15:06,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2024-10-11 03:15:06,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 201 states have (on average 1.7263681592039801) internal successors, (347), 202 states have internal predecessors, (347), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:06,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 349 transitions. [2024-10-11 03:15:06,062 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 349 transitions. Word has length 34 [2024-10-11 03:15:06,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:15:06,062 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 349 transitions. [2024-10-11 03:15:06,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:06,062 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 349 transitions. [2024-10-11 03:15:06,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 03:15:06,063 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:15:06,064 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] [2024-10-11 03:15:06,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 03:15:06,064 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:15:06,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:15:06,065 INFO L85 PathProgramCache]: Analyzing trace with hash 2139471343, now seen corresponding path program 1 times [2024-10-11 03:15:06,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:15:06,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863358898] [2024-10-11 03:15:06,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:15:06,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:15:06,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:06,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:15:06,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:15:06,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863358898] [2024-10-11 03:15:06,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863358898] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:15:06,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:15:06,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:15:06,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775112409] [2024-10-11 03:15:06,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:15:06,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:15:06,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:15:06,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:15:06,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:15:06,136 INFO L87 Difference]: Start difference. First operand 204 states and 349 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:06,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:15:06,258 INFO L93 Difference]: Finished difference Result 555 states and 952 transitions. [2024-10-11 03:15:06,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:15:06,260 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-10-11 03:15:06,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:15:06,262 INFO L225 Difference]: With dead ends: 555 [2024-10-11 03:15:06,262 INFO L226 Difference]: Without dead ends: 360 [2024-10-11 03:15:06,263 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-10-11 03:15:06,268 INFO L432 NwaCegarLoop]: 294 mSDtfsCounter, 359 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:15:06,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 419 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:15:06,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2024-10-11 03:15:06,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 204. [2024-10-11 03:15:06,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 201 states have (on average 1.7114427860696517) internal successors, (344), 202 states have internal predecessors, (344), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:06,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 346 transitions. [2024-10-11 03:15:06,297 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 346 transitions. Word has length 34 [2024-10-11 03:15:06,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:15:06,297 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 346 transitions. [2024-10-11 03:15:06,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:06,298 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 346 transitions. [2024-10-11 03:15:06,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 03:15:06,299 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:15:06,301 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] [2024-10-11 03:15:06,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 03:15:06,301 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:15:06,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:15:06,302 INFO L85 PathProgramCache]: Analyzing trace with hash -2093456339, now seen corresponding path program 1 times [2024-10-11 03:15:06,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:15:06,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095297854] [2024-10-11 03:15:06,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:15:06,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:15:06,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:06,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:15:06,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:15:06,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095297854] [2024-10-11 03:15:06,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095297854] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:15:06,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:15:06,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:15:06,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292325327] [2024-10-11 03:15:06,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:15:06,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:15:06,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:15:06,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:15:06,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:15:06,362 INFO L87 Difference]: Start difference. First operand 204 states and 346 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:06,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:15:06,465 INFO L93 Difference]: Finished difference Result 558 states and 948 transitions. [2024-10-11 03:15:06,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:15:06,466 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-10-11 03:15:06,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:15:06,468 INFO L225 Difference]: With dead ends: 558 [2024-10-11 03:15:06,468 INFO L226 Difference]: Without dead ends: 364 [2024-10-11 03:15:06,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-10-11 03:15:06,471 INFO L432 NwaCegarLoop]: 298 mSDtfsCounter, 358 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:15:06,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 429 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:15:06,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2024-10-11 03:15:06,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 204. [2024-10-11 03:15:06,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 201 states have (on average 1.6965174129353233) internal successors, (341), 202 states have internal predecessors, (341), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:06,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 343 transitions. [2024-10-11 03:15:06,517 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 343 transitions. Word has length 34 [2024-10-11 03:15:06,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:15:06,518 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 343 transitions. [2024-10-11 03:15:06,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:06,518 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 343 transitions. [2024-10-11 03:15:06,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 03:15:06,519 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:15:06,519 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] [2024-10-11 03:15:06,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 03:15:06,520 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:15:06,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:15:06,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1952907729, now seen corresponding path program 1 times [2024-10-11 03:15:06,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:15:06,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551909738] [2024-10-11 03:15:06,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:15:06,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:15:06,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:06,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:15:06,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:15:06,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551909738] [2024-10-11 03:15:06,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551909738] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:15:06,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:15:06,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:15:06,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666223485] [2024-10-11 03:15:06,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:15:06,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:15:06,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:15:06,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:15:06,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:15:06,632 INFO L87 Difference]: Start difference. First operand 204 states and 343 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:06,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:15:06,730 INFO L93 Difference]: Finished difference Result 570 states and 959 transitions. [2024-10-11 03:15:06,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:15:06,732 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-10-11 03:15:06,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:15:06,734 INFO L225 Difference]: With dead ends: 570 [2024-10-11 03:15:06,734 INFO L226 Difference]: Without dead ends: 377 [2024-10-11 03:15:06,735 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-10-11 03:15:06,738 INFO L432 NwaCegarLoop]: 302 mSDtfsCounter, 363 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:15:06,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 436 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:15:06,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2024-10-11 03:15:06,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 210. [2024-10-11 03:15:06,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 207 states have (on average 1.6666666666666667) internal successors, (345), 208 states have internal predecessors, (345), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:06,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 347 transitions. [2024-10-11 03:15:06,759 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 347 transitions. Word has length 34 [2024-10-11 03:15:06,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:15:06,759 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 347 transitions. [2024-10-11 03:15:06,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:06,760 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 347 transitions. [2024-10-11 03:15:06,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 03:15:06,761 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:15:06,761 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] [2024-10-11 03:15:06,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 03:15:06,765 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:15:06,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:15:06,766 INFO L85 PathProgramCache]: Analyzing trace with hash -2086921235, now seen corresponding path program 1 times [2024-10-11 03:15:06,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:15:06,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868866850] [2024-10-11 03:15:06,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:15:06,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:15:06,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:06,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:15:06,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:15:06,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868866850] [2024-10-11 03:15:06,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868866850] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:15:06,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:15:06,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:15:06,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690600777] [2024-10-11 03:15:06,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:15:06,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:15:06,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:15:06,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:15:06,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:15:06,826 INFO L87 Difference]: Start difference. First operand 210 states and 347 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:06,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:15:06,952 INFO L93 Difference]: Finished difference Result 716 states and 1184 transitions. [2024-10-11 03:15:06,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:15:06,953 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-10-11 03:15:06,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:15:06,958 INFO L225 Difference]: With dead ends: 716 [2024-10-11 03:15:06,958 INFO L226 Difference]: Without dead ends: 518 [2024-10-11 03:15:06,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-10-11 03:15:06,960 INFO L432 NwaCegarLoop]: 294 mSDtfsCounter, 359 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:15:06,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 520 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:15:06,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2024-10-11 03:15:06,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 342. [2024-10-11 03:15:06,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 339 states have (on average 1.654867256637168) internal successors, (561), 340 states have internal predecessors, (561), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:06,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 563 transitions. [2024-10-11 03:15:06,986 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 563 transitions. Word has length 34 [2024-10-11 03:15:06,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:15:06,986 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 563 transitions. [2024-10-11 03:15:06,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:06,987 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 563 transitions. [2024-10-11 03:15:06,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 03:15:06,989 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:15:06,990 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] [2024-10-11 03:15:06,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 03:15:06,991 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:15:06,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:15:06,992 INFO L85 PathProgramCache]: Analyzing trace with hash 402607727, now seen corresponding path program 1 times [2024-10-11 03:15:06,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:15:06,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155526666] [2024-10-11 03:15:06,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:15:06,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:15:07,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:07,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:15:07,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:15:07,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155526666] [2024-10-11 03:15:07,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155526666] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:15:07,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:15:07,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 03:15:07,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008005740] [2024-10-11 03:15:07,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:15:07,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:15:07,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:15:07,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:15:07,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:15:07,051 INFO L87 Difference]: Start difference. First operand 342 states and 563 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:07,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:15:07,125 INFO L93 Difference]: Finished difference Result 816 states and 1349 transitions. [2024-10-11 03:15:07,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:15:07,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-10-11 03:15:07,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:15:07,128 INFO L225 Difference]: With dead ends: 816 [2024-10-11 03:15:07,129 INFO L226 Difference]: Without dead ends: 497 [2024-10-11 03:15:07,131 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:15:07,132 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 173 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:15:07,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 317 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:15:07,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2024-10-11 03:15:07,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 493. [2024-10-11 03:15:07,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 490 states have (on average 1.653061224489796) internal successors, (810), 491 states have internal predecessors, (810), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:07,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 812 transitions. [2024-10-11 03:15:07,165 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 812 transitions. Word has length 34 [2024-10-11 03:15:07,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:15:07,165 INFO L471 AbstractCegarLoop]: Abstraction has 493 states and 812 transitions. [2024-10-11 03:15:07,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:07,165 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 812 transitions. [2024-10-11 03:15:07,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 03:15:07,167 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:15:07,167 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] [2024-10-11 03:15:07,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 03:15:07,168 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:15:07,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:15:07,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1772546189, now seen corresponding path program 1 times [2024-10-11 03:15:07,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:15:07,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328059720] [2024-10-11 03:15:07,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:15:07,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:15:07,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:07,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:15:07,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:15:07,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328059720] [2024-10-11 03:15:07,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328059720] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:15:07,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:15:07,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:15:07,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147223387] [2024-10-11 03:15:07,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:15:07,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:15:07,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:15:07,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:15:07,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:15:07,226 INFO L87 Difference]: Start difference. First operand 493 states and 812 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:07,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:15:07,350 INFO L93 Difference]: Finished difference Result 1258 states and 2072 transitions. [2024-10-11 03:15:07,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:15:07,351 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-10-11 03:15:07,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:15:07,354 INFO L225 Difference]: With dead ends: 1258 [2024-10-11 03:15:07,354 INFO L226 Difference]: Without dead ends: 781 [2024-10-11 03:15:07,355 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-10-11 03:15:07,356 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 469 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:15:07,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 303 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:15:07,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2024-10-11 03:15:07,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 493. [2024-10-11 03:15:07,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 490 states have (on average 1.636734693877551) internal successors, (802), 491 states have internal predecessors, (802), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:07,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 804 transitions. [2024-10-11 03:15:07,383 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 804 transitions. Word has length 34 [2024-10-11 03:15:07,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:15:07,384 INFO L471 AbstractCegarLoop]: Abstraction has 493 states and 804 transitions. [2024-10-11 03:15:07,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:07,384 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 804 transitions. [2024-10-11 03:15:07,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 03:15:07,384 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:15:07,384 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] [2024-10-11 03:15:07,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 03:15:07,385 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:15:07,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:15:07,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1501352753, now seen corresponding path program 1 times [2024-10-11 03:15:07,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:15:07,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994639699] [2024-10-11 03:15:07,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:15:07,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:15:07,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:07,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:15:07,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:15:07,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994639699] [2024-10-11 03:15:07,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994639699] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:15:07,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:15:07,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:15:07,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337909664] [2024-10-11 03:15:07,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:15:07,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:15:07,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:15:07,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:15:07,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:15:07,425 INFO L87 Difference]: Start difference. First operand 493 states and 804 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:07,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:15:07,532 INFO L93 Difference]: Finished difference Result 1254 states and 2045 transitions. [2024-10-11 03:15:07,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:15:07,532 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-10-11 03:15:07,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:15:07,536 INFO L225 Difference]: With dead ends: 1254 [2024-10-11 03:15:07,536 INFO L226 Difference]: Without dead ends: 783 [2024-10-11 03:15:07,537 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-10-11 03:15:07,538 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 451 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:15:07,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [451 Valid, 292 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:15:07,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2024-10-11 03:15:07,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 493. [2024-10-11 03:15:07,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 490 states have (on average 1.620408163265306) internal successors, (794), 491 states have internal predecessors, (794), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:07,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 796 transitions. [2024-10-11 03:15:07,567 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 796 transitions. Word has length 34 [2024-10-11 03:15:07,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:15:07,567 INFO L471 AbstractCegarLoop]: Abstraction has 493 states and 796 transitions. [2024-10-11 03:15:07,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:07,567 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 796 transitions. [2024-10-11 03:15:07,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 03:15:07,568 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:15:07,568 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] [2024-10-11 03:15:07,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 03:15:07,568 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:15:07,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:15:07,569 INFO L85 PathProgramCache]: Analyzing trace with hash 490235503, now seen corresponding path program 1 times [2024-10-11 03:15:07,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:15:07,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439818273] [2024-10-11 03:15:07,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:15:07,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:15:07,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:07,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:15:07,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:15:07,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439818273] [2024-10-11 03:15:07,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439818273] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:15:07,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:15:07,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:15:07,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82602809] [2024-10-11 03:15:07,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:15:07,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:15:07,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:15:07,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:15:07,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:15:07,613 INFO L87 Difference]: Start difference. First operand 493 states and 796 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:07,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:15:07,729 INFO L93 Difference]: Finished difference Result 1194 states and 1922 transitions. [2024-10-11 03:15:07,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 03:15:07,730 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-10-11 03:15:07,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:15:07,734 INFO L225 Difference]: With dead ends: 1194 [2024-10-11 03:15:07,734 INFO L226 Difference]: Without dead ends: 717 [2024-10-11 03:15:07,735 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-10-11 03:15:07,736 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 463 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:15:07,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 322 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:15:07,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2024-10-11 03:15:07,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 541. [2024-10-11 03:15:07,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 538 states have (on average 1.5817843866171004) internal successors, (851), 539 states have internal predecessors, (851), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:07,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 853 transitions. [2024-10-11 03:15:07,769 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 853 transitions. Word has length 34 [2024-10-11 03:15:07,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:15:07,770 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 853 transitions. [2024-10-11 03:15:07,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:07,770 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 853 transitions. [2024-10-11 03:15:07,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-11 03:15:07,771 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:15:07,771 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] [2024-10-11 03:15:07,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 03:15:07,772 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:15:07,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:15:07,772 INFO L85 PathProgramCache]: Analyzing trace with hash 748400941, now seen corresponding path program 1 times [2024-10-11 03:15:07,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:15:07,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730897226] [2024-10-11 03:15:07,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:15:07,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:15:07,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:07,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:15:07,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:15:07,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730897226] [2024-10-11 03:15:07,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730897226] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:15:07,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:15:07,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 03:15:07,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908873692] [2024-10-11 03:15:07,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:15:07,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:15:07,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:15:07,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:15:07,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:15:07,808 INFO L87 Difference]: Start difference. First operand 541 states and 853 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:07,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:15:07,903 INFO L93 Difference]: Finished difference Result 1284 states and 2028 transitions. [2024-10-11 03:15:07,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:15:07,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-10-11 03:15:07,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:15:07,906 INFO L225 Difference]: With dead ends: 1284 [2024-10-11 03:15:07,906 INFO L226 Difference]: Without dead ends: 756 [2024-10-11 03:15:07,907 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:15:07,908 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 113 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:15:07,908 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 287 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:15:07,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2024-10-11 03:15:07,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 753. [2024-10-11 03:15:07,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 753 states, 750 states have (on average 1.56) internal successors, (1170), 751 states have internal predecessors, (1170), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:07,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 1172 transitions. [2024-10-11 03:15:07,952 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 1172 transitions. Word has length 34 [2024-10-11 03:15:07,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:15:07,953 INFO L471 AbstractCegarLoop]: Abstraction has 753 states and 1172 transitions. [2024-10-11 03:15:07,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:07,953 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 1172 transitions. [2024-10-11 03:15:07,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-11 03:15:07,954 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:15:07,954 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] [2024-10-11 03:15:07,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 03:15:07,954 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:15:07,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:15:07,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1586861811, now seen corresponding path program 1 times [2024-10-11 03:15:07,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:15:07,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506979849] [2024-10-11 03:15:07,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:15:07,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:15:07,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:07,995 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:15:07,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:15:07,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506979849] [2024-10-11 03:15:07,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506979849] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:15:07,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:15:07,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:15:07,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879081013] [2024-10-11 03:15:07,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:15:07,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:15:07,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:15:07,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:15:07,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:15:07,997 INFO L87 Difference]: Start difference. First operand 753 states and 1172 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:08,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:15:08,089 INFO L93 Difference]: Finished difference Result 1851 states and 2926 transitions. [2024-10-11 03:15:08,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:15:08,089 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2024-10-11 03:15:08,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:15:08,094 INFO L225 Difference]: With dead ends: 1851 [2024-10-11 03:15:08,094 INFO L226 Difference]: Without dead ends: 1124 [2024-10-11 03:15:08,095 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-10-11 03:15:08,096 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 78 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:15:08,096 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 381 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:15:08,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1124 states. [2024-10-11 03:15:08,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1124 to 1120. [2024-10-11 03:15:08,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1120 states, 1117 states have (on average 1.5783348254252463) internal successors, (1763), 1118 states have internal predecessors, (1763), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:08,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1120 states to 1120 states and 1765 transitions. [2024-10-11 03:15:08,159 INFO L78 Accepts]: Start accepts. Automaton has 1120 states and 1765 transitions. Word has length 45 [2024-10-11 03:15:08,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:15:08,160 INFO L471 AbstractCegarLoop]: Abstraction has 1120 states and 1765 transitions. [2024-10-11 03:15:08,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:08,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states and 1765 transitions. [2024-10-11 03:15:08,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-11 03:15:08,161 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:15:08,161 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] [2024-10-11 03:15:08,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 03:15:08,162 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:15:08,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:15:08,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1835008305, now seen corresponding path program 1 times [2024-10-11 03:15:08,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:15:08,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096234885] [2024-10-11 03:15:08,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:15:08,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:15:08,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:08,197 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 03:15:08,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:15:08,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096234885] [2024-10-11 03:15:08,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096234885] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:15:08,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:15:08,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 03:15:08,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011168400] [2024-10-11 03:15:08,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:15:08,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:15:08,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:15:08,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:15:08,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:15:08,199 INFO L87 Difference]: Start difference. First operand 1120 states and 1765 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:08,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:15:08,300 INFO L93 Difference]: Finished difference Result 2192 states and 3472 transitions. [2024-10-11 03:15:08,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:15:08,300 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2024-10-11 03:15:08,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:15:08,305 INFO L225 Difference]: With dead ends: 2192 [2024-10-11 03:15:08,305 INFO L226 Difference]: Without dead ends: 1098 [2024-10-11 03:15:08,307 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:15:08,308 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 175 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:15:08,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 168 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:15:08,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states. [2024-10-11 03:15:08,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 1098. [2024-10-11 03:15:08,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1098 states, 1095 states have (on average 1.5853881278538813) internal successors, (1736), 1096 states have internal predecessors, (1736), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:08,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1098 states to 1098 states and 1738 transitions. [2024-10-11 03:15:08,378 INFO L78 Accepts]: Start accepts. Automaton has 1098 states and 1738 transitions. Word has length 45 [2024-10-11 03:15:08,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:15:08,378 INFO L471 AbstractCegarLoop]: Abstraction has 1098 states and 1738 transitions. [2024-10-11 03:15:08,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:08,379 INFO L276 IsEmpty]: Start isEmpty. Operand 1098 states and 1738 transitions. [2024-10-11 03:15:08,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-11 03:15:08,380 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:15:08,380 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] [2024-10-11 03:15:08,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 03:15:08,380 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:15:08,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:15:08,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1916306865, now seen corresponding path program 1 times [2024-10-11 03:15:08,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:15:08,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411667422] [2024-10-11 03:15:08,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:15:08,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:15:08,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:08,416 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:15:08,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:15:08,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411667422] [2024-10-11 03:15:08,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411667422] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:15:08,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:15:08,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:15:08,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898353655] [2024-10-11 03:15:08,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:15:08,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:15:08,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:15:08,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:15:08,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:15:08,418 INFO L87 Difference]: Start difference. First operand 1098 states and 1738 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:08,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:15:08,531 INFO L93 Difference]: Finished difference Result 2787 states and 4478 transitions. [2024-10-11 03:15:08,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:15:08,532 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2024-10-11 03:15:08,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:15:08,541 INFO L225 Difference]: With dead ends: 2787 [2024-10-11 03:15:08,541 INFO L226 Difference]: Without dead ends: 1715 [2024-10-11 03:15:08,544 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-10-11 03:15:08,545 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 79 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:15:08,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 297 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:15:08,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1715 states. [2024-10-11 03:15:08,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1715 to 1711. [2024-10-11 03:15:08,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1711 states, 1708 states have (on average 1.6036299765807962) internal successors, (2739), 1709 states have internal predecessors, (2739), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:08,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1711 states to 1711 states and 2741 transitions. [2024-10-11 03:15:08,680 INFO L78 Accepts]: Start accepts. Automaton has 1711 states and 2741 transitions. Word has length 46 [2024-10-11 03:15:08,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:15:08,680 INFO L471 AbstractCegarLoop]: Abstraction has 1711 states and 2741 transitions. [2024-10-11 03:15:08,680 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:08,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1711 states and 2741 transitions. [2024-10-11 03:15:08,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-11 03:15:08,682 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:15:08,682 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-10-11 03:15:08,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 03:15:08,682 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:15:08,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:15:08,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1700668417, now seen corresponding path program 1 times [2024-10-11 03:15:08,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:15:08,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319443202] [2024-10-11 03:15:08,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:15:08,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:15:08,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:08,717 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:15:08,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:15:08,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319443202] [2024-10-11 03:15:08,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319443202] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:15:08,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:15:08,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:15:08,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266665462] [2024-10-11 03:15:08,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:15:08,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:15:08,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:15:08,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:15:08,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:15:08,719 INFO L87 Difference]: Start difference. First operand 1711 states and 2741 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:08,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:15:08,914 INFO L93 Difference]: Finished difference Result 4629 states and 7502 transitions. [2024-10-11 03:15:08,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:15:08,914 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-10-11 03:15:08,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:15:08,927 INFO L225 Difference]: With dead ends: 4629 [2024-10-11 03:15:08,927 INFO L226 Difference]: Without dead ends: 2945 [2024-10-11 03:15:08,931 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-10-11 03:15:08,931 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 84 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:15:08,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 358 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:15:08,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2945 states. [2024-10-11 03:15:09,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2945 to 2941. [2024-10-11 03:15:09,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2941 states, 2938 states have (on average 1.6143635125936011) internal successors, (4743), 2939 states have internal predecessors, (4743), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:09,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2941 states to 2941 states and 4745 transitions. [2024-10-11 03:15:09,124 INFO L78 Accepts]: Start accepts. Automaton has 2941 states and 4745 transitions. Word has length 47 [2024-10-11 03:15:09,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:15:09,125 INFO L471 AbstractCegarLoop]: Abstraction has 2941 states and 4745 transitions. [2024-10-11 03:15:09,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:09,125 INFO L276 IsEmpty]: Start isEmpty. Operand 2941 states and 4745 transitions. [2024-10-11 03:15:09,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-11 03:15:09,126 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:15:09,127 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-10-11 03:15:09,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 03:15:09,127 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:15:09,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:15:09,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1452521923, now seen corresponding path program 1 times [2024-10-11 03:15:09,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:15:09,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452263469] [2024-10-11 03:15:09,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:15:09,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:15:09,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:09,152 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 03:15:09,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:15:09,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452263469] [2024-10-11 03:15:09,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452263469] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:15:09,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:15:09,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 03:15:09,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543195903] [2024-10-11 03:15:09,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:15:09,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:15:09,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:15:09,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:15:09,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:15:09,155 INFO L87 Difference]: Start difference. First operand 2941 states and 4745 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:09,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:15:09,304 INFO L93 Difference]: Finished difference Result 5834 states and 9434 transitions. [2024-10-11 03:15:09,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:15:09,305 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-10-11 03:15:09,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:15:09,316 INFO L225 Difference]: With dead ends: 5834 [2024-10-11 03:15:09,316 INFO L226 Difference]: Without dead ends: 2920 [2024-10-11 03:15:09,320 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:15:09,321 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 172 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:15:09,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 167 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:15:09,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2920 states. [2024-10-11 03:15:09,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2920 to 2920. [2024-10-11 03:15:09,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2920 states, 2917 states have (on average 1.617415152553994) internal successors, (4718), 2918 states have internal predecessors, (4718), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:09,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2920 states to 2920 states and 4720 transitions. [2024-10-11 03:15:09,459 INFO L78 Accepts]: Start accepts. Automaton has 2920 states and 4720 transitions. Word has length 47 [2024-10-11 03:15:09,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:15:09,459 INFO L471 AbstractCegarLoop]: Abstraction has 2920 states and 4720 transitions. [2024-10-11 03:15:09,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:09,459 INFO L276 IsEmpty]: Start isEmpty. Operand 2920 states and 4720 transitions. [2024-10-11 03:15:09,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-11 03:15:09,461 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:15:09,461 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-10-11 03:15:09,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 03:15:09,461 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:15:09,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:15:09,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1012692291, now seen corresponding path program 1 times [2024-10-11 03:15:09,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:15:09,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855415999] [2024-10-11 03:15:09,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:15:09,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:15:09,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:09,539 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:15:09,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:15:09,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855415999] [2024-10-11 03:15:09,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855415999] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:15:09,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:15:09,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:15:09,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415657293] [2024-10-11 03:15:09,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:15:09,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:15:09,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:15:09,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:15:09,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:15:09,541 INFO L87 Difference]: Start difference. First operand 2920 states and 4720 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:09,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:15:09,813 INFO L93 Difference]: Finished difference Result 7399 states and 11983 transitions. [2024-10-11 03:15:09,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:15:09,814 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2024-10-11 03:15:09,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:15:09,831 INFO L225 Difference]: With dead ends: 7399 [2024-10-11 03:15:09,831 INFO L226 Difference]: Without dead ends: 3794 [2024-10-11 03:15:09,838 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-10-11 03:15:09,838 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 384 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:15:09,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 276 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:15:09,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3794 states. [2024-10-11 03:15:10,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3794 to 3794. [2024-10-11 03:15:10,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3794 states, 3791 states have (on average 1.604062252703772) internal successors, (6081), 3792 states have internal predecessors, (6081), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:10,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3794 states to 3794 states and 6083 transitions. [2024-10-11 03:15:10,069 INFO L78 Accepts]: Start accepts. Automaton has 3794 states and 6083 transitions. Word has length 48 [2024-10-11 03:15:10,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:15:10,070 INFO L471 AbstractCegarLoop]: Abstraction has 3794 states and 6083 transitions. [2024-10-11 03:15:10,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:10,070 INFO L276 IsEmpty]: Start isEmpty. Operand 3794 states and 6083 transitions. [2024-10-11 03:15:10,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-11 03:15:10,072 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:15:10,072 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] [2024-10-11 03:15:10,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 03:15:10,073 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:15:10,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:15:10,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1448872395, now seen corresponding path program 1 times [2024-10-11 03:15:10,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:15:10,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311533486] [2024-10-11 03:15:10,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:15:10,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:15:10,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:10,140 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:15:10,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:15:10,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311533486] [2024-10-11 03:15:10,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311533486] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:15:10,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:15:10,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:15:10,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021261869] [2024-10-11 03:15:10,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:15:10,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:15:10,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:15:10,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:15:10,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:15:10,142 INFO L87 Difference]: Start difference. First operand 3794 states and 6083 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:10,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:15:10,531 INFO L93 Difference]: Finished difference Result 9674 states and 15400 transitions. [2024-10-11 03:15:10,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 03:15:10,531 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-10-11 03:15:10,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:15:10,553 INFO L225 Difference]: With dead ends: 9674 [2024-10-11 03:15:10,554 INFO L226 Difference]: Without dead ends: 5901 [2024-10-11 03:15:10,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-10-11 03:15:10,559 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 660 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:15:10,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [660 Valid, 467 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:15:10,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5901 states. [2024-10-11 03:15:10,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5901 to 4438. [2024-10-11 03:15:10,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4438 states, 4435 states have (on average 1.5682074408117248) internal successors, (6955), 4436 states have internal predecessors, (6955), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:10,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4438 states to 4438 states and 6957 transitions. [2024-10-11 03:15:10,856 INFO L78 Accepts]: Start accepts. Automaton has 4438 states and 6957 transitions. Word has length 53 [2024-10-11 03:15:10,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:15:10,857 INFO L471 AbstractCegarLoop]: Abstraction has 4438 states and 6957 transitions. [2024-10-11 03:15:10,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:10,857 INFO L276 IsEmpty]: Start isEmpty. Operand 4438 states and 6957 transitions. [2024-10-11 03:15:10,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-11 03:15:10,861 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:15:10,861 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 03:15:10,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 03:15:10,861 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:15:10,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:15:10,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1622132950, now seen corresponding path program 1 times [2024-10-11 03:15:10,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:15:10,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650368584] [2024-10-11 03:15:10,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:15:10,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:15:10,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:10,907 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:15:10,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:15:10,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650368584] [2024-10-11 03:15:10,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650368584] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:15:10,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:15:10,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:15:10,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243697612] [2024-10-11 03:15:10,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:15:10,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:15:10,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:15:10,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:15:10,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:15:10,911 INFO L87 Difference]: Start difference. First operand 4438 states and 6957 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:11,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:15:11,232 INFO L93 Difference]: Finished difference Result 9188 states and 14369 transitions. [2024-10-11 03:15:11,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:15:11,232 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2024-10-11 03:15:11,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:15:11,246 INFO L225 Difference]: With dead ends: 9188 [2024-10-11 03:15:11,246 INFO L226 Difference]: Without dead ends: 4777 [2024-10-11 03:15:11,254 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-10-11 03:15:11,255 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 126 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 278 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-10-11 03:15:11,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 278 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:15:11,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4777 states. [2024-10-11 03:15:11,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4777 to 4761. [2024-10-11 03:15:11,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4761 states, 4758 states have (on average 1.5147120638923917) internal successors, (7207), 4759 states have internal predecessors, (7207), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:11,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4761 states to 4761 states and 7209 transitions. [2024-10-11 03:15:11,538 INFO L78 Accepts]: Start accepts. Automaton has 4761 states and 7209 transitions. Word has length 84 [2024-10-11 03:15:11,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:15:11,539 INFO L471 AbstractCegarLoop]: Abstraction has 4761 states and 7209 transitions. [2024-10-11 03:15:11,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:11,539 INFO L276 IsEmpty]: Start isEmpty. Operand 4761 states and 7209 transitions. [2024-10-11 03:15:11,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-11 03:15:11,544 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:15:11,544 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 03:15:11,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 03:15:11,545 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:15:11,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:15:11,546 INFO L85 PathProgramCache]: Analyzing trace with hash 35385248, now seen corresponding path program 1 times [2024-10-11 03:15:11,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:15:11,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444683353] [2024-10-11 03:15:11,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:15:11,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:15:11,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:11,583 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:15:11,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:15:11,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444683353] [2024-10-11 03:15:11,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444683353] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:15:11,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:15:11,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:15:11,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115267340] [2024-10-11 03:15:11,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:15:11,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:15:11,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:15:11,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:15:11,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:15:11,586 INFO L87 Difference]: Start difference. First operand 4761 states and 7209 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:11,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:15:11,873 INFO L93 Difference]: Finished difference Result 9986 states and 15079 transitions. [2024-10-11 03:15:11,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:15:11,874 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2024-10-11 03:15:11,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:15:11,887 INFO L225 Difference]: With dead ends: 9986 [2024-10-11 03:15:11,887 INFO L226 Difference]: Without dead ends: 5263 [2024-10-11 03:15:11,895 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-10-11 03:15:11,896 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 124 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 277 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-10-11 03:15:11,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 277 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:15:11,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5263 states. [2024-10-11 03:15:12,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5263 to 5239. [2024-10-11 03:15:12,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5239 states, 5236 states have (on average 1.4618029029793735) internal successors, (7654), 5237 states have internal predecessors, (7654), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:12,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5239 states to 5239 states and 7656 transitions. [2024-10-11 03:15:12,212 INFO L78 Accepts]: Start accepts. Automaton has 5239 states and 7656 transitions. Word has length 85 [2024-10-11 03:15:12,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:15:12,212 INFO L471 AbstractCegarLoop]: Abstraction has 5239 states and 7656 transitions. [2024-10-11 03:15:12,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:12,213 INFO L276 IsEmpty]: Start isEmpty. Operand 5239 states and 7656 transitions. [2024-10-11 03:15:12,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-11 03:15:12,217 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:15:12,217 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 03:15:12,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 03:15:12,218 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:15:12,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:15:12,218 INFO L85 PathProgramCache]: Analyzing trace with hash -834777524, now seen corresponding path program 1 times [2024-10-11 03:15:12,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:15:12,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524877941] [2024-10-11 03:15:12,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:15:12,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:15:12,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:12,249 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:15:12,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:15:12,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524877941] [2024-10-11 03:15:12,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524877941] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:15:12,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:15:12,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:15:12,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095736837] [2024-10-11 03:15:12,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:15:12,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:15:12,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:15:12,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:15:12,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:15:12,251 INFO L87 Difference]: Start difference. First operand 5239 states and 7656 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:12,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:15:12,641 INFO L93 Difference]: Finished difference Result 10795 states and 15773 transitions. [2024-10-11 03:15:12,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:15:12,642 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2024-10-11 03:15:12,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:15:12,656 INFO L225 Difference]: With dead ends: 10795 [2024-10-11 03:15:12,656 INFO L226 Difference]: Without dead ends: 5612 [2024-10-11 03:15:12,664 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-10-11 03:15:12,665 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 119 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:15:12,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 278 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:15:12,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5612 states. [2024-10-11 03:15:13,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5612 to 5022. [2024-10-11 03:15:13,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5022 states, 5019 states have (on average 1.3980872683801555) internal successors, (7017), 5020 states have internal predecessors, (7017), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:13,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5022 states to 5022 states and 7019 transitions. [2024-10-11 03:15:13,077 INFO L78 Accepts]: Start accepts. Automaton has 5022 states and 7019 transitions. Word has length 86 [2024-10-11 03:15:13,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:15:13,078 INFO L471 AbstractCegarLoop]: Abstraction has 5022 states and 7019 transitions. [2024-10-11 03:15:13,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:13,078 INFO L276 IsEmpty]: Start isEmpty. Operand 5022 states and 7019 transitions. [2024-10-11 03:15:13,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-11 03:15:13,085 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:15:13,085 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 03:15:13,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 03:15:13,086 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:15:13,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:15:13,087 INFO L85 PathProgramCache]: Analyzing trace with hash -677566338, now seen corresponding path program 1 times [2024-10-11 03:15:13,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:15:13,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572804738] [2024-10-11 03:15:13,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:15:13,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:15:13,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:13,162 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 03:15:13,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:15:13,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572804738] [2024-10-11 03:15:13,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572804738] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:15:13,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:15:13,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:15:13,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381388784] [2024-10-11 03:15:13,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:15:13,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:15:13,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:15:13,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:15:13,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:15:13,165 INFO L87 Difference]: Start difference. First operand 5022 states and 7019 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:13,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:15:13,619 INFO L93 Difference]: Finished difference Result 9338 states and 12971 transitions. [2024-10-11 03:15:13,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:15:13,620 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2024-10-11 03:15:13,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:15:13,634 INFO L225 Difference]: With dead ends: 9338 [2024-10-11 03:15:13,634 INFO L226 Difference]: Without dead ends: 4803 [2024-10-11 03:15:13,641 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-10-11 03:15:13,642 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 412 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:15:13,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 401 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:15:13,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4803 states. [2024-10-11 03:15:13,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4803 to 4703. [2024-10-11 03:15:13,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4703 states, 4700 states have (on average 1.3419148936170213) internal successors, (6307), 4701 states have internal predecessors, (6307), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:13,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4703 states to 4703 states and 6309 transitions. [2024-10-11 03:15:13,909 INFO L78 Accepts]: Start accepts. Automaton has 4703 states and 6309 transitions. Word has length 87 [2024-10-11 03:15:13,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:15:13,909 INFO L471 AbstractCegarLoop]: Abstraction has 4703 states and 6309 transitions. [2024-10-11 03:15:13,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:13,910 INFO L276 IsEmpty]: Start isEmpty. Operand 4703 states and 6309 transitions. [2024-10-11 03:15:13,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-11 03:15:13,921 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:15:13,921 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 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] [2024-10-11 03:15:13,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 03:15:13,922 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:15:13,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:15:13,922 INFO L85 PathProgramCache]: Analyzing trace with hash -833046779, now seen corresponding path program 1 times [2024-10-11 03:15:13,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:15:13,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577313204] [2024-10-11 03:15:13,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:15:13,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:15:13,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:13,969 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 03:15:13,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:15:13,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577313204] [2024-10-11 03:15:13,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577313204] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:15:13,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:15:13,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 03:15:13,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197397710] [2024-10-11 03:15:13,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:15:13,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:15:13,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:15:13,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:15:13,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:15:13,972 INFO L87 Difference]: Start difference. First operand 4703 states and 6309 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:14,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:15:14,258 INFO L93 Difference]: Finished difference Result 8961 states and 12015 transitions. [2024-10-11 03:15:14,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:15:14,259 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2024-10-11 03:15:14,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:15:14,270 INFO L225 Difference]: With dead ends: 8961 [2024-10-11 03:15:14,270 INFO L226 Difference]: Without dead ends: 4653 [2024-10-11 03:15:14,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:15:14,277 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 33 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:15:14,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 277 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:15:14,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4653 states. [2024-10-11 03:15:14,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4653 to 4653. [2024-10-11 03:15:14,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4653 states, 4650 states have (on average 1.3344086021505377) internal successors, (6205), 4651 states have internal predecessors, (6205), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:14,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4653 states to 4653 states and 6207 transitions. [2024-10-11 03:15:14,548 INFO L78 Accepts]: Start accepts. Automaton has 4653 states and 6207 transitions. Word has length 113 [2024-10-11 03:15:14,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:15:14,548 INFO L471 AbstractCegarLoop]: Abstraction has 4653 states and 6207 transitions. [2024-10-11 03:15:14,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:14,548 INFO L276 IsEmpty]: Start isEmpty. Operand 4653 states and 6207 transitions. [2024-10-11 03:15:14,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-11 03:15:14,559 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:15:14,559 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:15:14,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 03:15:14,560 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:15:14,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:15:14,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1125314297, now seen corresponding path program 1 times [2024-10-11 03:15:14,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:15:14,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582683115] [2024-10-11 03:15:14,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:15:14,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:15:14,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:14,654 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 03:15:14,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:15:14,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582683115] [2024-10-11 03:15:14,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582683115] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:15:14,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:15:14,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:15:14,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922725450] [2024-10-11 03:15:14,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:15:14,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:15:14,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:15:14,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:15:14,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:15:14,656 INFO L87 Difference]: Start difference. First operand 4653 states and 6207 transitions. Second operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:14,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:15:14,964 INFO L93 Difference]: Finished difference Result 8253 states and 11041 transitions. [2024-10-11 03:15:14,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:15:14,965 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 125 [2024-10-11 03:15:14,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:15:14,975 INFO L225 Difference]: With dead ends: 8253 [2024-10-11 03:15:14,975 INFO L226 Difference]: Without dead ends: 4579 [2024-10-11 03:15:14,979 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-10-11 03:15:14,979 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 295 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:15:14,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 283 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:15:14,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4579 states. [2024-10-11 03:15:15,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4579 to 4575. [2024-10-11 03:15:15,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4575 states, 4572 states have (on average 1.3097112860892388) internal successors, (5988), 4573 states have internal predecessors, (5988), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:15,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4575 states to 4575 states and 5990 transitions. [2024-10-11 03:15:15,243 INFO L78 Accepts]: Start accepts. Automaton has 4575 states and 5990 transitions. Word has length 125 [2024-10-11 03:15:15,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:15:15,243 INFO L471 AbstractCegarLoop]: Abstraction has 4575 states and 5990 transitions. [2024-10-11 03:15:15,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:15,244 INFO L276 IsEmpty]: Start isEmpty. Operand 4575 states and 5990 transitions. [2024-10-11 03:15:15,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 03:15:15,252 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:15:15,253 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:15:15,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 03:15:15,253 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:15:15,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:15:15,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1269120039, now seen corresponding path program 1 times [2024-10-11 03:15:15,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:15:15,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148725783] [2024-10-11 03:15:15,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:15:15,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:15:15,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:15,298 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-11 03:15:15,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:15:15,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148725783] [2024-10-11 03:15:15,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148725783] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:15:15,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:15:15,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 03:15:15,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479021393] [2024-10-11 03:15:15,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:15:15,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:15:15,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:15:15,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:15:15,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:15:15,300 INFO L87 Difference]: Start difference. First operand 4575 states and 5990 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:15,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:15:15,558 INFO L93 Difference]: Finished difference Result 8738 states and 11439 transitions. [2024-10-11 03:15:15,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:15:15,558 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 131 [2024-10-11 03:15:15,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:15:15,569 INFO L225 Difference]: With dead ends: 8738 [2024-10-11 03:15:15,569 INFO L226 Difference]: Without dead ends: 4557 [2024-10-11 03:15:15,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:15:15,575 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 23 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:15:15,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 275 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:15:15,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4557 states. [2024-10-11 03:15:15,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4557 to 4537. [2024-10-11 03:15:15,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4537 states, 4534 states have (on average 1.3030436700485222) internal successors, (5908), 4535 states have internal predecessors, (5908), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:15,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4537 states to 4537 states and 5910 transitions. [2024-10-11 03:15:15,992 INFO L78 Accepts]: Start accepts. Automaton has 4537 states and 5910 transitions. Word has length 131 [2024-10-11 03:15:15,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:15:15,992 INFO L471 AbstractCegarLoop]: Abstraction has 4537 states and 5910 transitions. [2024-10-11 03:15:15,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:15,993 INFO L276 IsEmpty]: Start isEmpty. Operand 4537 states and 5910 transitions. [2024-10-11 03:15:16,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 03:15:16,003 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:15:16,003 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:15:16,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-11 03:15:16,003 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:15:16,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:15:16,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1794258707, now seen corresponding path program 1 times [2024-10-11 03:15:16,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:15:16,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262169017] [2024-10-11 03:15:16,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:15:16,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:15:16,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:16,063 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-11 03:15:16,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:15:16,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262169017] [2024-10-11 03:15:16,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262169017] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:15:16,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:15:16,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 03:15:16,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517750940] [2024-10-11 03:15:16,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:15:16,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:15:16,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:15:16,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:15:16,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:15:16,068 INFO L87 Difference]: Start difference. First operand 4537 states and 5910 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:16,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:15:16,444 INFO L93 Difference]: Finished difference Result 8688 states and 11319 transitions. [2024-10-11 03:15:16,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:15:16,445 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 131 [2024-10-11 03:15:16,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:15:16,456 INFO L225 Difference]: With dead ends: 8688 [2024-10-11 03:15:16,457 INFO L226 Difference]: Without dead ends: 4527 [2024-10-11 03:15:16,464 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:15:16,464 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 19 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:15:16,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 272 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:15:16,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4527 states. [2024-10-11 03:15:16,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4527 to 4507. [2024-10-11 03:15:16,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4507 states, 4504 states have (on average 1.2959591474245116) internal successors, (5837), 4505 states have internal predecessors, (5837), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:16,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4507 states to 4507 states and 5839 transitions. [2024-10-11 03:15:16,811 INFO L78 Accepts]: Start accepts. Automaton has 4507 states and 5839 transitions. Word has length 131 [2024-10-11 03:15:16,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:15:16,811 INFO L471 AbstractCegarLoop]: Abstraction has 4507 states and 5839 transitions. [2024-10-11 03:15:16,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:16,812 INFO L276 IsEmpty]: Start isEmpty. Operand 4507 states and 5839 transitions. [2024-10-11 03:15:16,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-11 03:15:16,820 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:15:16,820 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 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-10-11 03:15:16,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-11 03:15:16,820 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:15:16,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:15:16,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1338781053, now seen corresponding path program 1 times [2024-10-11 03:15:16,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:15:16,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109295377] [2024-10-11 03:15:16,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:15:16,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:15:16,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:16,913 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-11 03:15:16,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:15:16,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109295377] [2024-10-11 03:15:16,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109295377] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:15:16,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:15:16,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:15:16,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338937604] [2024-10-11 03:15:16,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:15:16,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:15:16,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:15:16,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:15:16,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:15:16,915 INFO L87 Difference]: Start difference. First operand 4507 states and 5839 transitions. Second operand has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:17,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:15:17,128 INFO L93 Difference]: Finished difference Result 7346 states and 9569 transitions. [2024-10-11 03:15:17,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:15:17,128 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2024-10-11 03:15:17,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:15:17,144 INFO L225 Difference]: With dead ends: 7346 [2024-10-11 03:15:17,144 INFO L226 Difference]: Without dead ends: 3215 [2024-10-11 03:15:17,155 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-10-11 03:15:17,155 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 269 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:15:17,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 258 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:15:17,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3215 states. [2024-10-11 03:15:17,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3215 to 3211. [2024-10-11 03:15:17,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3211 states, 3208 states have (on average 1.263715710723192) internal successors, (4054), 3209 states have internal predecessors, (4054), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:17,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3211 states to 3211 states and 4056 transitions. [2024-10-11 03:15:17,351 INFO L78 Accepts]: Start accepts. Automaton has 3211 states and 4056 transitions. Word has length 134 [2024-10-11 03:15:17,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:15:17,351 INFO L471 AbstractCegarLoop]: Abstraction has 3211 states and 4056 transitions. [2024-10-11 03:15:17,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:17,352 INFO L276 IsEmpty]: Start isEmpty. Operand 3211 states and 4056 transitions. [2024-10-11 03:15:17,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-11 03:15:17,356 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:15:17,357 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 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-10-11 03:15:17,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-11 03:15:17,357 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:15:17,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:15:17,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1962216896, now seen corresponding path program 1 times [2024-10-11 03:15:17,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:15:17,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763638280] [2024-10-11 03:15:17,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:15:17,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:15:17,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:17,445 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 03:15:17,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:15:17,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763638280] [2024-10-11 03:15:17,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763638280] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:15:17,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:15:17,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:15:17,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224885819] [2024-10-11 03:15:17,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:15:17,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 03:15:17,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:15:17,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 03:15:17,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 03:15:17,447 INFO L87 Difference]: Start difference. First operand 3211 states and 4056 transitions. Second operand has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:17,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:15:17,609 INFO L93 Difference]: Finished difference Result 5198 states and 6572 transitions. [2024-10-11 03:15:17,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:15:17,610 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2024-10-11 03:15:17,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:15:17,616 INFO L225 Difference]: With dead ends: 5198 [2024-10-11 03:15:17,616 INFO L226 Difference]: Without dead ends: 2060 [2024-10-11 03:15:17,620 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-10-11 03:15:17,622 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 271 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:15:17,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 253 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:15:17,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2060 states. [2024-10-11 03:15:17,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2060 to 2056. [2024-10-11 03:15:17,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2056 states, 2053 states have (on average 1.230881636629323) internal successors, (2527), 2054 states have internal predecessors, (2527), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:17,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2056 states to 2056 states and 2529 transitions. [2024-10-11 03:15:17,740 INFO L78 Accepts]: Start accepts. Automaton has 2056 states and 2529 transitions. Word has length 134 [2024-10-11 03:15:17,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:15:17,740 INFO L471 AbstractCegarLoop]: Abstraction has 2056 states and 2529 transitions. [2024-10-11 03:15:17,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:17,741 INFO L276 IsEmpty]: Start isEmpty. Operand 2056 states and 2529 transitions. [2024-10-11 03:15:17,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-11 03:15:17,743 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:15:17,743 INFO L215 NwaCegarLoop]: trace histogram [6, 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] [2024-10-11 03:15:17,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-11 03:15:17,744 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:15:17,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:15:17,745 INFO L85 PathProgramCache]: Analyzing trace with hash -2145844268, now seen corresponding path program 1 times [2024-10-11 03:15:17,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:15:17,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703960758] [2024-10-11 03:15:17,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:15:17,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:15:17,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:17,798 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-10-11 03:15:17,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:15:17,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703960758] [2024-10-11 03:15:17,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703960758] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:15:17,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:15:17,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:15:17,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190993468] [2024-10-11 03:15:17,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:15:17,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:15:17,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:15:17,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:15:17,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:15:17,800 INFO L87 Difference]: Start difference. First operand 2056 states and 2529 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:17,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:15:17,928 INFO L93 Difference]: Finished difference Result 3704 states and 4596 transitions. [2024-10-11 03:15:17,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:15:17,929 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 172 [2024-10-11 03:15:17,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:15:17,935 INFO L225 Difference]: With dead ends: 3704 [2024-10-11 03:15:17,935 INFO L226 Difference]: Without dead ends: 1994 [2024-10-11 03:15:17,940 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-10-11 03:15:17,940 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 1 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:15:17,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 275 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:15:17,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1994 states. [2024-10-11 03:15:18,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1994 to 1926. [2024-10-11 03:15:18,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1926 states, 1923 states have (on average 1.2111284451378055) internal successors, (2329), 1924 states have internal predecessors, (2329), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:18,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1926 states to 1926 states and 2331 transitions. [2024-10-11 03:15:18,052 INFO L78 Accepts]: Start accepts. Automaton has 1926 states and 2331 transitions. Word has length 172 [2024-10-11 03:15:18,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:15:18,052 INFO L471 AbstractCegarLoop]: Abstraction has 1926 states and 2331 transitions. [2024-10-11 03:15:18,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:18,053 INFO L276 IsEmpty]: Start isEmpty. Operand 1926 states and 2331 transitions. [2024-10-11 03:15:18,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-10-11 03:15:18,055 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:15:18,055 INFO L215 NwaCegarLoop]: trace histogram [6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 03:15:18,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-11 03:15:18,056 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:15:18,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:15:18,056 INFO L85 PathProgramCache]: Analyzing trace with hash -857419627, now seen corresponding path program 1 times [2024-10-11 03:15:18,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:15:18,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519880297] [2024-10-11 03:15:18,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:15:18,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:15:18,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:18,102 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 03:15:18,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:15:18,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519880297] [2024-10-11 03:15:18,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519880297] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:15:18,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:15:18,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:15:18,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235186516] [2024-10-11 03:15:18,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:15:18,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:15:18,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:15:18,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:15:18,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:15:18,105 INFO L87 Difference]: Start difference. First operand 1926 states and 2331 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:18,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:15:18,263 INFO L93 Difference]: Finished difference Result 4141 states and 5050 transitions. [2024-10-11 03:15:18,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:15:18,264 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 178 [2024-10-11 03:15:18,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:15:18,271 INFO L225 Difference]: With dead ends: 4141 [2024-10-11 03:15:18,272 INFO L226 Difference]: Without dead ends: 2557 [2024-10-11 03:15:18,274 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-10-11 03:15:18,274 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 138 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 275 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-10-11 03:15:18,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 275 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:15:18,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2557 states. [2024-10-11 03:15:18,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2557 to 2208. [2024-10-11 03:15:18,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2208 states, 2205 states have (on average 1.1941043083900227) internal successors, (2633), 2206 states have internal predecessors, (2633), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:18,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2208 states to 2208 states and 2635 transitions. [2024-10-11 03:15:18,423 INFO L78 Accepts]: Start accepts. Automaton has 2208 states and 2635 transitions. Word has length 178 [2024-10-11 03:15:18,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:15:18,423 INFO L471 AbstractCegarLoop]: Abstraction has 2208 states and 2635 transitions. [2024-10-11 03:15:18,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:18,423 INFO L276 IsEmpty]: Start isEmpty. Operand 2208 states and 2635 transitions. [2024-10-11 03:15:18,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-10-11 03:15:18,425 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:15:18,425 INFO L215 NwaCegarLoop]: trace histogram [6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 03:15:18,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-11 03:15:18,426 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:15:18,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:15:18,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1617142607, now seen corresponding path program 1 times [2024-10-11 03:15:18,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:15:18,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681289644] [2024-10-11 03:15:18,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:15:18,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:15:18,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:18,477 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-10-11 03:15:18,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:15:18,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681289644] [2024-10-11 03:15:18,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681289644] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:15:18,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:15:18,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:15:18,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020787106] [2024-10-11 03:15:18,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:15:18,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:15:18,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:15:18,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:15:18,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:15:18,480 INFO L87 Difference]: Start difference. First operand 2208 states and 2635 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:18,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:15:18,614 INFO L93 Difference]: Finished difference Result 4041 states and 4853 transitions. [2024-10-11 03:15:18,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:15:18,614 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 181 [2024-10-11 03:15:18,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:15:18,621 INFO L225 Difference]: With dead ends: 4041 [2024-10-11 03:15:18,621 INFO L226 Difference]: Without dead ends: 2208 [2024-10-11 03:15:18,625 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-10-11 03:15:18,625 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:15:18,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 281 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:15:18,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2208 states. [2024-10-11 03:15:18,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2208 to 2208. [2024-10-11 03:15:18,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2208 states, 2205 states have (on average 1.1931972789115646) internal successors, (2631), 2206 states have internal predecessors, (2631), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:18,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2208 states to 2208 states and 2633 transitions. [2024-10-11 03:15:18,748 INFO L78 Accepts]: Start accepts. Automaton has 2208 states and 2633 transitions. Word has length 181 [2024-10-11 03:15:18,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:15:18,749 INFO L471 AbstractCegarLoop]: Abstraction has 2208 states and 2633 transitions. [2024-10-11 03:15:18,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:18,750 INFO L276 IsEmpty]: Start isEmpty. Operand 2208 states and 2633 transitions. [2024-10-11 03:15:18,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-10-11 03:15:18,752 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:15:18,752 INFO L215 NwaCegarLoop]: trace histogram [6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 03:15:18,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-11 03:15:18,753 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:15:18,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:15:18,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1632661325, now seen corresponding path program 1 times [2024-10-11 03:15:18,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:15:18,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63979516] [2024-10-11 03:15:18,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:15:18,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:15:18,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:18,808 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-10-11 03:15:18,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:15:18,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63979516] [2024-10-11 03:15:18,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63979516] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:15:18,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:15:18,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:15:18,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508145177] [2024-10-11 03:15:18,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:15:18,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:15:18,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:15:18,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:15:18,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:15:18,811 INFO L87 Difference]: Start difference. First operand 2208 states and 2633 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:18,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:15:18,915 INFO L93 Difference]: Finished difference Result 3149 states and 3765 transitions. [2024-10-11 03:15:18,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:15:18,915 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 181 [2024-10-11 03:15:18,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:15:18,922 INFO L225 Difference]: With dead ends: 3149 [2024-10-11 03:15:18,922 INFO L226 Difference]: Without dead ends: 1316 [2024-10-11 03:15:18,924 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-10-11 03:15:18,925 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 3 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:15:18,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 284 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:15:18,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1316 states. [2024-10-11 03:15:19,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1316 to 1316. [2024-10-11 03:15:19,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1316 states, 1313 states have (on average 1.175932977913176) internal successors, (1544), 1314 states have internal predecessors, (1544), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:19,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 1546 transitions. [2024-10-11 03:15:19,014 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 1546 transitions. Word has length 181 [2024-10-11 03:15:19,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:15:19,014 INFO L471 AbstractCegarLoop]: Abstraction has 1316 states and 1546 transitions. [2024-10-11 03:15:19,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:19,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 1546 transitions. [2024-10-11 03:15:19,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-10-11 03:15:19,016 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:15:19,017 INFO L215 NwaCegarLoop]: trace histogram [6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 03:15:19,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-11 03:15:19,017 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:15:19,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:15:19,018 INFO L85 PathProgramCache]: Analyzing trace with hash -418322673, now seen corresponding path program 1 times [2024-10-11 03:15:19,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:15:19,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993660998] [2024-10-11 03:15:19,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:15:19,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:15:19,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:19,069 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-10-11 03:15:19,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:15:19,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993660998] [2024-10-11 03:15:19,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993660998] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:15:19,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:15:19,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 03:15:19,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946035263] [2024-10-11 03:15:19,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:15:19,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 03:15:19,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:15:19,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 03:15:19,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 03:15:19,072 INFO L87 Difference]: Start difference. First operand 1316 states and 1546 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:19,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:15:19,168 INFO L93 Difference]: Finished difference Result 1321 states and 1552 transitions. [2024-10-11 03:15:19,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 03:15:19,169 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 181 [2024-10-11 03:15:19,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:15:19,174 INFO L225 Difference]: With dead ends: 1321 [2024-10-11 03:15:19,175 INFO L226 Difference]: Without dead ends: 1318 [2024-10-11 03:15:19,175 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-10-11 03:15:19,176 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 0 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:15:19,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 277 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 03:15:19,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1318 states. [2024-10-11 03:15:19,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1318 to 1318. [2024-10-11 03:15:19,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1318 states, 1315 states have (on average 1.1756653992395438) internal successors, (1546), 1316 states have internal predecessors, (1546), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:19,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1318 states to 1318 states and 1548 transitions. [2024-10-11 03:15:19,267 INFO L78 Accepts]: Start accepts. Automaton has 1318 states and 1548 transitions. Word has length 181 [2024-10-11 03:15:19,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:15:19,268 INFO L471 AbstractCegarLoop]: Abstraction has 1318 states and 1548 transitions. [2024-10-11 03:15:19,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:19,268 INFO L276 IsEmpty]: Start isEmpty. Operand 1318 states and 1548 transitions. [2024-10-11 03:15:19,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-10-11 03:15:19,270 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:15:19,270 INFO L215 NwaCegarLoop]: trace histogram [6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 03:15:19,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-11 03:15:19,273 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:15:19,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:15:19,274 INFO L85 PathProgramCache]: Analyzing trace with hash -418269880, now seen corresponding path program 1 times [2024-10-11 03:15:19,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:15:19,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174741819] [2024-10-11 03:15:19,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:15:19,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:15:19,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:19,720 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 95 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-11 03:15:19,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:15:19,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174741819] [2024-10-11 03:15:19,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174741819] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:15:19,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167582318] [2024-10-11 03:15:19,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:15:19,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:15:19,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:15:19,723 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:15:19,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 03:15:19,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:15:19,845 INFO L255 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-11 03:15:19,857 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:15:20,184 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 80 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-11 03:15:20,185 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:15:20,778 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 80 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-11 03:15:20,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1167582318] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:15:20,779 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:15:20,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 27 [2024-10-11 03:15:20,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217109941] [2024-10-11 03:15:20,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:15:20,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-11 03:15:20,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:15:20,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-11 03:15:20,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=623, Unknown=0, NotChecked=0, Total=702 [2024-10-11 03:15:20,782 INFO L87 Difference]: Start difference. First operand 1318 states and 1548 transitions. Second operand has 27 states, 27 states have (on average 16.333333333333332) internal successors, (441), 27 states have internal predecessors, (441), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:23,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:15:23,384 INFO L93 Difference]: Finished difference Result 4854 states and 5631 transitions. [2024-10-11 03:15:23,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2024-10-11 03:15:23,385 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 16.333333333333332) internal successors, (441), 27 states have internal predecessors, (441), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 181 [2024-10-11 03:15:23,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:15:23,396 INFO L225 Difference]: With dead ends: 4854 [2024-10-11 03:15:23,397 INFO L226 Difference]: Without dead ends: 3865 [2024-10-11 03:15:23,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 366 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1544 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=751, Invalid=5891, Unknown=0, NotChecked=0, Total=6642 [2024-10-11 03:15:23,403 INFO L432 NwaCegarLoop]: 492 mSDtfsCounter, 3311 mSDsluCounter, 7339 mSDsCounter, 0 mSdLazyCounter, 1346 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3311 SdHoareTripleChecker+Valid, 7831 SdHoareTripleChecker+Invalid, 1428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 03:15:23,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3311 Valid, 7831 Invalid, 1428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1346 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 03:15:23,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3865 states. [2024-10-11 03:15:23,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3865 to 1739. [2024-10-11 03:15:23,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1739 states, 1736 states have (on average 1.168778801843318) internal successors, (2029), 1737 states have internal predecessors, (2029), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:23,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1739 states to 1739 states and 2031 transitions. [2024-10-11 03:15:23,540 INFO L78 Accepts]: Start accepts. Automaton has 1739 states and 2031 transitions. Word has length 181 [2024-10-11 03:15:23,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:15:23,541 INFO L471 AbstractCegarLoop]: Abstraction has 1739 states and 2031 transitions. [2024-10-11 03:15:23,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 16.333333333333332) internal successors, (441), 27 states have internal predecessors, (441), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:15:23,541 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2031 transitions. [2024-10-11 03:15:23,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-10-11 03:15:23,544 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:15:23,544 INFO L215 NwaCegarLoop]: trace histogram [6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 03:15:23,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 03:15:23,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2024-10-11 03:15:23,749 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:15:23,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:15:23,749 INFO L85 PathProgramCache]: Analyzing trace with hash -81898887, now seen corresponding path program 1 times [2024-10-11 03:15:23,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:15:23,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809408979] [2024-10-11 03:15:23,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:15:23,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:15:23,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 03:15:23,768 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 03:15:23,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 03:15:23,845 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 03:15:23,845 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 03:15:23,846 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 03:15:23,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-10-11 03:15:23,850 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-10-11 03:15:24,002 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 03:15:24,004 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 03:15:24 BoogieIcfgContainer [2024-10-11 03:15:24,004 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 03:15:24,005 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 03:15:24,005 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 03:15:24,005 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 03:15:24,005 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:15:04" (3/4) ... [2024-10-11 03:15:24,006 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-11 03:15:24,143 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 03:15:24,143 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 03:15:24,144 INFO L158 Benchmark]: Toolchain (without parser) took 20310.82ms. Allocated memory was 159.4MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 103.2MB in the beginning and 863.8MB in the end (delta: -760.6MB). Peak memory consumption was 588.0MB. Max. memory is 16.1GB. [2024-10-11 03:15:24,144 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 159.4MB. Free memory is still 118.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 03:15:24,144 INFO L158 Benchmark]: CACSL2BoogieTranslator took 395.42ms. Allocated memory is still 159.4MB. Free memory was 102.8MB in the beginning and 86.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 03:15:24,145 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.59ms. Allocated memory is still 159.4MB. Free memory was 86.0MB in the beginning and 83.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 03:15:24,145 INFO L158 Benchmark]: Boogie Preprocessor took 60.68ms. Allocated memory is still 159.4MB. Free memory was 83.6MB in the beginning and 80.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 03:15:24,145 INFO L158 Benchmark]: RCFGBuilder took 663.48ms. Allocated memory was 159.4MB in the beginning and 220.2MB in the end (delta: 60.8MB). Free memory was 80.5MB in the beginning and 173.4MB in the end (delta: -92.9MB). Peak memory consumption was 23.2MB. Max. memory is 16.1GB. [2024-10-11 03:15:24,145 INFO L158 Benchmark]: TraceAbstraction took 19003.95ms. Allocated memory was 220.2MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 172.4MB in the beginning and 892.1MB in the end (delta: -719.7MB). Peak memory consumption was 564.8MB. Max. memory is 16.1GB. [2024-10-11 03:15:24,145 INFO L158 Benchmark]: Witness Printer took 138.29ms. Allocated memory is still 1.5GB. Free memory was 892.1MB in the beginning and 863.8MB in the end (delta: 28.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-11 03:15:24,146 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 159.4MB. Free memory is still 118.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 395.42ms. Allocated memory is still 159.4MB. Free memory was 102.8MB in the beginning and 86.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.59ms. Allocated memory is still 159.4MB. Free memory was 86.0MB in the beginning and 83.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.68ms. Allocated memory is still 159.4MB. Free memory was 83.6MB in the beginning and 80.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 663.48ms. Allocated memory was 159.4MB in the beginning and 220.2MB in the end (delta: 60.8MB). Free memory was 80.5MB in the beginning and 173.4MB in the end (delta: -92.9MB). Peak memory consumption was 23.2MB. Max. memory is 16.1GB. * TraceAbstraction took 19003.95ms. Allocated memory was 220.2MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 172.4MB in the beginning and 892.1MB in the end (delta: -719.7MB). Peak memory consumption was 564.8MB. Max. memory is 16.1GB. * Witness Printer took 138.29ms. Allocated memory is still 1.5GB. Free memory was 892.1MB in the beginning and 863.8MB in the end (delta: 28.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 23]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L28] int c ; [L29] int c_t ; [L30] int c_req_up ; [L31] int p_in ; [L32] int p_out ; [L33] int wl_st ; [L34] int c1_st ; [L35] int c2_st ; [L36] int wb_st ; [L37] int r_st ; [L38] int wl_i ; [L39] int c1_i ; [L40] int c2_i ; [L41] int wb_i ; [L42] int r_i ; [L43] int wl_pc ; [L44] int c1_pc ; [L45] int c2_pc ; [L46] int wb_pc ; [L47] int e_e ; [L48] int e_f ; [L49] int e_g ; [L50] int e_c ; [L51] int e_p_in ; [L52] int e_wl ; [L58] int d ; [L59] int data ; [L60] int processed ; [L61] static int t_b ; [L701] int __retres1 ; [L705] e_wl = 2 [L706] e_c = e_wl [L707] e_g = e_c [L708] e_f = e_g [L709] e_e = e_f [L710] wl_pc = 0 [L711] c1_pc = 0 [L712] c2_pc = 0 [L713] wb_pc = 0 [L714] wb_i = 1 [L715] c2_i = wb_i [L716] c1_i = c2_i [L717] wl_i = c1_i [L718] r_i = 0 [L719] c_req_up = 0 [L720] d = 0 [L721] c = 0 [L722] CALL start_simulation() [L412] int kernel_st ; [L415] kernel_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L416] COND FALSE !((int )c_req_up == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L427] COND TRUE (int )wl_i == 1 [L428] wl_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L432] COND TRUE (int )c1_i == 1 [L433] c1_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L437] COND TRUE (int )c2_i == 1 [L438] c2_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L442] COND TRUE (int )wb_i == 1 [L443] wb_st = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L447] COND FALSE !((int )r_i == 1) [L450] r_st = 2 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L452] COND FALSE !((int )e_f == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L457] COND FALSE !((int )e_g == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L462] COND FALSE !((int )e_e == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L467] COND FALSE !((int )e_c == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L472] COND FALSE !((int )e_wl == 0) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L477] COND FALSE !((int )wl_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L485] COND FALSE !((int )wl_pc == 2) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L495] COND FALSE !((int )c1_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L504] COND FALSE !((int )c2_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L513] COND FALSE !((int )wb_pc == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L522] COND FALSE !((int )e_c == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L527] COND FALSE !((int )e_e == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L532] COND FALSE !((int )e_f == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L537] COND FALSE !((int )e_g == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L542] COND FALSE !((int )e_c == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L547] COND FALSE !((int )e_wl == 1) VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L553] COND TRUE 1 [L556] kernel_st = 1 [L557] CALL eval() [L298] int tmp ; [L299] int tmp___0 ; [L300] int tmp___1 ; [L301] int tmp___2 ; [L302] int tmp___3 ; VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L306] COND TRUE 1 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L308] COND TRUE (int )wl_st == 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=0] [L329] COND TRUE (int )wl_st == 0 [L331] tmp = __VERIFIER_nondet_int() [L333] COND TRUE \read(tmp) [L335] wl_st = 1 [L336] CALL write_loop() [L63] int t ; VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=1] [L66] COND TRUE (int )wl_pc == 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=0, wl_st=1] [L80] wl_st = 2 [L81] wl_pc = 1 [L82] e_wl = 0 VAL [c1_i=1, c1_pc=0, c1_st=0, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L336] RET write_loop() [L344] COND TRUE (int )c1_st == 0 [L346] tmp___0 = __VERIFIER_nondet_int() [L348] COND TRUE \read(tmp___0) [L350] c1_st = 1 [L351] CALL compute1() [L149] COND TRUE (int )c1_pc == 0 VAL [c1_i=1, c1_pc=0, c1_st=1, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L160] COND TRUE 1 [L162] c1_st = 2 [L163] c1_pc = 1 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=0, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L351] RET compute1() [L359] COND TRUE (int )c2_st == 0 [L361] tmp___1 = __VERIFIER_nondet_int() [L363] COND TRUE \read(tmp___1) [L365] c2_st = 1 [L366] CALL compute2() [L194] COND TRUE (int )c2_pc == 0 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=0, c2_st=1, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L205] COND TRUE 1 [L207] c2_st = 2 [L208] c2_pc = 1 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=0, wl_i=1, wl_pc=1, wl_st=2] [L366] RET compute2() [L374] COND TRUE (int )wb_st == 0 [L376] tmp___2 = __VERIFIER_nondet_int() [L378] COND TRUE \read(tmp___2) [L380] wb_st = 1 [L381] CALL write_back() [L239] COND TRUE (int )wb_pc == 0 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=0, wb_st=1, wl_i=1, wl_pc=1, wl_st=2] [L250] COND TRUE 1 [L252] wb_st = 2 [L253] wb_pc = 1 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L381] RET write_back() [L389] COND FALSE !((int )r_st == 0) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L306] COND TRUE 1 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L308] COND FALSE !((int )wl_st == 0) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L311] COND FALSE !((int )c1_st == 0) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L314] COND FALSE !((int )c2_st == 0) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L317] COND FALSE !((int )wb_st == 0) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L320] COND FALSE !((int )r_st == 0) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L557] RET eval() [L559] kernel_st = 2 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L560] COND FALSE !((int )c_req_up == 1) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L571] kernel_st = 3 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L572] COND FALSE !((int )e_f == 0) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L577] COND FALSE !((int )e_g == 0) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L582] COND FALSE !((int )e_e == 0) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L587] COND FALSE !((int )e_c == 0) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=0, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L592] COND TRUE (int )e_wl == 0 [L593] e_wl = 1 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L597] COND TRUE (int )wl_pc == 1 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=2] [L598] COND TRUE (int )e_wl == 1 [L599] wl_st = 0 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L615] COND TRUE (int )c1_pc == 1 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L616] COND FALSE !((int )e_f == 1) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L624] COND TRUE (int )c2_pc == 1 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L625] COND FALSE !((int )e_f == 1) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L633] COND TRUE (int )wb_pc == 1 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L634] COND FALSE !((int )e_g == 1) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L642] COND FALSE !((int )e_c == 1) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L647] COND FALSE !((int )e_e == 1) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L652] COND FALSE !((int )e_f == 1) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L657] COND FALSE !((int )e_g == 1) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L662] COND FALSE !((int )e_c == 1) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=1, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L667] COND TRUE (int )e_wl == 1 [L668] e_wl = 2 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L672] COND TRUE (int )wl_st == 0 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L553] COND TRUE 1 [L556] kernel_st = 1 [L557] CALL eval() [L298] int tmp ; [L299] int tmp___0 ; [L300] int tmp___1 ; [L301] int tmp___2 ; [L302] int tmp___3 ; VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L306] COND TRUE 1 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L308] COND TRUE (int )wl_st == 0 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=0] [L329] COND TRUE (int )wl_st == 0 [L331] tmp = __VERIFIER_nondet_int() [L333] COND TRUE \read(tmp) [L335] wl_st = 1 [L336] CALL write_loop() [L63] int t ; VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L66] COND FALSE !((int )wl_pc == 0) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L69] COND FALSE !((int )wl_pc == 2) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L72] COND TRUE (int )wl_pc == 1 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L87] COND TRUE 1 [L89] t = d [L90] data = d [L91] processed = 0 [L92] e_f = 1 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=1, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L93] COND TRUE (int )c1_pc == 1 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=1, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L94] COND TRUE (int )e_f == 1 [L95] c1_st = 0 VAL [c1_i=1, c1_pc=1, c1_st=0, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=1, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L102] COND TRUE (int )c2_pc == 1 VAL [c1_i=1, c1_pc=1, c1_st=0, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=1, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L103] COND TRUE (int )e_f == 1 [L104] c2_st = 0 VAL [c1_i=1, c1_pc=1, c1_st=0, c2_i=1, c2_pc=1, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=1, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=1, wl_st=1] [L111] e_f = 2 [L112] wl_st = 2 [L113] wl_pc = 2 [L114] t_b = t VAL [c1_i=1, c1_pc=1, c1_st=0, c2_i=1, c2_pc=1, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L336] RET write_loop() [L344] COND TRUE (int )c1_st == 0 [L346] tmp___0 = __VERIFIER_nondet_int() [L348] COND TRUE \read(tmp___0) [L350] c1_st = 1 [L351] CALL compute1() [L149] COND FALSE !((int )c1_pc == 0) VAL [c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L152] COND TRUE (int )c1_pc == 1 VAL [c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=0, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L167] COND TRUE ! processed [L168] data += 1 [L169] e_g = 1 VAL [c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=1, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L170] COND TRUE (int )wb_pc == 1 VAL [c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=1, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L171] COND TRUE (int )e_g == 1 [L172] wb_st = 0 VAL [c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=1, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L179] e_g = 2 VAL [c1_i=1, c1_pc=1, c1_st=1, c2_i=1, c2_pc=1, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L160] COND TRUE 1 [L162] c1_st = 2 [L163] c1_pc = 1 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=0, c=0, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L351] RET compute1() [L359] COND TRUE (int )c2_st == 0 [L361] tmp___1 = __VERIFIER_nondet_int() [L363] COND TRUE \read(tmp___1) [L365] c2_st = 1 [L366] CALL compute2() [L194] COND FALSE !((int )c2_pc == 0) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c=0, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L197] COND TRUE (int )c2_pc == 1 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c=0, c_req_up=0, c_t=0, d=0, data=1, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L212] COND TRUE ! processed [L213] data += 1 [L214] e_g = 1 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c=0, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=1, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L215] COND TRUE (int )wb_pc == 1 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c=0, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=1, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L216] COND TRUE (int )e_g == 1 [L217] wb_st = 0 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c=0, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=1, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L224] e_g = 2 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=1, c=0, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L205] COND TRUE 1 [L207] c2_st = 2 [L208] c2_pc = 1 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=0, wl_i=1, wl_pc=2, wl_st=2] [L366] RET compute2() [L374] COND TRUE (int )wb_st == 0 [L376] tmp___2 = __VERIFIER_nondet_int() [L378] COND TRUE \read(tmp___2) [L380] wb_st = 1 [L381] CALL write_back() [L239] COND FALSE !((int )wb_pc == 0) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=0, c_t=0, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=0, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=1, wl_i=1, wl_pc=2, wl_st=2] [L242] COND TRUE (int )wb_pc == 1 [L257] c_t = data [L258] c_req_up = 1 [L259] processed = 1 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=1, wl_i=1, wl_pc=2, wl_st=2] [L250] COND TRUE 1 [L252] wb_st = 2 [L253] wb_pc = 1 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L381] RET write_back() [L389] COND FALSE !((int )r_st == 0) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L306] COND TRUE 1 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L308] COND FALSE !((int )wl_st == 0) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L311] COND FALSE !((int )c1_st == 0) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L314] COND FALSE !((int )c2_st == 0) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L317] COND FALSE !((int )wb_st == 0) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L320] COND FALSE !((int )r_st == 0) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L557] RET eval() [L559] kernel_st = 2 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L560] COND TRUE (int )c_req_up == 1 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=0, c_req_up=1, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L561] COND TRUE c != c_t [L562] c = c_t [L563] e_c = 0 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=1, c_t=2, d=0, data=2, e_c=0, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L567] c_req_up = 0 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=0, data=2, e_c=0, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L571] kernel_st = 3 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=0, data=2, e_c=0, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L572] COND FALSE !((int )e_f == 0) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=0, data=2, e_c=0, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L577] COND FALSE !((int )e_g == 0) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=0, data=2, e_c=0, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L582] COND FALSE !((int )e_e == 0) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=0, data=2, e_c=0, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L587] COND TRUE (int )e_c == 0 [L588] e_c = 1 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L592] COND FALSE !((int )e_wl == 0) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L597] COND FALSE !((int )wl_pc == 1) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L605] COND TRUE (int )wl_pc == 2 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L606] COND FALSE !((int )e_e == 1) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L615] COND TRUE (int )c1_pc == 1 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L616] COND FALSE !((int )e_f == 1) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L624] COND TRUE (int )c2_pc == 1 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L625] COND FALSE !((int )e_f == 1) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L633] COND TRUE (int )wb_pc == 1 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L634] COND FALSE !((int )e_g == 1) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L642] COND TRUE (int )e_c == 1 [L643] r_st = 0 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L647] COND FALSE !((int )e_e == 1) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L652] COND FALSE !((int )e_f == 1) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L657] COND FALSE !((int )e_g == 1) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=0, data=2, e_c=1, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L662] COND TRUE (int )e_c == 1 [L663] e_c = 2 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L667] COND FALSE !((int )e_wl == 1) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L672] COND FALSE !((int )wl_st == 0) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L675] COND FALSE !((int )c1_st == 0) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L678] COND FALSE !((int )c2_st == 0) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L681] COND FALSE !((int )wb_st == 0) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L684] COND TRUE (int )r_st == 0 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L553] COND TRUE 1 [L556] kernel_st = 1 [L557] CALL eval() [L298] int tmp ; [L299] int tmp___0 ; [L300] int tmp___1 ; [L301] int tmp___2 ; [L302] int tmp___3 ; VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L306] COND TRUE 1 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L308] COND FALSE !((int )wl_st == 0) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L311] COND FALSE !((int )c1_st == 0) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L314] COND FALSE !((int )c2_st == 0) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L317] COND FALSE !((int )wb_st == 0) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L320] COND TRUE (int )r_st == 0 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L329] COND FALSE !((int )wl_st == 0) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L344] COND FALSE !((int )c1_st == 0) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L359] COND FALSE !((int )c2_st == 0) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L374] COND FALSE !((int )wb_st == 0) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=0, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L389] COND TRUE (int )r_st == 0 [L391] tmp___3 = __VERIFIER_nondet_int() [L393] COND TRUE \read(tmp___3) [L395] r_st = 1 [L396] CALL read() [L271] d = c [L272] e_e = 1 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=1, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=1, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L273] COND FALSE !((int )wl_pc == 1) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=1, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=1, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L281] COND TRUE (int )wl_pc == 2 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=1, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=1, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=2] [L282] COND TRUE (int )e_e == 1 [L283] wl_st = 0 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=1, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=1, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=0] [L291] e_e = 2 [L292] r_st = 2 [L396] RET read() [L306] COND TRUE 1 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=0] [L308] COND TRUE (int )wl_st == 0 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=0] [L329] COND TRUE (int )wl_st == 0 [L331] tmp = __VERIFIER_nondet_int() [L333] COND TRUE \read(tmp) [L335] wl_st = 1 [L336] CALL write_loop() [L63] int t ; VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L66] COND FALSE !((int )wl_pc == 0) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L69] COND TRUE (int )wl_pc == 2 [L118] t = t_b VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L119] COND FALSE !(d == t + 1) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L122] COND TRUE d == t + 2 VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t=0, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L130] COND FALSE !(d == t + 1) VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L134] CALL error() VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] [L23] reach_error() VAL [c1_i=1, c1_pc=1, c1_st=2, c2_i=1, c2_pc=1, c2_st=2, c=2, c_req_up=0, c_t=2, d=2, data=2, e_c=2, e_e=2, e_f=2, e_g=2, e_p_in=0, e_wl=2, p_in=0, p_out=0, processed=1, r_i=0, r_st=2, t_b=0, wb_i=1, wb_pc=1, wb_st=2, wl_i=1, wl_pc=2, wl_st=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 124 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.8s, OverallIterations: 36, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 9.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10840 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10840 mSDsluCounter, 18252 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11321 mSDsCounter, 309 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2658 IncrementalHoareTripleChecker+Invalid, 2967 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 309 mSolverCounterUnsat, 6931 mSDtfsCounter, 2658 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 565 GetRequests, 421 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1545 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5239occurred in iteration=21, InterpolantAutomatonStates: 184, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.0s AutomataMinimizationTime, 35 MinimizatonAttempts, 6224 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 3286 NumberOfCodeBlocks, 3286 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 3248 ConstructedInterpolants, 0 QuantifiedInterpolants, 6807 SizeOfPredicates, 5 NumberOfNonLiveVariables, 460 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 37 InterpolantComputations, 34 PerfectInterpolantSequences, 1094/1219 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-11 03:15:24,185 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE