./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 21f8745a4b7dc6c318e9cfa92c5330ecd148615dc4c561afd5b7113093125b70 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 20:15:00,839 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 20:15:00,894 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 20:15:00,899 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 20:15:00,899 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 20:15:00,921 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 20:15:00,921 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 20:15:00,922 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 20:15:00,922 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 20:15:00,924 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 20:15:00,924 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 20:15:00,924 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 20:15:00,925 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 20:15:00,926 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 20:15:00,926 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 20:15:00,926 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 20:15:00,926 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 20:15:00,927 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 20:15:00,927 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 20:15:00,927 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 20:15:00,927 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 20:15:00,931 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 20:15:00,931 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 20:15:00,932 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 20:15:00,932 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 20:15:00,932 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 20:15:00,932 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 20:15:00,932 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 20:15:00,933 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 20:15:00,933 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 20:15:00,934 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 20:15:00,934 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 20:15:00,934 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:15:00,935 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 20:15:00,935 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 20:15:00,935 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 20:15:00,935 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 20:15:00,935 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 20:15:00,936 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 20:15:00,936 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 20:15:00,936 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 20:15:00,936 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 20:15:00,937 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/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/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 -> 21f8745a4b7dc6c318e9cfa92c5330ecd148615dc4c561afd5b7113093125b70 [2024-10-12 20:15:01,168 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 20:15:01,189 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 20:15:01,193 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 20:15:01,194 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 20:15:01,195 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 20:15:01,196 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2024-10-12 20:15:02,578 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 20:15:02,797 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 20:15:02,799 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2024-10-12 20:15:02,812 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9987641a4/b47cde9ae12d47d79df422f6ccd891c0/FLAGa3a5d717c [2024-10-12 20:15:03,159 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9987641a4/b47cde9ae12d47d79df422f6ccd891c0 [2024-10-12 20:15:03,161 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 20:15:03,162 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 20:15:03,163 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 20:15:03,163 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 20:15:03,168 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 20:15:03,168 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:15:03" (1/1) ... [2024-10-12 20:15:03,169 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@203bba28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:15:03, skipping insertion in model container [2024-10-12 20:15:03,169 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:15:03" (1/1) ... [2024-10-12 20:15:03,210 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 20:15:03,430 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/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[9615,9628] [2024-10-12 20:15:03,448 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/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[11969,11982] [2024-10-12 20:15:03,501 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:15:03,515 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 20:15:03,586 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/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[9615,9628] [2024-10-12 20:15:03,614 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/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c[11969,11982] [2024-10-12 20:15:03,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:15:03,662 INFO L204 MainTranslator]: Completed translation [2024-10-12 20:15:03,663 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:15:03 WrapperNode [2024-10-12 20:15:03,663 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 20:15:03,664 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 20:15:03,664 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 20:15:03,664 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 20:15:03,670 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:15:03" (1/1) ... [2024-10-12 20:15:03,684 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:15:03" (1/1) ... [2024-10-12 20:15:03,718 INFO L138 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1023 [2024-10-12 20:15:03,719 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 20:15:03,719 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 20:15:03,719 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 20:15:03,719 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 20:15:03,729 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:15:03" (1/1) ... [2024-10-12 20:15:03,729 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:15:03" (1/1) ... [2024-10-12 20:15:03,733 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:15:03" (1/1) ... [2024-10-12 20:15:03,755 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-12 20:15:03,755 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:15:03" (1/1) ... [2024-10-12 20:15:03,756 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:15:03" (1/1) ... [2024-10-12 20:15:03,769 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:15:03" (1/1) ... [2024-10-12 20:15:03,775 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:15:03" (1/1) ... [2024-10-12 20:15:03,778 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:15:03" (1/1) ... [2024-10-12 20:15:03,781 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:15:03" (1/1) ... [2024-10-12 20:15:03,786 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 20:15:03,787 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 20:15:03,787 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 20:15:03,787 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 20:15:03,788 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:15:03" (1/1) ... [2024-10-12 20:15:03,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:15:03,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:15:03,828 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 20:15:03,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 20:15:03,872 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 20:15:03,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 20:15:03,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 20:15:03,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 20:15:03,986 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 20:15:03,988 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 20:15:04,788 INFO L? ?]: Removed 69 outVars from TransFormulas that were not future-live. [2024-10-12 20:15:04,789 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 20:15:04,844 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 20:15:04,844 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-12 20:15:04,844 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:15:04 BoogieIcfgContainer [2024-10-12 20:15:04,844 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 20:15:04,846 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 20:15:04,846 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 20:15:04,849 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 20:15:04,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 08:15:03" (1/3) ... [2024-10-12 20:15:04,850 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@423540ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:15:04, skipping insertion in model container [2024-10-12 20:15:04,850 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:15:03" (2/3) ... [2024-10-12 20:15:04,850 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@423540ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:15:04, skipping insertion in model container [2024-10-12 20:15:04,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:15:04" (3/3) ... [2024-10-12 20:15:04,852 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2024-10-12 20:15:04,867 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 20:15:04,867 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-12 20:15:04,925 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 20:15:04,931 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;@1ebcbff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 20:15:04,932 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-12 20:15:04,939 INFO L276 IsEmpty]: Start isEmpty. Operand has 235 states, 232 states have (on average 1.8103448275862069) internal successors, (420), 234 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:04,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-12 20:15:04,949 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:15:04,950 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:15:04,950 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:15:04,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:15:04,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1041858481, now seen corresponding path program 1 times [2024-10-12 20:15:04,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:15:04,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956890394] [2024-10-12 20:15:04,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:15:04,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:15:05,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:15:05,813 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-12 20:15:05,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:15:05,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956890394] [2024-10-12 20:15:05,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956890394] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:15:05,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:15:05,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:15:05,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086749324] [2024-10-12 20:15:05,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:15:05,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:15:05,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:15:05,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:15:05,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:15:05,850 INFO L87 Difference]: Start difference. First operand has 235 states, 232 states have (on average 1.8103448275862069) internal successors, (420), 234 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:06,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:15:06,024 INFO L93 Difference]: Finished difference Result 880 states and 1579 transitions. [2024-10-12 20:15:06,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:15:06,030 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2024-10-12 20:15:06,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:15:06,044 INFO L225 Difference]: With dead ends: 880 [2024-10-12 20:15:06,045 INFO L226 Difference]: Without dead ends: 664 [2024-10-12 20:15:06,048 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:15:06,051 INFO L432 NwaCegarLoop]: 686 mSDtfsCounter, 746 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 746 SdHoareTripleChecker+Valid, 1439 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:15:06,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [746 Valid, 1439 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:15:06,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2024-10-12 20:15:06,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 430. [2024-10-12 20:15:06,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 428 states have (on average 1.469626168224299) internal successors, (629), 429 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:06,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 629 transitions. [2024-10-12 20:15:06,108 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 629 transitions. Word has length 90 [2024-10-12 20:15:06,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:15:06,109 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 629 transitions. [2024-10-12 20:15:06,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:06,110 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 629 transitions. [2024-10-12 20:15:06,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-12 20:15:06,114 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:15:06,114 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:15:06,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 20:15:06,115 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:15:06,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:15:06,115 INFO L85 PathProgramCache]: Analyzing trace with hash -516763371, now seen corresponding path program 1 times [2024-10-12 20:15:06,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:15:06,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637076439] [2024-10-12 20:15:06,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:15:06,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:15:06,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:15:06,218 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-12 20:15:06,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:15:06,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637076439] [2024-10-12 20:15:06,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637076439] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:15:06,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:15:06,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:15:06,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778696865] [2024-10-12 20:15:06,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:15:06,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:15:06,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:15:06,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:15:06,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:15:06,224 INFO L87 Difference]: Start difference. First operand 430 states and 629 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:06,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:15:06,244 INFO L93 Difference]: Finished difference Result 835 states and 1215 transitions. [2024-10-12 20:15:06,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:15:06,245 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2024-10-12 20:15:06,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:15:06,247 INFO L225 Difference]: With dead ends: 835 [2024-10-12 20:15:06,247 INFO L226 Difference]: Without dead ends: 432 [2024-10-12 20:15:06,249 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-12 20:15:06,250 INFO L432 NwaCegarLoop]: 343 mSDtfsCounter, 0 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:15:06,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 681 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:15:06,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2024-10-12 20:15:06,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 432. [2024-10-12 20:15:06,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 430 states have (on average 1.4674418604651163) internal successors, (631), 431 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:06,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 631 transitions. [2024-10-12 20:15:06,271 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 631 transitions. Word has length 91 [2024-10-12 20:15:06,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:15:06,272 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 631 transitions. [2024-10-12 20:15:06,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:06,272 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 631 transitions. [2024-10-12 20:15:06,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-12 20:15:06,274 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:15:06,274 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:15:06,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 20:15:06,275 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:15:06,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:15:06,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1004844417, now seen corresponding path program 1 times [2024-10-12 20:15:06,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:15:06,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182310307] [2024-10-12 20:15:06,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:15:06,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:15:06,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:15:06,366 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-12 20:15:06,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:15:06,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182310307] [2024-10-12 20:15:06,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182310307] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:15:06,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:15:06,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:15:06,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101107860] [2024-10-12 20:15:06,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:15:06,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:15:06,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:15:06,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:15:06,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:15:06,372 INFO L87 Difference]: Start difference. First operand 432 states and 631 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:06,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:15:06,412 INFO L93 Difference]: Finished difference Result 1089 states and 1604 transitions. [2024-10-12 20:15:06,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:15:06,412 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2024-10-12 20:15:06,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:15:06,416 INFO L225 Difference]: With dead ends: 1089 [2024-10-12 20:15:06,417 INFO L226 Difference]: Without dead ends: 834 [2024-10-12 20:15:06,418 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-12 20:15:06,421 INFO L432 NwaCegarLoop]: 609 mSDtfsCounter, 274 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 921 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:15:06,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 921 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:15:06,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2024-10-12 20:15:06,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 816. [2024-10-12 20:15:06,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 816 states, 814 states have (on average 1.4557739557739557) internal successors, (1185), 815 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:06,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1185 transitions. [2024-10-12 20:15:06,442 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1185 transitions. Word has length 92 [2024-10-12 20:15:06,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:15:06,444 INFO L471 AbstractCegarLoop]: Abstraction has 816 states and 1185 transitions. [2024-10-12 20:15:06,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:06,445 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1185 transitions. [2024-10-12 20:15:06,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-12 20:15:06,448 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:15:06,448 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:15:06,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 20:15:06,448 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:15:06,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:15:06,449 INFO L85 PathProgramCache]: Analyzing trace with hash 2134022530, now seen corresponding path program 1 times [2024-10-12 20:15:06,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:15:06,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922498421] [2024-10-12 20:15:06,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:15:06,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:15:06,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:15:06,771 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-12 20:15:06,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:15:06,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922498421] [2024-10-12 20:15:06,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922498421] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:15:06,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:15:06,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:15:06,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953031137] [2024-10-12 20:15:06,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:15:06,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:15:06,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:15:06,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:15:06,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:15:06,772 INFO L87 Difference]: Start difference. First operand 816 states and 1185 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:06,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:15:06,799 INFO L93 Difference]: Finished difference Result 1276 states and 1867 transitions. [2024-10-12 20:15:06,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:15:06,799 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2024-10-12 20:15:06,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:15:06,802 INFO L225 Difference]: With dead ends: 1276 [2024-10-12 20:15:06,802 INFO L226 Difference]: Without dead ends: 627 [2024-10-12 20:15:06,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:15:06,803 INFO L432 NwaCegarLoop]: 386 mSDtfsCounter, 25 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 1107 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:15:06,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 1107 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:15:06,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2024-10-12 20:15:06,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 627. [2024-10-12 20:15:06,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 625 states have (on average 1.448) internal successors, (905), 626 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:06,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 905 transitions. [2024-10-12 20:15:06,815 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 905 transitions. Word has length 92 [2024-10-12 20:15:06,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:15:06,815 INFO L471 AbstractCegarLoop]: Abstraction has 627 states and 905 transitions. [2024-10-12 20:15:06,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:06,816 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 905 transitions. [2024-10-12 20:15:06,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-12 20:15:06,818 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:15:06,818 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:15:06,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 20:15:06,819 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:15:06,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:15:06,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1362211205, now seen corresponding path program 1 times [2024-10-12 20:15:06,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:15:06,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296440634] [2024-10-12 20:15:06,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:15:06,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:15:06,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:15:07,029 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-12 20:15:07,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:15:07,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296440634] [2024-10-12 20:15:07,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296440634] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:15:07,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:15:07,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:15:07,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173512191] [2024-10-12 20:15:07,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:15:07,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:15:07,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:15:07,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:15:07,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:15:07,031 INFO L87 Difference]: Start difference. First operand 627 states and 905 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:07,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:15:07,163 INFO L93 Difference]: Finished difference Result 1088 states and 1595 transitions. [2024-10-12 20:15:07,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:15:07,164 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-10-12 20:15:07,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:15:07,166 INFO L225 Difference]: With dead ends: 1088 [2024-10-12 20:15:07,168 INFO L226 Difference]: Without dead ends: 627 [2024-10-12 20:15:07,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:15:07,170 INFO L432 NwaCegarLoop]: 258 mSDtfsCounter, 862 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 862 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:15:07,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [862 Valid, 354 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:15:07,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2024-10-12 20:15:07,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 627. [2024-10-12 20:15:07,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 625 states have (on average 1.432) internal successors, (895), 626 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:07,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 895 transitions. [2024-10-12 20:15:07,185 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 895 transitions. Word has length 94 [2024-10-12 20:15:07,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:15:07,186 INFO L471 AbstractCegarLoop]: Abstraction has 627 states and 895 transitions. [2024-10-12 20:15:07,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:07,187 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 895 transitions. [2024-10-12 20:15:07,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-12 20:15:07,188 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:15:07,189 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:15:07,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 20:15:07,189 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:15:07,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:15:07,190 INFO L85 PathProgramCache]: Analyzing trace with hash -981439392, now seen corresponding path program 1 times [2024-10-12 20:15:07,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:15:07,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967810390] [2024-10-12 20:15:07,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:15:07,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:15:07,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:15:07,408 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-12 20:15:07,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:15:07,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967810390] [2024-10-12 20:15:07,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967810390] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:15:07,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:15:07,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:15:07,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570766156] [2024-10-12 20:15:07,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:15:07,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:15:07,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:15:07,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:15:07,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:15:07,411 INFO L87 Difference]: Start difference. First operand 627 states and 895 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:07,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:15:07,459 INFO L93 Difference]: Finished difference Result 1542 states and 2196 transitions. [2024-10-12 20:15:07,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:15:07,459 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-10-12 20:15:07,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:15:07,462 INFO L225 Difference]: With dead ends: 1542 [2024-10-12 20:15:07,463 INFO L226 Difference]: Without dead ends: 951 [2024-10-12 20:15:07,463 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:15:07,464 INFO L432 NwaCegarLoop]: 566 mSDtfsCounter, 279 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 1159 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:15:07,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 1159 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:15:07,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2024-10-12 20:15:07,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 937. [2024-10-12 20:15:07,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 937 states, 935 states have (on average 1.4245989304812834) internal successors, (1332), 936 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:07,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1332 transitions. [2024-10-12 20:15:07,493 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1332 transitions. Word has length 94 [2024-10-12 20:15:07,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:15:07,493 INFO L471 AbstractCegarLoop]: Abstraction has 937 states and 1332 transitions. [2024-10-12 20:15:07,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:07,493 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1332 transitions. [2024-10-12 20:15:07,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-12 20:15:07,494 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:15:07,494 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:15:07,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 20:15:07,495 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:15:07,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:15:07,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1000313403, now seen corresponding path program 1 times [2024-10-12 20:15:07,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:15:07,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593822977] [2024-10-12 20:15:07,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:15:07,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:15:07,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:15:07,544 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-12 20:15:07,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:15:07,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593822977] [2024-10-12 20:15:07,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593822977] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:15:07,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:15:07,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:15:07,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672650548] [2024-10-12 20:15:07,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:15:07,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:15:07,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:15:07,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:15:07,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:15:07,546 INFO L87 Difference]: Start difference. First operand 937 states and 1332 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:07,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:15:07,567 INFO L93 Difference]: Finished difference Result 1913 states and 2725 transitions. [2024-10-12 20:15:07,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:15:07,568 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2024-10-12 20:15:07,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:15:07,572 INFO L225 Difference]: With dead ends: 1913 [2024-10-12 20:15:07,572 INFO L226 Difference]: Without dead ends: 1270 [2024-10-12 20:15:07,573 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-12 20:15:07,573 INFO L432 NwaCegarLoop]: 584 mSDtfsCounter, 314 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:15:07,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 916 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:15:07,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states. [2024-10-12 20:15:07,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 937. [2024-10-12 20:15:07,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 937 states, 935 states have (on average 1.423529411764706) internal successors, (1331), 936 states have internal predecessors, (1331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:07,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1331 transitions. [2024-10-12 20:15:07,589 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1331 transitions. Word has length 95 [2024-10-12 20:15:07,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:15:07,590 INFO L471 AbstractCegarLoop]: Abstraction has 937 states and 1331 transitions. [2024-10-12 20:15:07,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:07,590 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1331 transitions. [2024-10-12 20:15:07,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-12 20:15:07,591 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:15:07,591 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:15:07,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 20:15:07,591 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:15:07,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:15:07,592 INFO L85 PathProgramCache]: Analyzing trace with hash 721077022, now seen corresponding path program 1 times [2024-10-12 20:15:07,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:15:07,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808130639] [2024-10-12 20:15:07,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:15:07,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:15:07,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:15:07,655 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-12 20:15:07,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:15:07,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808130639] [2024-10-12 20:15:07,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808130639] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:15:07,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:15:07,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:15:07,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005568825] [2024-10-12 20:15:07,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:15:07,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:15:07,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:15:07,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:15:07,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:15:07,659 INFO L87 Difference]: Start difference. First operand 937 states and 1331 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:07,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:15:07,706 INFO L93 Difference]: Finished difference Result 2348 states and 3377 transitions. [2024-10-12 20:15:07,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:15:07,707 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2024-10-12 20:15:07,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:15:07,713 INFO L225 Difference]: With dead ends: 2348 [2024-10-12 20:15:07,713 INFO L226 Difference]: Without dead ends: 1744 [2024-10-12 20:15:07,714 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-12 20:15:07,715 INFO L432 NwaCegarLoop]: 629 mSDtfsCounter, 264 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:15:07,718 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 935 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:15:07,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1744 states. [2024-10-12 20:15:07,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1744 to 1732. [2024-10-12 20:15:07,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1732 states, 1730 states have (on average 1.413872832369942) internal successors, (2446), 1731 states have internal predecessors, (2446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:07,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1732 states to 1732 states and 2446 transitions. [2024-10-12 20:15:07,746 INFO L78 Accepts]: Start accepts. Automaton has 1732 states and 2446 transitions. Word has length 96 [2024-10-12 20:15:07,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:15:07,747 INFO L471 AbstractCegarLoop]: Abstraction has 1732 states and 2446 transitions. [2024-10-12 20:15:07,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:07,747 INFO L276 IsEmpty]: Start isEmpty. Operand 1732 states and 2446 transitions. [2024-10-12 20:15:07,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-12 20:15:07,749 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:15:07,749 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:15:07,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 20:15:07,750 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:15:07,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:15:07,750 INFO L85 PathProgramCache]: Analyzing trace with hash 2105171297, now seen corresponding path program 1 times [2024-10-12 20:15:07,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:15:07,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762532268] [2024-10-12 20:15:07,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:15:07,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:15:07,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:15:07,952 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-12 20:15:07,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:15:07,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762532268] [2024-10-12 20:15:07,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762532268] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:15:07,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:15:07,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:15:07,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149422991] [2024-10-12 20:15:07,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:15:07,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:15:07,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:15:07,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:15:07,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:15:07,954 INFO L87 Difference]: Start difference. First operand 1732 states and 2446 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:08,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:15:08,022 INFO L93 Difference]: Finished difference Result 6470 states and 9083 transitions. [2024-10-12 20:15:08,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:15:08,023 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2024-10-12 20:15:08,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:15:08,035 INFO L225 Difference]: With dead ends: 6470 [2024-10-12 20:15:08,035 INFO L226 Difference]: Without dead ends: 4826 [2024-10-12 20:15:08,038 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:15:08,039 INFO L432 NwaCegarLoop]: 548 mSDtfsCounter, 568 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 1137 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:15:08,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 1137 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:15:08,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4826 states. [2024-10-12 20:15:08,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4826 to 3219. [2024-10-12 20:15:08,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3219 states, 3217 states have (on average 1.3972645321728319) internal successors, (4495), 3218 states have internal predecessors, (4495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:08,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3219 states to 3219 states and 4495 transitions. [2024-10-12 20:15:08,102 INFO L78 Accepts]: Start accepts. Automaton has 3219 states and 4495 transitions. Word has length 96 [2024-10-12 20:15:08,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:15:08,103 INFO L471 AbstractCegarLoop]: Abstraction has 3219 states and 4495 transitions. [2024-10-12 20:15:08,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:08,103 INFO L276 IsEmpty]: Start isEmpty. Operand 3219 states and 4495 transitions. [2024-10-12 20:15:08,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-12 20:15:08,106 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:15:08,106 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:15:08,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 20:15:08,107 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:15:08,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:15:08,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1101851715, now seen corresponding path program 1 times [2024-10-12 20:15:08,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:15:08,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125501110] [2024-10-12 20:15:08,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:15:08,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:15:08,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:15:08,155 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-12 20:15:08,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:15:08,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125501110] [2024-10-12 20:15:08,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125501110] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:15:08,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:15:08,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:15:08,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918980915] [2024-10-12 20:15:08,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:15:08,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:15:08,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:15:08,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:15:08,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:15:08,159 INFO L87 Difference]: Start difference. First operand 3219 states and 4495 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:08,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:15:08,191 INFO L93 Difference]: Finished difference Result 6302 states and 8793 transitions. [2024-10-12 20:15:08,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:15:08,192 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2024-10-12 20:15:08,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:15:08,199 INFO L225 Difference]: With dead ends: 6302 [2024-10-12 20:15:08,200 INFO L226 Difference]: Without dead ends: 3231 [2024-10-12 20:15:08,204 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-12 20:15:08,205 INFO L432 NwaCegarLoop]: 337 mSDtfsCounter, 0 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:15:08,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 669 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:15:08,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3231 states. [2024-10-12 20:15:08,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3231 to 3231. [2024-10-12 20:15:08,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3231 states, 3229 states have (on average 1.3957881697119852) internal successors, (4507), 3230 states have internal predecessors, (4507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:08,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3231 states to 3231 states and 4507 transitions. [2024-10-12 20:15:08,257 INFO L78 Accepts]: Start accepts. Automaton has 3231 states and 4507 transitions. Word has length 97 [2024-10-12 20:15:08,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:15:08,257 INFO L471 AbstractCegarLoop]: Abstraction has 3231 states and 4507 transitions. [2024-10-12 20:15:08,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:08,257 INFO L276 IsEmpty]: Start isEmpty. Operand 3231 states and 4507 transitions. [2024-10-12 20:15:08,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-12 20:15:08,260 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:15:08,260 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:15:08,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 20:15:08,260 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:15:08,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:15:08,261 INFO L85 PathProgramCache]: Analyzing trace with hash -509393728, now seen corresponding path program 1 times [2024-10-12 20:15:08,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:15:08,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993927658] [2024-10-12 20:15:08,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:15:08,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:15:08,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:15:08,514 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-12 20:15:08,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:15:08,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993927658] [2024-10-12 20:15:08,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993927658] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:15:08,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:15:08,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:15:08,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597546264] [2024-10-12 20:15:08,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:15:08,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:15:08,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:15:08,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:15:08,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:15:08,517 INFO L87 Difference]: Start difference. First operand 3231 states and 4507 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:08,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:15:08,552 INFO L93 Difference]: Finished difference Result 5491 states and 7712 transitions. [2024-10-12 20:15:08,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:15:08,552 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2024-10-12 20:15:08,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:15:08,559 INFO L225 Difference]: With dead ends: 5491 [2024-10-12 20:15:08,559 INFO L226 Difference]: Without dead ends: 2645 [2024-10-12 20:15:08,563 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:15:08,563 INFO L432 NwaCegarLoop]: 374 mSDtfsCounter, 18 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1077 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:15:08,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 1077 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:15:08,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2645 states. [2024-10-12 20:15:08,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2645 to 2645. [2024-10-12 20:15:08,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2645 states, 2643 states have (on average 1.3859250851305336) internal successors, (3663), 2644 states have internal predecessors, (3663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:08,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2645 states to 2645 states and 3663 transitions. [2024-10-12 20:15:08,620 INFO L78 Accepts]: Start accepts. Automaton has 2645 states and 3663 transitions. Word has length 98 [2024-10-12 20:15:08,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:15:08,620 INFO L471 AbstractCegarLoop]: Abstraction has 2645 states and 3663 transitions. [2024-10-12 20:15:08,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:08,621 INFO L276 IsEmpty]: Start isEmpty. Operand 2645 states and 3663 transitions. [2024-10-12 20:15:08,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-12 20:15:08,624 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:15:08,624 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:15:08,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 20:15:08,624 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:15:08,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:15:08,625 INFO L85 PathProgramCache]: Analyzing trace with hash -868864096, now seen corresponding path program 1 times [2024-10-12 20:15:08,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:15:08,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432899634] [2024-10-12 20:15:08,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:15:08,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:15:08,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:15:08,914 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-12 20:15:08,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:15:08,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432899634] [2024-10-12 20:15:08,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432899634] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:15:08,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:15:08,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:15:08,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821069849] [2024-10-12 20:15:08,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:15:08,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:15:08,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:15:08,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:15:08,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:15:08,917 INFO L87 Difference]: Start difference. First operand 2645 states and 3663 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:08,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:15:08,951 INFO L93 Difference]: Finished difference Result 5180 states and 7179 transitions. [2024-10-12 20:15:08,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:15:08,952 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2024-10-12 20:15:08,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:15:08,958 INFO L225 Difference]: With dead ends: 5180 [2024-10-12 20:15:08,959 INFO L226 Difference]: Without dead ends: 2645 [2024-10-12 20:15:08,962 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:15:08,962 INFO L432 NwaCegarLoop]: 359 mSDtfsCounter, 10 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:15:08,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1045 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:15:08,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2645 states. [2024-10-12 20:15:08,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2645 to 2641. [2024-10-12 20:15:08,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2641 states, 2639 states have (on average 1.383099658961728) internal successors, (3650), 2640 states have internal predecessors, (3650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:09,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2641 states to 2641 states and 3650 transitions. [2024-10-12 20:15:09,002 INFO L78 Accepts]: Start accepts. Automaton has 2641 states and 3650 transitions. Word has length 100 [2024-10-12 20:15:09,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:15:09,002 INFO L471 AbstractCegarLoop]: Abstraction has 2641 states and 3650 transitions. [2024-10-12 20:15:09,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:09,002 INFO L276 IsEmpty]: Start isEmpty. Operand 2641 states and 3650 transitions. [2024-10-12 20:15:09,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-12 20:15:09,004 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:15:09,004 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:15:09,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 20:15:09,005 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:15:09,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:15:09,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1967496528, now seen corresponding path program 1 times [2024-10-12 20:15:09,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:15:09,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416209245] [2024-10-12 20:15:09,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:15:09,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:15:09,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:15:09,220 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-12 20:15:09,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:15:09,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416209245] [2024-10-12 20:15:09,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416209245] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:15:09,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:15:09,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:15:09,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867312569] [2024-10-12 20:15:09,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:15:09,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:15:09,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:15:09,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:15:09,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:15:09,222 INFO L87 Difference]: Start difference. First operand 2641 states and 3650 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:09,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:15:09,253 INFO L93 Difference]: Finished difference Result 5234 states and 7231 transitions. [2024-10-12 20:15:09,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:15:09,254 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2024-10-12 20:15:09,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:15:09,261 INFO L225 Difference]: With dead ends: 5234 [2024-10-12 20:15:09,261 INFO L226 Difference]: Without dead ends: 2633 [2024-10-12 20:15:09,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:15:09,265 INFO L432 NwaCegarLoop]: 361 mSDtfsCounter, 13 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1047 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:15:09,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1047 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:15:09,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2633 states. [2024-10-12 20:15:09,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2633 to 2633. [2024-10-12 20:15:09,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2633 states, 2631 states have (on average 1.3812238692512353) internal successors, (3634), 2632 states have internal predecessors, (3634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:09,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2633 states to 2633 states and 3634 transitions. [2024-10-12 20:15:09,315 INFO L78 Accepts]: Start accepts. Automaton has 2633 states and 3634 transitions. Word has length 100 [2024-10-12 20:15:09,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:15:09,315 INFO L471 AbstractCegarLoop]: Abstraction has 2633 states and 3634 transitions. [2024-10-12 20:15:09,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:09,315 INFO L276 IsEmpty]: Start isEmpty. Operand 2633 states and 3634 transitions. [2024-10-12 20:15:09,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-12 20:15:09,320 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:15:09,321 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:15:09,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 20:15:09,321 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:15:09,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:15:09,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1002207283, now seen corresponding path program 1 times [2024-10-12 20:15:09,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:15:09,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850153293] [2024-10-12 20:15:09,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:15:09,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:15:09,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:15:09,390 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-12 20:15:09,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:15:09,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850153293] [2024-10-12 20:15:09,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850153293] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:15:09,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:15:09,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:15:09,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67932598] [2024-10-12 20:15:09,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:15:09,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:15:09,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:15:09,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:15:09,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:15:09,392 INFO L87 Difference]: Start difference. First operand 2633 states and 3634 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:09,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:15:09,438 INFO L93 Difference]: Finished difference Result 5770 states and 8071 transitions. [2024-10-12 20:15:09,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:15:09,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2024-10-12 20:15:09,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:15:09,451 INFO L225 Difference]: With dead ends: 5770 [2024-10-12 20:15:09,451 INFO L226 Difference]: Without dead ends: 3939 [2024-10-12 20:15:09,457 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-12 20:15:09,458 INFO L432 NwaCegarLoop]: 597 mSDtfsCounter, 255 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:15:09,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 897 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:15:09,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3939 states. [2024-10-12 20:15:09,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3939 to 3882. [2024-10-12 20:15:09,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3882 states, 3880 states have (on average 1.356958762886598) internal successors, (5265), 3881 states have internal predecessors, (5265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:09,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3882 states to 3882 states and 5265 transitions. [2024-10-12 20:15:09,547 INFO L78 Accepts]: Start accepts. Automaton has 3882 states and 5265 transitions. Word has length 100 [2024-10-12 20:15:09,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:15:09,547 INFO L471 AbstractCegarLoop]: Abstraction has 3882 states and 5265 transitions. [2024-10-12 20:15:09,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:09,548 INFO L276 IsEmpty]: Start isEmpty. Operand 3882 states and 5265 transitions. [2024-10-12 20:15:09,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-12 20:15:09,552 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:15:09,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 20:15:09,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 20:15:09,552 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:15:09,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:15:09,553 INFO L85 PathProgramCache]: Analyzing trace with hash 423739903, now seen corresponding path program 1 times [2024-10-12 20:15:09,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:15:09,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623112344] [2024-10-12 20:15:09,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:15:09,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:15:09,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:15:09,796 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-12 20:15:09,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:15:09,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623112344] [2024-10-12 20:15:09,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623112344] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:15:09,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:15:09,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:15:09,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230977404] [2024-10-12 20:15:09,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:15:09,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:15:09,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:15:09,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:15:09,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:15:09,798 INFO L87 Difference]: Start difference. First operand 3882 states and 5265 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:09,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:15:09,859 INFO L93 Difference]: Finished difference Result 6023 states and 8201 transitions. [2024-10-12 20:15:09,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:15:09,860 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2024-10-12 20:15:09,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:15:09,869 INFO L225 Difference]: With dead ends: 6023 [2024-10-12 20:15:09,870 INFO L226 Difference]: Without dead ends: 3590 [2024-10-12 20:15:09,873 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-12 20:15:09,873 INFO L432 NwaCegarLoop]: 343 mSDtfsCounter, 269 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:15:09,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 951 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:15:09,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3590 states. [2024-10-12 20:15:09,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3590 to 3394. [2024-10-12 20:15:09,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3394 states, 3392 states have (on average 1.3570165094339623) internal successors, (4603), 3393 states have internal predecessors, (4603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:09,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3394 states to 3394 states and 4603 transitions. [2024-10-12 20:15:09,916 INFO L78 Accepts]: Start accepts. Automaton has 3394 states and 4603 transitions. Word has length 102 [2024-10-12 20:15:09,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:15:09,916 INFO L471 AbstractCegarLoop]: Abstraction has 3394 states and 4603 transitions. [2024-10-12 20:15:09,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:09,917 INFO L276 IsEmpty]: Start isEmpty. Operand 3394 states and 4603 transitions. [2024-10-12 20:15:09,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-12 20:15:09,920 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:15:09,920 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:15:09,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 20:15:09,921 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:15:09,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:15:09,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1329950761, now seen corresponding path program 1 times [2024-10-12 20:15:09,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:15:09,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101281496] [2024-10-12 20:15:09,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:15:09,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:15:09,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:15:10,135 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-12 20:15:10,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:15:10,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101281496] [2024-10-12 20:15:10,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101281496] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:15:10,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:15:10,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:15:10,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495882778] [2024-10-12 20:15:10,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:15:10,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:15:10,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:15:10,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:15:10,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:15:10,140 INFO L87 Difference]: Start difference. First operand 3394 states and 4603 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:10,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:15:10,215 INFO L93 Difference]: Finished difference Result 10336 states and 13964 transitions. [2024-10-12 20:15:10,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:15:10,216 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2024-10-12 20:15:10,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:15:10,229 INFO L225 Difference]: With dead ends: 10336 [2024-10-12 20:15:10,229 INFO L226 Difference]: Without dead ends: 7079 [2024-10-12 20:15:10,235 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-12 20:15:10,235 INFO L432 NwaCegarLoop]: 514 mSDtfsCounter, 882 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 882 SdHoareTripleChecker+Valid, 1294 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:15:10,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [882 Valid, 1294 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:15:10,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7079 states. [2024-10-12 20:15:10,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7079 to 3516. [2024-10-12 20:15:10,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3516 states, 3514 states have (on average 1.3434832100170746) internal successors, (4721), 3515 states have internal predecessors, (4721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:10,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3516 states to 3516 states and 4721 transitions. [2024-10-12 20:15:10,298 INFO L78 Accepts]: Start accepts. Automaton has 3516 states and 4721 transitions. Word has length 104 [2024-10-12 20:15:10,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:15:10,299 INFO L471 AbstractCegarLoop]: Abstraction has 3516 states and 4721 transitions. [2024-10-12 20:15:10,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:10,299 INFO L276 IsEmpty]: Start isEmpty. Operand 3516 states and 4721 transitions. [2024-10-12 20:15:10,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-12 20:15:10,302 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:15:10,302 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:15:10,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 20:15:10,302 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:15:10,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:15:10,303 INFO L85 PathProgramCache]: Analyzing trace with hash 886793949, now seen corresponding path program 1 times [2024-10-12 20:15:10,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:15:10,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631521854] [2024-10-12 20:15:10,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:15:10,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:15:10,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:15:10,348 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-12 20:15:10,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:15:10,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631521854] [2024-10-12 20:15:10,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631521854] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:15:10,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:15:10,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:15:10,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482553205] [2024-10-12 20:15:10,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:15:10,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 20:15:10,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:15:10,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 20:15:10,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 20:15:10,350 INFO L87 Difference]: Start difference. First operand 3516 states and 4721 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:10,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:15:10,381 INFO L93 Difference]: Finished difference Result 5743 states and 7805 transitions. [2024-10-12 20:15:10,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 20:15:10,382 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2024-10-12 20:15:10,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:15:10,387 INFO L225 Difference]: With dead ends: 5743 [2024-10-12 20:15:10,387 INFO L226 Difference]: Without dead ends: 3528 [2024-10-12 20:15:10,390 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-12 20:15:10,390 INFO L432 NwaCegarLoop]: 330 mSDtfsCounter, 0 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:15:10,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 655 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:15:10,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3528 states. [2024-10-12 20:15:10,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3528 to 3528. [2024-10-12 20:15:10,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3528 states, 3526 states have (on average 1.3423142370958594) internal successors, (4733), 3527 states have internal predecessors, (4733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:10,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3528 states to 3528 states and 4733 transitions. [2024-10-12 20:15:10,459 INFO L78 Accepts]: Start accepts. Automaton has 3528 states and 4733 transitions. Word has length 105 [2024-10-12 20:15:10,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:15:10,459 INFO L471 AbstractCegarLoop]: Abstraction has 3528 states and 4733 transitions. [2024-10-12 20:15:10,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:10,460 INFO L276 IsEmpty]: Start isEmpty. Operand 3528 states and 4733 transitions. [2024-10-12 20:15:10,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-12 20:15:10,463 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:15:10,463 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:15:10,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 20:15:10,464 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:15:10,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:15:10,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1038898727, now seen corresponding path program 1 times [2024-10-12 20:15:10,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:15:10,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895966315] [2024-10-12 20:15:10,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:15:10,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:15:10,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:15:10,755 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-12 20:15:10,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:15:10,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895966315] [2024-10-12 20:15:10,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895966315] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:15:10,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:15:10,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 20:15:10,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070773112] [2024-10-12 20:15:10,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:15:10,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:15:10,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:15:10,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:15:10,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:15:10,757 INFO L87 Difference]: Start difference. First operand 3528 states and 4733 transitions. Second operand has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:10,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:15:10,843 INFO L93 Difference]: Finished difference Result 5078 states and 7171 transitions. [2024-10-12 20:15:10,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:15:10,843 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2024-10-12 20:15:10,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:15:10,849 INFO L225 Difference]: With dead ends: 5078 [2024-10-12 20:15:10,849 INFO L226 Difference]: Without dead ends: 3594 [2024-10-12 20:15:10,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-12 20:15:10,853 INFO L432 NwaCegarLoop]: 311 mSDtfsCounter, 1362 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1362 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:15:10,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1362 Valid, 646 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 20:15:10,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3594 states. [2024-10-12 20:15:10,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3594 to 3594. [2024-10-12 20:15:10,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3594 states, 3592 states have (on average 1.3346325167037862) internal successors, (4794), 3593 states have internal predecessors, (4794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:10,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3594 states to 3594 states and 4794 transitions. [2024-10-12 20:15:10,902 INFO L78 Accepts]: Start accepts. Automaton has 3594 states and 4794 transitions. Word has length 106 [2024-10-12 20:15:10,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:15:10,902 INFO L471 AbstractCegarLoop]: Abstraction has 3594 states and 4794 transitions. [2024-10-12 20:15:10,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:10,902 INFO L276 IsEmpty]: Start isEmpty. Operand 3594 states and 4794 transitions. [2024-10-12 20:15:10,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-12 20:15:10,906 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:15:10,906 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:15:10,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 20:15:10,906 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:15:10,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:15:10,907 INFO L85 PathProgramCache]: Analyzing trace with hash -652323368, now seen corresponding path program 1 times [2024-10-12 20:15:10,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:15:10,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640269481] [2024-10-12 20:15:10,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:15:10,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:15:10,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:15:11,166 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-12 20:15:11,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:15:11,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640269481] [2024-10-12 20:15:11,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640269481] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:15:11,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:15:11,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 20:15:11,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74469873] [2024-10-12 20:15:11,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:15:11,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:15:11,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:15:11,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:15:11,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:15:11,169 INFO L87 Difference]: Start difference. First operand 3594 states and 4794 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:11,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:15:11,240 INFO L93 Difference]: Finished difference Result 7364 states and 9767 transitions. [2024-10-12 20:15:11,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:15:11,241 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2024-10-12 20:15:11,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:15:11,246 INFO L225 Difference]: With dead ends: 7364 [2024-10-12 20:15:11,247 INFO L226 Difference]: Without dead ends: 4040 [2024-10-12 20:15:11,251 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-12 20:15:11,251 INFO L432 NwaCegarLoop]: 522 mSDtfsCounter, 267 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 1281 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:15:11,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 1281 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:15:11,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4040 states. [2024-10-12 20:15:11,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4040 to 3777. [2024-10-12 20:15:11,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3777 states, 3775 states have (on average 1.3189403973509934) internal successors, (4979), 3776 states have internal predecessors, (4979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:11,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3777 states to 3777 states and 4979 transitions. [2024-10-12 20:15:11,296 INFO L78 Accepts]: Start accepts. Automaton has 3777 states and 4979 transitions. Word has length 106 [2024-10-12 20:15:11,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:15:11,296 INFO L471 AbstractCegarLoop]: Abstraction has 3777 states and 4979 transitions. [2024-10-12 20:15:11,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:11,297 INFO L276 IsEmpty]: Start isEmpty. Operand 3777 states and 4979 transitions. [2024-10-12 20:15:11,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-12 20:15:11,300 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:15:11,300 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 20:15:11,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 20:15:11,301 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:15:11,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:15:11,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1348684746, now seen corresponding path program 1 times [2024-10-12 20:15:11,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:15:11,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722041444] [2024-10-12 20:15:11,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:15:11,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:15:11,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:15:11,508 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-12 20:15:11,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:15:11,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722041444] [2024-10-12 20:15:11,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722041444] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:15:11,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:15:11,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:15:11,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667230998] [2024-10-12 20:15:11,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:15:11,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 20:15:11,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:15:11,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 20:15:11,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:15:11,510 INFO L87 Difference]: Start difference. First operand 3777 states and 4979 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:11,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:15:11,549 INFO L93 Difference]: Finished difference Result 4892 states and 6553 transitions. [2024-10-12 20:15:11,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 20:15:11,550 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2024-10-12 20:15:11,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:15:11,553 INFO L225 Difference]: With dead ends: 4892 [2024-10-12 20:15:11,553 INFO L226 Difference]: Without dead ends: 3290 [2024-10-12 20:15:11,554 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 20:15:11,555 INFO L432 NwaCegarLoop]: 341 mSDtfsCounter, 0 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1003 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-12 20:15:11,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1003 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 20:15:11,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3290 states. [2024-10-12 20:15:11,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3290 to 3287. [2024-10-12 20:15:11,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3287 states, 3285 states have (on average 1.3168949771689498) internal successors, (4326), 3286 states have internal predecessors, (4326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:11,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3287 states to 3287 states and 4326 transitions. [2024-10-12 20:15:11,585 INFO L78 Accepts]: Start accepts. Automaton has 3287 states and 4326 transitions. Word has length 106 [2024-10-12 20:15:11,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:15:11,585 INFO L471 AbstractCegarLoop]: Abstraction has 3287 states and 4326 transitions. [2024-10-12 20:15:11,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:11,585 INFO L276 IsEmpty]: Start isEmpty. Operand 3287 states and 4326 transitions. [2024-10-12 20:15:11,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-12 20:15:11,588 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:15:11,588 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:15:11,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-12 20:15:11,588 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:15:11,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:15:11,589 INFO L85 PathProgramCache]: Analyzing trace with hash -2032699664, now seen corresponding path program 1 times [2024-10-12 20:15:11,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:15:11,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949172127] [2024-10-12 20:15:11,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:15:11,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:15:11,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:15:12,966 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-12 20:15:12,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:15:12,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949172127] [2024-10-12 20:15:12,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949172127] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:15:12,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:15:12,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-10-12 20:15:12,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732748507] [2024-10-12 20:15:12,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:15:12,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-12 20:15:12,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:15:12,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-12 20:15:12,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2024-10-12 20:15:12,970 INFO L87 Difference]: Start difference. First operand 3287 states and 4326 transitions. Second operand has 21 states, 21 states have (on average 5.142857142857143) internal successors, (108), 20 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:16,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:15:16,203 INFO L93 Difference]: Finished difference Result 6335 states and 8681 transitions. [2024-10-12 20:15:16,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-12 20:15:16,204 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.142857142857143) internal successors, (108), 20 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2024-10-12 20:15:16,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:15:16,212 INFO L225 Difference]: With dead ends: 6335 [2024-10-12 20:15:16,212 INFO L226 Difference]: Without dead ends: 5672 [2024-10-12 20:15:16,215 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=260, Invalid=1000, Unknown=0, NotChecked=0, Total=1260 [2024-10-12 20:15:16,215 INFO L432 NwaCegarLoop]: 418 mSDtfsCounter, 2548 mSDsluCounter, 4576 mSDsCounter, 0 mSdLazyCounter, 1982 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2548 SdHoareTripleChecker+Valid, 4994 SdHoareTripleChecker+Invalid, 1992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 20:15:16,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2548 Valid, 4994 Invalid, 1992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1982 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 20:15:16,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5672 states. [2024-10-12 20:15:16,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5672 to 3764. [2024-10-12 20:15:16,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3764 states, 3762 states have (on average 1.3080808080808082) internal successors, (4921), 3763 states have internal predecessors, (4921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:16,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3764 states to 3764 states and 4921 transitions. [2024-10-12 20:15:16,277 INFO L78 Accepts]: Start accepts. Automaton has 3764 states and 4921 transitions. Word has length 108 [2024-10-12 20:15:16,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:15:16,278 INFO L471 AbstractCegarLoop]: Abstraction has 3764 states and 4921 transitions. [2024-10-12 20:15:16,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.142857142857143) internal successors, (108), 20 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:15:16,278 INFO L276 IsEmpty]: Start isEmpty. Operand 3764 states and 4921 transitions. [2024-10-12 20:15:16,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-12 20:15:16,282 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:15:16,282 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:15:16,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-12 20:15:16,283 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 20:15:16,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:15:16,283 INFO L85 PathProgramCache]: Analyzing trace with hash -187671368, now seen corresponding path program 1 times [2024-10-12 20:15:16,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:15:16,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459296070] [2024-10-12 20:15:16,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:15:16,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:15:16,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 20:15:16,340 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 20:15:16,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 20:15:16,426 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 20:15:16,426 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-12 20:15:16,427 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-10-12 20:15:16,429 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-12 20:15:16,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-12 20:15:16,432 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] [2024-10-12 20:15:16,545 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 20:15:16,548 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 08:15:16 BoogieIcfgContainer [2024-10-12 20:15:16,548 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 20:15:16,549 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 20:15:16,549 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 20:15:16,549 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 20:15:16,549 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:15:04" (3/4) ... [2024-10-12 20:15:16,550 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-12 20:15:16,702 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 20:15:16,702 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 20:15:16,703 INFO L158 Benchmark]: Toolchain (without parser) took 13540.97ms. Allocated memory was 155.2MB in the beginning and 541.1MB in the end (delta: 385.9MB). Free memory was 83.4MB in the beginning and 484.5MB in the end (delta: -401.1MB). Peak memory consumption was 293.1MB. Max. memory is 16.1GB. [2024-10-12 20:15:16,703 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 155.2MB. Free memory was 107.5MB in the beginning and 107.4MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 20:15:16,703 INFO L158 Benchmark]: CACSL2BoogieTranslator took 499.80ms. Allocated memory was 155.2MB in the beginning and 213.9MB in the end (delta: 58.7MB). Free memory was 83.2MB in the beginning and 178.0MB in the end (delta: -94.8MB). Peak memory consumption was 36.5MB. Max. memory is 16.1GB. [2024-10-12 20:15:16,704 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.84ms. Allocated memory is still 213.9MB. Free memory was 178.0MB in the beginning and 172.8MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-12 20:15:16,704 INFO L158 Benchmark]: Boogie Preprocessor took 67.14ms. Allocated memory is still 213.9MB. Free memory was 172.8MB in the beginning and 167.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-12 20:15:16,704 INFO L158 Benchmark]: RCFGBuilder took 1057.57ms. Allocated memory is still 213.9MB. Free memory was 167.5MB in the beginning and 86.8MB in the end (delta: 80.7MB). Peak memory consumption was 81.8MB. Max. memory is 16.1GB. [2024-10-12 20:15:16,704 INFO L158 Benchmark]: TraceAbstraction took 11702.55ms. Allocated memory was 213.9MB in the beginning and 541.1MB in the end (delta: 327.2MB). Free memory was 85.7MB in the beginning and 210.9MB in the end (delta: -125.1MB). Peak memory consumption was 202.0MB. Max. memory is 16.1GB. [2024-10-12 20:15:16,704 INFO L158 Benchmark]: Witness Printer took 153.78ms. Allocated memory is still 541.1MB. Free memory was 210.9MB in the beginning and 484.5MB in the end (delta: -273.6MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-10-12 20:15:16,706 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.24ms. Allocated memory is still 155.2MB. Free memory was 107.5MB in the beginning and 107.4MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 499.80ms. Allocated memory was 155.2MB in the beginning and 213.9MB in the end (delta: 58.7MB). Free memory was 83.2MB in the beginning and 178.0MB in the end (delta: -94.8MB). Peak memory consumption was 36.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.84ms. Allocated memory is still 213.9MB. Free memory was 178.0MB in the beginning and 172.8MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.14ms. Allocated memory is still 213.9MB. Free memory was 172.8MB in the beginning and 167.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1057.57ms. Allocated memory is still 213.9MB. Free memory was 167.5MB in the beginning and 86.8MB in the end (delta: 80.7MB). Peak memory consumption was 81.8MB. Max. memory is 16.1GB. * TraceAbstraction took 11702.55ms. Allocated memory was 213.9MB in the beginning and 541.1MB in the end (delta: 327.2MB). Free memory was 85.7MB in the beginning and 210.9MB in the end (delta: -125.1MB). Peak memory consumption was 202.0MB. Max. memory is 16.1GB. * Witness Printer took 153.78ms. Allocated memory is still 541.1MB. Free memory was 210.9MB in the beginning and 484.5MB in the end (delta: -273.6MB). Peak memory consumption was 31.5MB. 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: 527]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L10] int __return_main; [L25] msg_t nomsg = (msg_t )-1; [L26] port_t p12 = 0; [L27] char p12_old = '\x0'; [L28] char p12_new = '\x0'; [L29] _Bool ep12 = 0; [L30] port_t p13 = 0; [L31] char p13_old = '\x0'; [L32] char p13_new = '\x0'; [L33] _Bool ep13 = 0; [L34] port_t p21 = 0; [L35] char p21_old = '\x0'; [L36] char p21_new = '\x0'; [L37] _Bool ep21 = 0; [L38] port_t p23 = 0; [L39] char p23_old = '\x0'; [L40] char p23_new = '\x0'; [L41] _Bool ep23 = 0; [L42] port_t p31 = 0; [L43] char p31_old = '\x0'; [L44] char p31_new = '\x0'; [L45] _Bool ep31 = 0; [L46] port_t p32 = 0; [L47] char p32_old = '\x0'; [L48] char p32_new = '\x0'; [L49] _Bool ep32 = 0; [L50] char id1 = '\x0'; [L51] char r1 = '\x0'; [L52] char st1 = '\x0'; [L53] char nl1 = '\x0'; [L54] char m1 = '\x0'; [L55] char max1 = '\x0'; [L56] _Bool mode1 = 0; [L57] char id2 = '\x0'; [L58] char r2 = '\x0'; [L59] char st2 = '\x0'; [L60] char nl2 = '\x0'; [L61] char m2 = '\x0'; [L62] char max2 = '\x0'; [L63] _Bool mode2 = 0; [L64] char id3 = '\x0'; [L65] char r3 = '\x0'; [L66] char st3 = '\x0'; [L67] char nl3 = '\x0'; [L68] char m3 = '\x0'; [L69] char max3 = '\x0'; [L70] _Bool mode3 = 0; [L74] void (*nodes[3])() = { &node1, &node2, &node3 }; [L78] int __return_1131; [L79] int __return_1259; [L80] int __return_1679; [L81] int __return_1378; [L82] int __tmp_1379_0; [L83] int __return_1487; [L84] int __return_1392; [L87] int main__c1; [L88] int main__i2; [L89] main__c1 = 0 [L90] ep12 = __VERIFIER_nondet_bool() [L91] ep13 = __VERIFIER_nondet_bool() [L92] ep21 = __VERIFIER_nondet_bool() [L93] ep23 = __VERIFIER_nondet_bool() [L94] ep31 = __VERIFIER_nondet_bool() [L95] ep32 = __VERIFIER_nondet_bool() [L96] id1 = __VERIFIER_nondet_char() [L97] r1 = __VERIFIER_nondet_char() [L98] st1 = __VERIFIER_nondet_char() [L99] nl1 = __VERIFIER_nondet_char() [L100] m1 = __VERIFIER_nondet_char() [L101] max1 = __VERIFIER_nondet_char() [L102] mode1 = __VERIFIER_nondet_bool() [L103] id2 = __VERIFIER_nondet_char() [L104] r2 = __VERIFIER_nondet_char() [L105] st2 = __VERIFIER_nondet_char() [L106] nl2 = __VERIFIER_nondet_char() [L107] m2 = __VERIFIER_nondet_char() [L108] max2 = __VERIFIER_nondet_char() [L109] mode2 = __VERIFIER_nondet_bool() [L110] id3 = __VERIFIER_nondet_char() [L111] r3 = __VERIFIER_nondet_char() [L112] st3 = __VERIFIER_nondet_char() [L113] nl3 = __VERIFIER_nondet_char() [L114] m3 = __VERIFIER_nondet_char() [L115] max3 = __VERIFIER_nondet_char() [L116] mode3 = __VERIFIER_nondet_bool() [L118] _Bool init__r121; [L119] _Bool init__r131; [L120] _Bool init__r211; [L121] _Bool init__r231; [L122] _Bool init__r311; [L123] _Bool init__r321; [L124] _Bool init__r122; [L125] int init__tmp; [L126] _Bool init__r132; [L127] int init__tmp___0; [L128] _Bool init__r212; [L129] int init__tmp___1; [L130] _Bool init__r232; [L131] int init__tmp___2; [L132] _Bool init__r312; [L133] int init__tmp___3; [L134] _Bool init__r322; [L135] int init__tmp___4; [L136] int init__tmp___5; [L137] init__r121 = ep12 [L138] init__r131 = ep13 [L139] init__r211 = ep21 [L140] init__r231 = ep23 [L141] init__r311 = ep31 [L142] init__r321 = ep32 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r131=1, init__r211=1, init__r231=0, init__r311=0, init__r321=1, m1=0, m2=0, m3=0, max1=127, max2=4, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L143] COND FALSE !(!(init__r121 == 0)) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r131=1, init__r211=1, init__r231=0, init__r311=0, init__r321=1, m1=0, m2=0, m3=0, max1=127, max2=4, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L1812] COND TRUE !(init__r131 == 0) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r131=1, init__r211=1, init__r231=0, init__r311=0, init__r321=1, m1=0, m2=0, m3=0, max1=127, max2=4, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L1814] COND TRUE !(ep32 == 0) [L1816] init__tmp = 1 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r131=1, init__r211=1, init__r231=0, init__r311=0, init__r321=1, init__tmp=1, m1=0, m2=0, m3=0, max1=127, max2=4, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L147] init__r122 = (_Bool)init__tmp VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r122=1, init__r131=1, init__r211=1, init__r231=0, init__r311=0, init__r321=1, m1=0, m2=0, m3=0, max1=127, max2=4, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L148] COND TRUE !(init__r131 == 0) [L150] init__tmp___0 = 1 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r122=1, init__r211=1, init__r231=0, init__r311=0, init__r321=1, init__tmp___0=1, m1=0, m2=0, m3=0, max1=127, max2=4, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L152] init__r132 = (_Bool)init__tmp___0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r122=1, init__r132=1, init__r211=1, init__r231=0, init__r311=0, init__r321=1, m1=0, m2=0, m3=0, max1=127, max2=4, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L153] COND TRUE !(init__r211 == 0) [L155] init__tmp___1 = 1 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r122=1, init__r132=1, init__r211=1, init__r231=0, init__r311=0, init__r321=1, init__tmp___1=1, m1=0, m2=0, m3=0, max1=127, max2=4, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L157] init__r212 = (_Bool)init__tmp___1 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r122=1, init__r132=1, init__r211=1, init__r212=1, init__r231=0, init__r311=0, init__r321=1, m1=0, m2=0, m3=0, max1=127, max2=4, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L158] COND FALSE !(!(init__r231 == 0)) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r122=1, init__r132=1, init__r211=1, init__r212=1, init__r311=0, init__r321=1, m1=0, m2=0, m3=0, max1=127, max2=4, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L1743] COND TRUE !(init__r211 == 0) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r311=0, init__r321=1, m1=0, m2=0, m3=0, max1=127, max2=4, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L1745] COND TRUE !(ep13 == 0) [L1747] init__tmp___2 = 1 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r311=0, init__r321=1, init__tmp___2=1, m1=0, m2=0, m3=0, max1=127, max2=4, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L162] init__r232 = (_Bool)init__tmp___2 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r321=1, m1=0, m2=0, m3=0, max1=127, max2=4, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L163] COND FALSE !(!(init__r311 == 0)) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r321=1, m1=0, m2=0, m3=0, max1=127, max2=4, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L1720] COND TRUE !(init__r321 == 0) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r321=1, m1=0, m2=0, m3=0, max1=127, max2=4, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L1722] COND TRUE !(ep21 == 0) [L1724] init__tmp___3 = 1 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r321=1, init__tmp___3=1, m1=0, m2=0, m3=0, max1=127, max2=4, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L167] init__r312 = (_Bool)init__tmp___3 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r321=1, m1=0, m2=0, m3=0, max1=127, max2=4, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L168] COND TRUE !(init__r321 == 0) [L170] init__tmp___4 = 1 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__tmp___4=1, m1=0, m2=0, m3=0, max1=127, max2=4, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L172] init__r322 = (_Bool)init__tmp___4 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=127, max2=4, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L173] COND TRUE ((int)id1) != ((int)id2) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=127, max2=4, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L175] COND TRUE ((int)id1) != ((int)id3) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=127, max2=4, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L177] COND TRUE ((int)id2) != ((int)id3) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=127, max2=4, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L179] COND TRUE ((int)id1) >= 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=127, max2=4, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L181] COND TRUE ((int)id2) >= 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=127, max2=4, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L183] COND TRUE ((int)id3) >= 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=127, max2=4, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L185] COND TRUE ((int)r1) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=127, max2=4, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L187] COND TRUE ((int)r2) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=127, max2=4, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L189] COND TRUE ((int)r3) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r122=1, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=127, max2=4, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L191] COND TRUE !(init__r122 == 0) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r132=1, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=127, max2=4, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L193] COND TRUE !(init__r132 == 0) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r212=1, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=127, max2=4, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L195] COND TRUE !(init__r212 == 0) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r232=1, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=127, max2=4, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L197] COND TRUE !(init__r232 == 0) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r311=0, init__r312=1, init__r322=1, m1=0, m2=0, m3=0, max1=127, max2=4, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L199] COND TRUE !(init__r312 == 0) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r311=0, init__r322=1, m1=0, m2=0, m3=0, max1=127, max2=4, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L201] COND TRUE !(init__r322 == 0) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=127, max2=4, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L203] COND TRUE ((int)max1) == ((int)id1) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=127, max2=4, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L205] COND TRUE ((int)max2) == ((int)id2) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=127, max2=4, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L207] COND TRUE ((int)max3) == ((int)id3) VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=127, max2=4, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L209] COND TRUE ((int)st1) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=127, max2=4, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L211] COND TRUE ((int)st2) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=127, max2=4, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L213] COND TRUE ((int)st3) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=127, max2=4, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L215] COND TRUE ((int)nl1) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=127, max2=4, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L217] COND TRUE ((int)nl2) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=127, max2=4, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L219] COND TRUE ((int)nl3) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=127, max2=4, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L221] COND TRUE ((int)mode1) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=127, max2=4, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L223] COND TRUE ((int)mode2) == 0 VAL [__return_1131=0, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, max1=127, max2=4, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L225] COND TRUE ((int)mode3) == 0 [L227] init__tmp___5 = 1 [L228] __return_1131 = init__tmp___5 [L229] main__i2 = __return_1131 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=1, max1=127, max2=4, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=0, p12_old=0, p13=0, p13_new=0, p13_old=0, p21=0, p21_new=0, p21_old=0, p23=0, p23_new=0, p23_old=0, p31=0, p31_new=0, p31_old=0, p32=0, p32_new=0, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L230] COND TRUE main__i2 != 0 [L232] p12_old = nomsg [L233] p12_new = nomsg [L234] p13_old = nomsg [L235] p13_new = nomsg [L236] p21_old = nomsg [L237] p21_new = nomsg [L238] p23_old = nomsg [L239] p23_new = nomsg [L240] p31_old = nomsg [L241] p31_new = nomsg [L242] p32_old = nomsg [L243] p32_new = nomsg [L244] main__i2 = 0 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=4, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L245] COND TRUE main__i2 < 6 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=4, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L248] COND FALSE !(!(mode1 == 0)) VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=4, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L254] COND TRUE ((int)r1) < 2 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=4, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L256] COND FALSE !(!(ep12 == 0)) VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=4, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L267] COND TRUE !(ep13 == 0) [L269] int node1____CPAchecker_TMP_1; VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=4, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L270] COND TRUE max1 != nomsg VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=4, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L272] COND TRUE p13_new == nomsg [L274] node1____CPAchecker_TMP_1 = max1 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=4, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, node1____CPAchecker_TMP_1=127, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L276] p13_new = node1____CPAchecker_TMP_1 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=4, max3=0, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L278] mode1 = 1 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=4, max3=0, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L280] COND FALSE !(!(mode2 == 0)) VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=4, max3=0, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L286] COND TRUE ((int)r2) < 2 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=4, max3=0, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L288] COND TRUE !(ep21 == 0) [L290] int node2____CPAchecker_TMP_0; VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=4, max3=0, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L291] COND TRUE max2 != nomsg VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=4, max3=0, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L293] COND TRUE p21_new == nomsg [L295] node2____CPAchecker_TMP_0 = max2 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=4, max3=0, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, node2____CPAchecker_TMP_0=4, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L297] p21_new = node2____CPAchecker_TMP_0 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=4, max3=0, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=4, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L299] COND FALSE !(!(ep23 == 0)) VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=4, max3=0, mode1=1, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=4, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L310] mode2 = 1 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=4, max3=0, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=4, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L312] COND FALSE !(!(mode3 == 0)) VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=4, max3=0, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=4, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L318] COND TRUE ((int)r3) < 2 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=4, max3=0, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=4, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L320] COND FALSE !(!(ep31 == 0)) VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=4, max3=0, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=4, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L331] COND TRUE !(ep32 == 0) [L333] int node3____CPAchecker_TMP_1; VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=4, max3=0, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=4, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L334] COND TRUE max3 != nomsg VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=4, max3=0, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=4, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L336] COND TRUE p32_new == nomsg [L338] node3____CPAchecker_TMP_1 = max3 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=4, max3=0, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, node3____CPAchecker_TMP_1=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=4, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L340] p32_new = node3____CPAchecker_TMP_1 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=4, max3=0, mode1=1, mode2=1, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=127, p13_old=-1, p21=0, p21_new=4, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=0, p32_old=-1, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L342] mode3 = 1 [L343] p12_old = p12_new [L344] p12_new = nomsg [L345] p13_old = p13_new [L346] p13_new = nomsg [L347] p21_old = p21_new [L348] p21_new = nomsg [L349] p23_old = p23_new [L350] p23_new = nomsg [L351] p31_old = p31_new [L352] p31_new = nomsg [L353] p32_old = p32_new [L354] p32_new = nomsg [L356] int check__tmp; VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=4, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L357] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=4, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L359] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=4, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L361] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=4, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L363] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=4, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L365] COND FALSE !(((int)r1) >= 2) VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=4, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L371] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) == 0 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=4, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L373] COND TRUE ((int)r1) < 2 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=4, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L375] COND FALSE !(((int)r1) >= 2) VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=4, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L381] COND TRUE ((((int)nl1) + ((int)nl2)) + ((int)nl3)) == 0 VAL [__return_1131=1, __return_1259=0, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=4, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L383] COND TRUE ((int)r1) < 2 [L385] check__tmp = 1 [L386] __return_1259 = check__tmp [L387] main__c1 = __return_1259 [L389] _Bool __tmp_1; [L390] __tmp_1 = main__c1 [L391] _Bool assert__arg; [L392] assert__arg = __tmp_1 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, assert__arg=1, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main__i2=0, max1=127, max2=4, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L393] COND FALSE !(assert__arg == 0) [L399] int main____CPAchecker_TMP_0 = main__i2; [L400] main__i2 = main__i2 + 1 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=4, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L401] COND TRUE main__i2 < 6 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=4, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=0, r2=0, r3=0, st1=0, st2=0, st3=0] [L404] COND TRUE !(mode1 == 0) [L406] r1 = (char)(((int)r1) + 1) VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r311=0, m1=0, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=4, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=4, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L407] COND TRUE !(ep21 == 0) [L409] m1 = p21_old [L410] p21_old = nomsg VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r311=0, m1=4, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=4, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L411] COND FALSE !(((int)m1) > ((int)max1)) VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r311=0, m1=4, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=4, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L415] COND FALSE !(!(ep31 == 0)) VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r311=0, m1=4, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=4, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L423] COND TRUE ((int)r1) == 1 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r311=0, m1=4, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=4, max3=0, mode1=1, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=1, r2=0, r3=0, st1=0, st2=0, st3=0] [L425] COND TRUE ((int)max1) == ((int)id1) [L427] st1 = 1 [L428] mode1 = 0 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r311=0, m1=4, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=4, max3=0, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=1, r2=0, r3=0, st1=1, st2=0, st3=0] [L430] COND TRUE !(mode2 == 0) [L432] r2 = (char)(((int)r2) + 1) VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r311=0, m1=4, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=4, max3=0, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L433] COND FALSE !(!(ep12 == 0)) VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r311=0, m1=4, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=4, max3=0, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=0, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L441] COND TRUE !(ep32 == 0) [L443] m2 = p32_old [L444] p32_old = nomsg VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r311=0, m1=4, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=4, max3=0, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L445] COND FALSE !(((int)m2) > ((int)max2)) VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r311=0, m1=4, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=4, max3=0, mode1=0, mode2=1, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L449] COND FALSE !(((int)r2) == 2) [L455] mode2 = 0 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r311=0, m1=4, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=4, max3=0, mode1=0, mode2=0, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=0, st1=1, st2=0, st3=0] [L457] COND TRUE !(mode3 == 0) [L459] r3 = (char)(((int)r3) + 1) VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r311=0, m1=4, m2=0, m3=0, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=4, max3=0, mode1=0, mode2=0, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=127, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L460] COND TRUE !(ep13 == 0) [L462] m3 = p13_old [L463] p13_old = nomsg VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r311=0, m1=4, m2=0, m3=127, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=4, max3=0, mode1=0, mode2=0, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L464] COND TRUE ((int)m3) > ((int)max3) [L466] max3 = m3 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r311=0, m1=4, m2=0, m3=127, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=4, max3=127, mode1=0, mode2=0, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L468] COND FALSE !(!(ep23 == 0)) VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r311=0, m1=4, m2=0, m3=127, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=4, max3=127, mode1=0, mode2=0, mode3=1, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L476] COND FALSE !(((int)r3) == 2) [L482] mode3 = 0 [L483] p12_old = p12_new [L484] p12_new = nomsg [L485] p13_old = p13_new [L486] p13_new = nomsg [L487] p21_old = p21_new [L488] p21_new = nomsg [L489] p23_old = p23_new [L490] p23_new = nomsg [L491] p31_old = p31_new [L492] p31_new = nomsg [L493] p32_old = p32_new [L494] p32_new = nomsg [L496] int check__tmp; VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r311=0, m1=4, m2=0, m3=127, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=4, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L497] COND TRUE ((((int)st1) + ((int)st2)) + ((int)st3)) <= 1 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r311=0, m1=4, m2=0, m3=127, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=4, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L499] COND TRUE (((int)st1) + ((int)nl1)) <= 1 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r311=0, m1=4, m2=0, m3=127, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=4, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L501] COND TRUE (((int)st2) + ((int)nl2)) <= 1 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r311=0, m1=4, m2=0, m3=127, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=4, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L503] COND TRUE (((int)st3) + ((int)nl3)) <= 1 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r311=0, m1=4, m2=0, m3=127, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=4, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L505] COND FALSE !(((int)r1) >= 2) VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r311=0, m1=4, m2=0, m3=127, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=4, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L511] COND FALSE !(((((int)st1) + ((int)st2)) + ((int)st3)) == 0) [L517] check__tmp = 0 [L518] __return_1679 = check__tmp [L519] main__c1 = __return_1679 [L521] _Bool __tmp_2; [L522] __tmp_2 = main__c1 [L523] _Bool assert__arg; [L524] assert__arg = __tmp_2 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, assert__arg=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r311=0, m1=4, m2=0, m3=127, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=4, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L525] COND TRUE assert__arg == 0 VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r311=0, m1=4, m2=0, m3=127, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=4, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] [L527] reach_error() VAL [__return_1131=1, __return_1259=1, __return_1378=0, __return_1392=0, __return_1487=0, __return_1679=0, __return_main=0, __tmp_1379_0=0, ep12=0, ep13=1, ep21=1, ep23=0, ep31=0, ep32=1, id1=127, id2=4, id3=0, init__r121=0, init__r311=0, m1=4, m2=0, m3=127, main____CPAchecker_TMP_0=0, main__i2=1, max1=127, max2=4, max3=127, mode1=0, mode2=0, mode3=0, nl1=0, nl2=0, nl3=0, nomsg=-1, p12=0, p12_new=-1, p12_old=-1, p13=0, p13_new=-1, p13_old=-1, p21=0, p21_new=-1, p21_old=-1, p23=0, p23_new=-1, p23_old=-1, p31=0, p31_new=-1, p31_old=-1, p32=0, p32_new=-1, p32_old=-1, r1=1, r2=1, r3=1, st1=1, st2=0, st3=0] - UnprovableResult [Line: 728]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 235 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 11.5s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8956 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8956 mSDsluCounter, 24208 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14792 mSDsCounter, 145 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2427 IncrementalHoareTripleChecker+Invalid, 2572 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 145 mSolverCounterUnsat, 9416 mSDtfsCounter, 2427 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 112 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3882occurred in iteration=14, InterpolantAutomatonStates: 102, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 21 MinimizatonAttempts, 8212 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 2180 NumberOfCodeBlocks, 2180 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 2051 ConstructedInterpolants, 0 QuantifiedInterpolants, 8950 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 0/0 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-12 20:15:16,741 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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