./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/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 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/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.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 2354c4d30c0335eb0a6c6e03cf8d087a440768412264986840e048ded8afea74 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 01:18:22,800 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 01:18:22,886 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 01:18:22,894 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 01:18:22,894 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 01:18:22,923 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 01:18:22,923 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 01:18:22,924 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 01:18:22,924 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 01:18:22,925 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 01:18:22,925 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 01:18:22,925 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 01:18:22,926 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 01:18:22,926 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 01:18:22,927 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 01:18:22,927 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 01:18:22,927 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 01:18:22,928 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 01:18:22,928 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 01:18:22,928 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 01:18:22,928 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 01:18:22,929 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 01:18:22,929 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 01:18:22,930 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 01:18:22,930 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 01:18:22,930 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 01:18:22,930 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 01:18:22,931 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 01:18:22,931 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 01:18:22,931 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 01:18:22,932 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 01:18:22,932 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 01:18:22,932 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 01:18:22,933 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 01:18:22,933 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 01:18:22,933 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 01:18:22,933 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 01:18:22,934 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 01:18:22,934 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 01:18:22,934 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 01:18:22,935 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 01:18:22,935 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 01:18:22,935 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 -> 2354c4d30c0335eb0a6c6e03cf8d087a440768412264986840e048ded8afea74 [2024-10-24 01:18:23,195 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 01:18:23,224 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 01:18:23,226 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 01:18:23,227 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 01:18:23,228 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 01:18:23,230 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c [2024-10-24 01:18:24,592 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 01:18:24,806 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 01:18:24,807 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c [2024-10-24 01:18:24,817 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f929adaf/471f6bd102c240cfbb586a4cabafb4e6/FLAG879db0a5d [2024-10-24 01:18:24,828 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f929adaf/471f6bd102c240cfbb586a4cabafb4e6 [2024-10-24 01:18:24,831 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 01:18:24,832 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 01:18:24,833 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 01:18:24,833 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 01:18:24,838 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 01:18:24,838 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:18:24" (1/1) ... [2024-10-24 01:18:24,839 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d0bc9b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:18:24, skipping insertion in model container [2024-10-24 01:18:24,839 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:18:24" (1/1) ... [2024-10-24 01:18:24,875 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 01:18:25,148 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/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c[14700,14713] [2024-10-24 01:18:25,154 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 01:18:25,166 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 01:18:25,240 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/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c[14700,14713] [2024-10-24 01:18:25,242 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 01:18:25,266 INFO L204 MainTranslator]: Completed translation [2024-10-24 01:18:25,266 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:18:25 WrapperNode [2024-10-24 01:18:25,267 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 01:18:25,268 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 01:18:25,269 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 01:18:25,269 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 01:18:25,276 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:18:25" (1/1) ... [2024-10-24 01:18:25,289 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:18:25" (1/1) ... [2024-10-24 01:18:25,329 INFO L138 Inliner]: procedures = 32, calls = 48, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 510 [2024-10-24 01:18:25,330 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 01:18:25,331 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 01:18:25,331 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 01:18:25,331 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 01:18:25,345 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:18:25" (1/1) ... [2024-10-24 01:18:25,345 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:18:25" (1/1) ... [2024-10-24 01:18:25,356 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:18:25" (1/1) ... [2024-10-24 01:18:25,385 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-24 01:18:25,385 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:18:25" (1/1) ... [2024-10-24 01:18:25,386 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:18:25" (1/1) ... [2024-10-24 01:18:25,401 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:18:25" (1/1) ... [2024-10-24 01:18:25,414 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:18:25" (1/1) ... [2024-10-24 01:18:25,417 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:18:25" (1/1) ... [2024-10-24 01:18:25,419 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:18:25" (1/1) ... [2024-10-24 01:18:25,428 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 01:18:25,429 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 01:18:25,429 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 01:18:25,430 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 01:18:25,430 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:18:25" (1/1) ... [2024-10-24 01:18:25,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 01:18:25,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 01:18:25,476 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-24 01:18:25,483 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-24 01:18:25,529 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2024-10-24 01:18:25,529 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2024-10-24 01:18:25,530 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 01:18:25,530 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2024-10-24 01:18:25,530 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2024-10-24 01:18:25,531 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2024-10-24 01:18:25,531 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2024-10-24 01:18:25,532 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2024-10-24 01:18:25,532 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2024-10-24 01:18:25,533 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 01:18:25,533 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 01:18:25,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 01:18:25,533 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2024-10-24 01:18:25,533 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2024-10-24 01:18:25,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 01:18:25,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 01:18:25,534 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2024-10-24 01:18:25,534 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2024-10-24 01:18:25,654 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 01:18:25,655 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 01:18:26,303 INFO L? ?]: Removed 114 outVars from TransFormulas that were not future-live. [2024-10-24 01:18:26,303 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 01:18:26,363 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 01:18:26,365 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 01:18:26,365 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:18:26 BoogieIcfgContainer [2024-10-24 01:18:26,366 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 01:18:26,368 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 01:18:26,368 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 01:18:26,371 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 01:18:26,372 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 01:18:24" (1/3) ... [2024-10-24 01:18:26,373 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b1ecf02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:18:26, skipping insertion in model container [2024-10-24 01:18:26,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:18:25" (2/3) ... [2024-10-24 01:18:26,373 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b1ecf02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:18:26, skipping insertion in model container [2024-10-24 01:18:26,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:18:26" (3/3) ... [2024-10-24 01:18:26,375 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c [2024-10-24 01:18:26,392 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 01:18:26,393 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 01:18:26,466 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 01:18:26,472 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;@50dee658, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 01:18:26,472 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 01:18:26,477 INFO L276 IsEmpty]: Start isEmpty. Operand has 171 states, 131 states have (on average 1.5954198473282444) internal successors, (209), 132 states have internal predecessors, (209), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-24 01:18:26,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-24 01:18:26,483 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:26,483 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] [2024-10-24 01:18:26,484 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:26,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:26,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1288314428, now seen corresponding path program 1 times [2024-10-24 01:18:26,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:26,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834216709] [2024-10-24 01:18:26,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:26,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:26,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:26,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 01:18:26,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:26,748 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-24 01:18:26,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:26,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834216709] [2024-10-24 01:18:26,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834216709] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:26,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:26,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 01:18:26,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80987080] [2024-10-24 01:18:26,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:26,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 01:18:26,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:26,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 01:18:26,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 01:18:26,785 INFO L87 Difference]: Start difference. First operand has 171 states, 131 states have (on average 1.5954198473282444) internal successors, (209), 132 states have internal predecessors, (209), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 01:18:26,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:26,846 INFO L93 Difference]: Finished difference Result 327 states and 543 transitions. [2024-10-24 01:18:26,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 01:18:26,851 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-10-24 01:18:26,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:26,861 INFO L225 Difference]: With dead ends: 327 [2024-10-24 01:18:26,861 INFO L226 Difference]: Without dead ends: 169 [2024-10-24 01:18:26,866 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 01:18:26,869 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 262 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-24 01:18:26,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 262 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:18:26,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-10-24 01:18:26,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2024-10-24 01:18:26,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 130 states have (on average 1.5692307692307692) internal successors, (204), 130 states have internal predecessors, (204), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-24 01:18:26,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 266 transitions. [2024-10-24 01:18:26,919 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 266 transitions. Word has length 23 [2024-10-24 01:18:26,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:26,920 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 266 transitions. [2024-10-24 01:18:26,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 01:18:26,920 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 266 transitions. [2024-10-24 01:18:26,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-24 01:18:26,922 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:26,922 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] [2024-10-24 01:18:26,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 01:18:26,923 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:26,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:26,923 INFO L85 PathProgramCache]: Analyzing trace with hash -705830278, now seen corresponding path program 1 times [2024-10-24 01:18:26,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:26,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320546959] [2024-10-24 01:18:26,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:26,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:26,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:27,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-24 01:18:27,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:27,231 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-24 01:18:27,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:27,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320546959] [2024-10-24 01:18:27,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320546959] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:27,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:27,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 01:18:27,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470159425] [2024-10-24 01:18:27,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:27,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 01:18:27,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:27,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 01:18:27,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 01:18:27,240 INFO L87 Difference]: Start difference. First operand 169 states and 266 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 01:18:27,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:27,434 INFO L93 Difference]: Finished difference Result 432 states and 688 transitions. [2024-10-24 01:18:27,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 01:18:27,436 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-10-24 01:18:27,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:27,442 INFO L225 Difference]: With dead ends: 432 [2024-10-24 01:18:27,442 INFO L226 Difference]: Without dead ends: 276 [2024-10-24 01:18:27,444 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 01:18:27,447 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 128 mSDsluCounter, 1003 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 1259 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:27,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 1259 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:18:27,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2024-10-24 01:18:27,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 169. [2024-10-24 01:18:27,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 130 states have (on average 1.476923076923077) internal successors, (192), 130 states have internal predecessors, (192), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-24 01:18:27,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 254 transitions. [2024-10-24 01:18:27,479 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 254 transitions. Word has length 23 [2024-10-24 01:18:27,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:27,480 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 254 transitions. [2024-10-24 01:18:27,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 01:18:27,482 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 254 transitions. [2024-10-24 01:18:27,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-24 01:18:27,484 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:27,484 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:18:27,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 01:18:27,485 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:27,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:27,486 INFO L85 PathProgramCache]: Analyzing trace with hash 120145863, now seen corresponding path program 1 times [2024-10-24 01:18:27,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:27,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625964629] [2024-10-24 01:18:27,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:27,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:27,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:27,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:27,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:27,808 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-24 01:18:27,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:27,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625964629] [2024-10-24 01:18:27,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625964629] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:27,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:27,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:18:27,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285468966] [2024-10-24 01:18:27,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:27,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:18:27,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:27,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:18:27,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:18:27,814 INFO L87 Difference]: Start difference. First operand 169 states and 254 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 01:18:27,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:27,906 INFO L93 Difference]: Finished difference Result 326 states and 499 transitions. [2024-10-24 01:18:27,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:18:27,907 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2024-10-24 01:18:27,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:27,908 INFO L225 Difference]: With dead ends: 326 [2024-10-24 01:18:27,909 INFO L226 Difference]: Without dead ends: 173 [2024-10-24 01:18:27,909 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-24 01:18:27,913 INFO L432 NwaCegarLoop]: 243 mSDtfsCounter, 3 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:27,915 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 719 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:18:27,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-10-24 01:18:27,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2024-10-24 01:18:27,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 133 states have (on average 1.4661654135338347) internal successors, (195), 133 states have internal predecessors, (195), 31 states have call successors, (31), 8 states have call predecessors, (31), 8 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-24 01:18:27,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 257 transitions. [2024-10-24 01:18:27,939 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 257 transitions. Word has length 34 [2024-10-24 01:18:27,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:27,939 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 257 transitions. [2024-10-24 01:18:27,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 01:18:27,939 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 257 transitions. [2024-10-24 01:18:27,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-24 01:18:27,941 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:27,941 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:18:27,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 01:18:27,942 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:27,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:27,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1571991065, now seen corresponding path program 1 times [2024-10-24 01:18:27,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:27,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104946109] [2024-10-24 01:18:27,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:27,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:27,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:28,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:28,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:28,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:18:28,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:28,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 01:18:28,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:28,055 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 01:18:28,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:28,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104946109] [2024-10-24 01:18:28,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104946109] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:28,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:28,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:18:28,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515452985] [2024-10-24 01:18:28,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:28,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:18:28,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:28,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:18:28,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:18:28,058 INFO L87 Difference]: Start difference. First operand 173 states and 257 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 01:18:28,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:28,115 INFO L93 Difference]: Finished difference Result 476 states and 717 transitions. [2024-10-24 01:18:28,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:18:28,117 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 48 [2024-10-24 01:18:28,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:28,121 INFO L225 Difference]: With dead ends: 476 [2024-10-24 01:18:28,122 INFO L226 Difference]: Without dead ends: 319 [2024-10-24 01:18:28,124 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-24 01:18:28,126 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 210 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:28,126 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 497 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:18:28,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-10-24 01:18:28,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 315. [2024-10-24 01:18:28,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 238 states have (on average 1.4831932773109244) internal successors, (353), 239 states have internal predecessors, (353), 60 states have call successors, (60), 16 states have call predecessors, (60), 16 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-24 01:18:28,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 473 transitions. [2024-10-24 01:18:28,168 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 473 transitions. Word has length 48 [2024-10-24 01:18:28,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:28,169 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 473 transitions. [2024-10-24 01:18:28,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 01:18:28,171 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 473 transitions. [2024-10-24 01:18:28,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-24 01:18:28,173 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:28,173 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:18:28,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 01:18:28,174 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:28,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:28,175 INFO L85 PathProgramCache]: Analyzing trace with hash 403632391, now seen corresponding path program 1 times [2024-10-24 01:18:28,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:28,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439529305] [2024-10-24 01:18:28,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:28,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:28,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:28,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:28,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:28,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:18:28,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:28,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 01:18:28,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:28,275 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 01:18:28,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:28,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439529305] [2024-10-24 01:18:28,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439529305] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:28,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:28,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 01:18:28,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656432751] [2024-10-24 01:18:28,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:28,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 01:18:28,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:28,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 01:18:28,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 01:18:28,278 INFO L87 Difference]: Start difference. First operand 315 states and 473 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 01:18:28,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:28,342 INFO L93 Difference]: Finished difference Result 889 states and 1345 transitions. [2024-10-24 01:18:28,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 01:18:28,343 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 49 [2024-10-24 01:18:28,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:28,349 INFO L225 Difference]: With dead ends: 889 [2024-10-24 01:18:28,352 INFO L226 Difference]: Without dead ends: 590 [2024-10-24 01:18:28,353 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-24 01:18:28,354 INFO L432 NwaCegarLoop]: 272 mSDtfsCounter, 211 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:28,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 517 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:18:28,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2024-10-24 01:18:28,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 584. [2024-10-24 01:18:28,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 435 states have (on average 1.4919540229885058) internal successors, (649), 438 states have internal predecessors, (649), 117 states have call successors, (117), 31 states have call predecessors, (117), 31 states have return successors, (117), 114 states have call predecessors, (117), 117 states have call successors, (117) [2024-10-24 01:18:28,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 883 transitions. [2024-10-24 01:18:28,404 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 883 transitions. Word has length 49 [2024-10-24 01:18:28,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:28,406 INFO L471 AbstractCegarLoop]: Abstraction has 584 states and 883 transitions. [2024-10-24 01:18:28,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 01:18:28,407 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 883 transitions. [2024-10-24 01:18:28,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-24 01:18:28,409 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:28,410 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:18:28,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 01:18:28,410 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:28,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:28,410 INFO L85 PathProgramCache]: Analyzing trace with hash -876231287, now seen corresponding path program 1 times [2024-10-24 01:18:28,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:28,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427121191] [2024-10-24 01:18:28,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:28,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:28,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:28,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:28,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:28,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:18:28,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:28,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 01:18:28,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:28,551 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 01:18:28,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:28,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427121191] [2024-10-24 01:18:28,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427121191] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:28,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:28,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 01:18:28,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643269843] [2024-10-24 01:18:28,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:28,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:18:28,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:28,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:18:28,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:18:28,555 INFO L87 Difference]: Start difference. First operand 584 states and 883 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 01:18:28,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:28,750 INFO L93 Difference]: Finished difference Result 1241 states and 1878 transitions. [2024-10-24 01:18:28,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:18:28,751 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 49 [2024-10-24 01:18:28,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:28,757 INFO L225 Difference]: With dead ends: 1241 [2024-10-24 01:18:28,758 INFO L226 Difference]: Without dead ends: 673 [2024-10-24 01:18:28,760 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 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-24 01:18:28,760 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 348 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:28,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 648 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:18:28,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2024-10-24 01:18:28,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 665. [2024-10-24 01:18:28,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 503 states have (on average 1.4791252485089463) internal successors, (744), 506 states have internal predecessors, (744), 124 states have call successors, (124), 37 states have call predecessors, (124), 37 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-10-24 01:18:28,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 992 transitions. [2024-10-24 01:18:28,815 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 992 transitions. Word has length 49 [2024-10-24 01:18:28,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:28,816 INFO L471 AbstractCegarLoop]: Abstraction has 665 states and 992 transitions. [2024-10-24 01:18:28,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 01:18:28,817 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 992 transitions. [2024-10-24 01:18:28,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-24 01:18:28,821 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:28,821 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:18:28,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 01:18:28,821 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:28,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:28,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1026743594, now seen corresponding path program 1 times [2024-10-24 01:18:28,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:28,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152684427] [2024-10-24 01:18:28,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:28,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:28,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:28,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:28,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:28,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:18:28,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:28,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 01:18:28,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:28,972 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 01:18:28,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:28,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152684427] [2024-10-24 01:18:28,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152684427] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:28,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:28,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 01:18:28,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618936215] [2024-10-24 01:18:28,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:28,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 01:18:28,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:28,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 01:18:28,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 01:18:28,974 INFO L87 Difference]: Start difference. First operand 665 states and 992 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 01:18:29,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:29,155 INFO L93 Difference]: Finished difference Result 1245 states and 1878 transitions. [2024-10-24 01:18:29,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:18:29,156 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 50 [2024-10-24 01:18:29,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:29,160 INFO L225 Difference]: With dead ends: 1245 [2024-10-24 01:18:29,160 INFO L226 Difference]: Without dead ends: 677 [2024-10-24 01:18:29,162 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 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-24 01:18:29,163 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 348 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:29,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 648 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:18:29,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2024-10-24 01:18:29,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 673. [2024-10-24 01:18:29,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 511 states have (on average 1.471624266144814) internal successors, (752), 514 states have internal predecessors, (752), 124 states have call successors, (124), 37 states have call predecessors, (124), 37 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-10-24 01:18:29,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 1000 transitions. [2024-10-24 01:18:29,206 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 1000 transitions. Word has length 50 [2024-10-24 01:18:29,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:29,206 INFO L471 AbstractCegarLoop]: Abstraction has 673 states and 1000 transitions. [2024-10-24 01:18:29,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 01:18:29,207 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 1000 transitions. [2024-10-24 01:18:29,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-24 01:18:29,208 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:29,208 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:18:29,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 01:18:29,208 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:29,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:29,209 INFO L85 PathProgramCache]: Analyzing trace with hash -864045732, now seen corresponding path program 1 times [2024-10-24 01:18:29,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:29,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072962089] [2024-10-24 01:18:29,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:29,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:29,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:29,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:29,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:29,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:18:29,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:29,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 01:18:29,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:29,384 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 01:18:29,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:29,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072962089] [2024-10-24 01:18:29,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072962089] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:29,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:29,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:18:29,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557828637] [2024-10-24 01:18:29,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:29,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:18:29,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:29,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:18:29,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:18:29,391 INFO L87 Difference]: Start difference. First operand 673 states and 1000 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 01:18:29,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:29,568 INFO L93 Difference]: Finished difference Result 1241 states and 1866 transitions. [2024-10-24 01:18:29,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:18:29,569 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 52 [2024-10-24 01:18:29,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:29,579 INFO L225 Difference]: With dead ends: 1241 [2024-10-24 01:18:29,579 INFO L226 Difference]: Without dead ends: 673 [2024-10-24 01:18:29,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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-24 01:18:29,582 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 58 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:29,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 643 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:18:29,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2024-10-24 01:18:29,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 673. [2024-10-24 01:18:29,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 511 states have (on average 1.4637964774951076) internal successors, (748), 514 states have internal predecessors, (748), 124 states have call successors, (124), 37 states have call predecessors, (124), 37 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-10-24 01:18:29,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 996 transitions. [2024-10-24 01:18:29,631 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 996 transitions. Word has length 52 [2024-10-24 01:18:29,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:29,631 INFO L471 AbstractCegarLoop]: Abstraction has 673 states and 996 transitions. [2024-10-24 01:18:29,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 01:18:29,631 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 996 transitions. [2024-10-24 01:18:29,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-24 01:18:29,632 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:29,632 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:18:29,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 01:18:29,633 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:29,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:29,633 INFO L85 PathProgramCache]: Analyzing trace with hash 798524631, now seen corresponding path program 1 times [2024-10-24 01:18:29,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:29,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915502033] [2024-10-24 01:18:29,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:29,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:29,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:29,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:29,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:29,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:18:29,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:29,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 01:18:29,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:29,837 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 01:18:29,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:29,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915502033] [2024-10-24 01:18:29,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915502033] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:29,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:29,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:18:29,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940200404] [2024-10-24 01:18:29,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:29,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:18:29,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:29,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:18:29,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:18:29,841 INFO L87 Difference]: Start difference. First operand 673 states and 996 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-24 01:18:29,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:29,918 INFO L93 Difference]: Finished difference Result 1261 states and 1890 transitions. [2024-10-24 01:18:29,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:18:29,919 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 53 [2024-10-24 01:18:29,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:29,925 INFO L225 Difference]: With dead ends: 1261 [2024-10-24 01:18:29,925 INFO L226 Difference]: Without dead ends: 693 [2024-10-24 01:18:29,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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-24 01:18:29,929 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 4 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:29,930 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 731 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:18:29,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2024-10-24 01:18:29,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 693. [2024-10-24 01:18:29,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 693 states, 527 states have (on average 1.4497153700189753) internal successors, (764), 530 states have internal predecessors, (764), 124 states have call successors, (124), 41 states have call predecessors, (124), 41 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-10-24 01:18:29,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 1012 transitions. [2024-10-24 01:18:29,999 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 1012 transitions. Word has length 53 [2024-10-24 01:18:29,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:29,999 INFO L471 AbstractCegarLoop]: Abstraction has 693 states and 1012 transitions. [2024-10-24 01:18:29,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-24 01:18:29,999 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 1012 transitions. [2024-10-24 01:18:30,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-24 01:18:30,001 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:30,001 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:18:30,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 01:18:30,002 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:30,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:30,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1770618019, now seen corresponding path program 1 times [2024-10-24 01:18:30,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:30,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055435088] [2024-10-24 01:18:30,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:30,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:30,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:30,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:30,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:30,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:18:30,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:30,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 01:18:30,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:30,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 01:18:30,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:30,161 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 01:18:30,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:30,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055435088] [2024-10-24 01:18:30,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055435088] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:30,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:30,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:18:30,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925869992] [2024-10-24 01:18:30,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:30,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:18:30,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:30,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:18:30,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:18:30,164 INFO L87 Difference]: Start difference. First operand 693 states and 1012 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-24 01:18:30,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:30,255 INFO L93 Difference]: Finished difference Result 1301 states and 1934 transitions. [2024-10-24 01:18:30,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:18:30,255 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 61 [2024-10-24 01:18:30,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:30,261 INFO L225 Difference]: With dead ends: 1301 [2024-10-24 01:18:30,261 INFO L226 Difference]: Without dead ends: 713 [2024-10-24 01:18:30,263 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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-24 01:18:30,264 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 4 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:30,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 717 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:18:30,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2024-10-24 01:18:30,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 713. [2024-10-24 01:18:30,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 713 states, 543 states have (on average 1.4364640883977902) internal successors, (780), 546 states have internal predecessors, (780), 124 states have call successors, (124), 45 states have call predecessors, (124), 45 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-10-24 01:18:30,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 1028 transitions. [2024-10-24 01:18:30,312 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 1028 transitions. Word has length 61 [2024-10-24 01:18:30,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:30,313 INFO L471 AbstractCegarLoop]: Abstraction has 713 states and 1028 transitions. [2024-10-24 01:18:30,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-24 01:18:30,313 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 1028 transitions. [2024-10-24 01:18:30,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-24 01:18:30,314 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:30,315 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:18:30,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 01:18:30,315 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:30,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:30,316 INFO L85 PathProgramCache]: Analyzing trace with hash 424993415, now seen corresponding path program 1 times [2024-10-24 01:18:30,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:30,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748421599] [2024-10-24 01:18:30,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:30,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:30,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:30,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:30,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:30,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:18:30,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:30,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 01:18:30,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:30,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 01:18:30,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:30,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 01:18:30,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:30,561 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 01:18:30,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:30,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748421599] [2024-10-24 01:18:30,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748421599] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:30,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:30,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:18:30,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029237365] [2024-10-24 01:18:30,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:30,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:18:30,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:30,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:18:30,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:18:30,565 INFO L87 Difference]: Start difference. First operand 713 states and 1028 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-24 01:18:30,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:30,654 INFO L93 Difference]: Finished difference Result 1337 states and 1950 transitions. [2024-10-24 01:18:30,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:18:30,655 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 69 [2024-10-24 01:18:30,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:30,659 INFO L225 Difference]: With dead ends: 1337 [2024-10-24 01:18:30,660 INFO L226 Difference]: Without dead ends: 729 [2024-10-24 01:18:30,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 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-24 01:18:30,662 INFO L432 NwaCegarLoop]: 247 mSDtfsCounter, 3 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:30,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 727 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:18:30,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2024-10-24 01:18:30,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 729. [2024-10-24 01:18:30,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 555 states have (on average 1.427027027027027) internal successors, (792), 558 states have internal predecessors, (792), 124 states have call successors, (124), 49 states have call predecessors, (124), 49 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-10-24 01:18:30,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 1040 transitions. [2024-10-24 01:18:30,707 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 1040 transitions. Word has length 69 [2024-10-24 01:18:30,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:30,707 INFO L471 AbstractCegarLoop]: Abstraction has 729 states and 1040 transitions. [2024-10-24 01:18:30,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-24 01:18:30,708 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 1040 transitions. [2024-10-24 01:18:30,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-24 01:18:30,709 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:30,709 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:18:30,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 01:18:30,709 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:30,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:30,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1473514578, now seen corresponding path program 1 times [2024-10-24 01:18:30,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:30,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917809215] [2024-10-24 01:18:30,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:30,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:30,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:30,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:30,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:30,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:18:30,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:30,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 01:18:30,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:30,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 01:18:30,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:30,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 01:18:30,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:30,880 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 01:18:30,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:30,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917809215] [2024-10-24 01:18:30,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917809215] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:30,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:30,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:18:30,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795109737] [2024-10-24 01:18:30,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:30,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:18:30,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:30,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:18:30,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:18:30,883 INFO L87 Difference]: Start difference. First operand 729 states and 1040 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-24 01:18:30,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:30,984 INFO L93 Difference]: Finished difference Result 1373 states and 1990 transitions. [2024-10-24 01:18:30,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:18:30,985 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 69 [2024-10-24 01:18:30,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:30,990 INFO L225 Difference]: With dead ends: 1373 [2024-10-24 01:18:30,990 INFO L226 Difference]: Without dead ends: 749 [2024-10-24 01:18:30,992 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 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-24 01:18:30,992 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 4 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:30,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 717 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:18:30,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2024-10-24 01:18:31,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 749. [2024-10-24 01:18:31,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 749 states, 571 states have (on average 1.415061295971979) internal successors, (808), 574 states have internal predecessors, (808), 124 states have call successors, (124), 53 states have call predecessors, (124), 53 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-10-24 01:18:31,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 1056 transitions. [2024-10-24 01:18:31,034 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 1056 transitions. Word has length 69 [2024-10-24 01:18:31,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:31,035 INFO L471 AbstractCegarLoop]: Abstraction has 749 states and 1056 transitions. [2024-10-24 01:18:31,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-24 01:18:31,035 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 1056 transitions. [2024-10-24 01:18:31,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-24 01:18:31,036 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:31,036 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:18:31,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 01:18:31,037 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:31,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:31,037 INFO L85 PathProgramCache]: Analyzing trace with hash -625847890, now seen corresponding path program 1 times [2024-10-24 01:18:31,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:31,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650280557] [2024-10-24 01:18:31,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:31,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:31,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:31,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:31,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:31,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:18:31,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:31,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 01:18:31,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:31,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 01:18:31,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:31,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 01:18:31,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:31,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 01:18:31,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:31,237 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-24 01:18:31,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:31,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650280557] [2024-10-24 01:18:31,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650280557] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:31,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:31,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:18:31,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572737330] [2024-10-24 01:18:31,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:31,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:18:31,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:31,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:18:31,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:18:31,240 INFO L87 Difference]: Start difference. First operand 749 states and 1056 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-24 01:18:31,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:31,324 INFO L93 Difference]: Finished difference Result 1417 states and 2018 transitions. [2024-10-24 01:18:31,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:18:31,324 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 77 [2024-10-24 01:18:31,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:31,329 INFO L225 Difference]: With dead ends: 1417 [2024-10-24 01:18:31,329 INFO L226 Difference]: Without dead ends: 773 [2024-10-24 01:18:31,331 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 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-24 01:18:31,331 INFO L432 NwaCegarLoop]: 246 mSDtfsCounter, 5 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:31,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 729 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:18:31,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2024-10-24 01:18:31,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 773. [2024-10-24 01:18:31,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 773 states, 591 states have (on average 1.401015228426396) internal successors, (828), 594 states have internal predecessors, (828), 124 states have call successors, (124), 57 states have call predecessors, (124), 57 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-10-24 01:18:31,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1076 transitions. [2024-10-24 01:18:31,401 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1076 transitions. Word has length 77 [2024-10-24 01:18:31,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:31,401 INFO L471 AbstractCegarLoop]: Abstraction has 773 states and 1076 transitions. [2024-10-24 01:18:31,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-24 01:18:31,401 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1076 transitions. [2024-10-24 01:18:31,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-24 01:18:31,403 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:31,403 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:18:31,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 01:18:31,403 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:31,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:31,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1657714599, now seen corresponding path program 1 times [2024-10-24 01:18:31,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:31,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407213808] [2024-10-24 01:18:31,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:31,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:31,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:31,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:31,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:31,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:18:31,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:31,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 01:18:31,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:31,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 01:18:31,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:31,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 01:18:31,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:31,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 01:18:31,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:31,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 01:18:31,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:31,969 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-24 01:18:31,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:31,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407213808] [2024-10-24 01:18:31,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407213808] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:31,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:31,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:18:31,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448230348] [2024-10-24 01:18:31,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:31,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:18:31,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:31,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:18:31,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:18:31,971 INFO L87 Difference]: Start difference. First operand 773 states and 1076 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-24 01:18:32,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:32,274 INFO L93 Difference]: Finished difference Result 2001 states and 2771 transitions. [2024-10-24 01:18:32,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 01:18:32,275 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 80 [2024-10-24 01:18:32,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:32,282 INFO L225 Difference]: With dead ends: 2001 [2024-10-24 01:18:32,282 INFO L226 Difference]: Without dead ends: 1333 [2024-10-24 01:18:32,284 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-24 01:18:32,285 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 194 mSDsluCounter, 1160 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 1410 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:32,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 1410 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 01:18:32,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1333 states. [2024-10-24 01:18:32,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1333 to 1049. [2024-10-24 01:18:32,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1049 states, 794 states have (on average 1.3879093198992443) internal successors, (1102), 799 states have internal predecessors, (1102), 172 states have call successors, (172), 82 states have call predecessors, (172), 82 states have return successors, (172), 167 states have call predecessors, (172), 172 states have call successors, (172) [2024-10-24 01:18:32,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1049 states to 1049 states and 1446 transitions. [2024-10-24 01:18:32,366 INFO L78 Accepts]: Start accepts. Automaton has 1049 states and 1446 transitions. Word has length 80 [2024-10-24 01:18:32,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:32,366 INFO L471 AbstractCegarLoop]: Abstraction has 1049 states and 1446 transitions. [2024-10-24 01:18:32,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-24 01:18:32,367 INFO L276 IsEmpty]: Start isEmpty. Operand 1049 states and 1446 transitions. [2024-10-24 01:18:32,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-24 01:18:32,368 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:32,368 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:18:32,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 01:18:32,368 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:32,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:32,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1049989745, now seen corresponding path program 1 times [2024-10-24 01:18:32,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:32,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613552148] [2024-10-24 01:18:32,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:32,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:32,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:32,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:32,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:32,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:18:32,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:32,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 01:18:32,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:32,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 01:18:32,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:32,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 01:18:32,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:32,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 01:18:32,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:32,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 01:18:32,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:32,574 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-24 01:18:32,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:32,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613552148] [2024-10-24 01:18:32,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613552148] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:32,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:32,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:18:32,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861310259] [2024-10-24 01:18:32,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:32,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:18:32,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:32,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:18:32,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:18:32,576 INFO L87 Difference]: Start difference. First operand 1049 states and 1446 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 01:18:32,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:32,696 INFO L93 Difference]: Finished difference Result 1957 states and 2718 transitions. [2024-10-24 01:18:32,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 01:18:32,697 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 84 [2024-10-24 01:18:32,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:32,704 INFO L225 Difference]: With dead ends: 1957 [2024-10-24 01:18:32,704 INFO L226 Difference]: Without dead ends: 1073 [2024-10-24 01:18:32,708 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 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-24 01:18:32,709 INFO L432 NwaCegarLoop]: 247 mSDtfsCounter, 3 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:32,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 727 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 01:18:32,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2024-10-24 01:18:32,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 1073. [2024-10-24 01:18:32,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1073 states, 812 states have (on average 1.3793103448275863) internal successors, (1120), 817 states have internal predecessors, (1120), 172 states have call successors, (172), 88 states have call predecessors, (172), 88 states have return successors, (172), 167 states have call predecessors, (172), 172 states have call successors, (172) [2024-10-24 01:18:32,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1073 states to 1073 states and 1464 transitions. [2024-10-24 01:18:32,796 INFO L78 Accepts]: Start accepts. Automaton has 1073 states and 1464 transitions. Word has length 84 [2024-10-24 01:18:32,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:32,796 INFO L471 AbstractCegarLoop]: Abstraction has 1073 states and 1464 transitions. [2024-10-24 01:18:32,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-24 01:18:32,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1073 states and 1464 transitions. [2024-10-24 01:18:32,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-24 01:18:32,798 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:32,798 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:18:32,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 01:18:32,798 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:32,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:32,799 INFO L85 PathProgramCache]: Analyzing trace with hash 880976071, now seen corresponding path program 1 times [2024-10-24 01:18:32,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:32,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529546682] [2024-10-24 01:18:32,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:32,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:32,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:33,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:33,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:33,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:18:33,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:33,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 01:18:33,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:33,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 01:18:33,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:33,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 01:18:33,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:33,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 01:18:33,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:33,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 01:18:33,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:33,125 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-24 01:18:33,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:33,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529546682] [2024-10-24 01:18:33,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529546682] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:33,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:33,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 01:18:33,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336493902] [2024-10-24 01:18:33,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:33,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:18:33,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:33,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:18:33,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:18:33,129 INFO L87 Difference]: Start difference. First operand 1073 states and 1464 transitions. Second operand has 8 states, 6 states have (on average 9.833333333333334) internal successors, (59), 7 states have internal predecessors, (59), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-24 01:18:33,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:33,324 INFO L93 Difference]: Finished difference Result 1489 states and 2140 transitions. [2024-10-24 01:18:33,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 01:18:33,325 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 9.833333333333334) internal successors, (59), 7 states have internal predecessors, (59), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 83 [2024-10-24 01:18:33,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:33,334 INFO L225 Difference]: With dead ends: 1489 [2024-10-24 01:18:33,334 INFO L226 Difference]: Without dead ends: 1487 [2024-10-24 01:18:33,335 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-24 01:18:33,335 INFO L432 NwaCegarLoop]: 426 mSDtfsCounter, 131 mSDsluCounter, 2368 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 2794 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:33,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 2794 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:18:33,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1487 states. [2024-10-24 01:18:33,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1487 to 1081. [2024-10-24 01:18:33,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1081 states, 816 states have (on average 1.3774509803921569) internal successors, (1124), 823 states have internal predecessors, (1124), 174 states have call successors, (174), 90 states have call predecessors, (174), 90 states have return successors, (174), 167 states have call predecessors, (174), 174 states have call successors, (174) [2024-10-24 01:18:33,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 1081 states and 1472 transitions. [2024-10-24 01:18:33,420 INFO L78 Accepts]: Start accepts. Automaton has 1081 states and 1472 transitions. Word has length 83 [2024-10-24 01:18:33,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:33,420 INFO L471 AbstractCegarLoop]: Abstraction has 1081 states and 1472 transitions. [2024-10-24 01:18:33,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 9.833333333333334) internal successors, (59), 7 states have internal predecessors, (59), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-24 01:18:33,421 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 1472 transitions. [2024-10-24 01:18:33,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-24 01:18:33,422 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:33,422 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:18:33,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 01:18:33,422 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:33,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:33,422 INFO L85 PathProgramCache]: Analyzing trace with hash 600868425, now seen corresponding path program 1 times [2024-10-24 01:18:33,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:33,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342965755] [2024-10-24 01:18:33,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:33,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:33,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:33,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:33,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:33,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:18:33,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:33,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 01:18:33,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:33,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 01:18:33,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:33,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 01:18:33,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:33,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 01:18:33,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:33,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 01:18:33,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:33,598 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-24 01:18:33,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:33,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342965755] [2024-10-24 01:18:33,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342965755] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:33,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:33,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:18:33,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024356400] [2024-10-24 01:18:33,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:33,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:18:33,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:33,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:18:33,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:18:33,601 INFO L87 Difference]: Start difference. First operand 1081 states and 1472 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-24 01:18:33,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:33,833 INFO L93 Difference]: Finished difference Result 1951 states and 2667 transitions. [2024-10-24 01:18:33,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 01:18:33,834 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 86 [2024-10-24 01:18:33,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:33,840 INFO L225 Difference]: With dead ends: 1951 [2024-10-24 01:18:33,841 INFO L226 Difference]: Without dead ends: 1117 [2024-10-24 01:18:33,843 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-24 01:18:33,843 INFO L432 NwaCegarLoop]: 248 mSDtfsCounter, 245 mSDsluCounter, 1179 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 1427 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:33,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 1427 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:18:33,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states. [2024-10-24 01:18:33,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 1075. [2024-10-24 01:18:33,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1075 states, 821 states have (on average 1.371498172959805) internal successors, (1126), 833 states have internal predecessors, (1126), 162 states have call successors, (162), 91 states have call predecessors, (162), 91 states have return successors, (162), 150 states have call predecessors, (162), 162 states have call successors, (162) [2024-10-24 01:18:33,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 1450 transitions. [2024-10-24 01:18:33,914 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 1450 transitions. Word has length 86 [2024-10-24 01:18:33,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:33,914 INFO L471 AbstractCegarLoop]: Abstraction has 1075 states and 1450 transitions. [2024-10-24 01:18:33,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-24 01:18:33,915 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 1450 transitions. [2024-10-24 01:18:33,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-24 01:18:33,916 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:33,916 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:18:33,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 01:18:33,917 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:33,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:33,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1743472577, now seen corresponding path program 1 times [2024-10-24 01:18:33,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:33,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021958865] [2024-10-24 01:18:33,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:33,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:33,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:34,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:34,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:34,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:18:34,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:34,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 01:18:34,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:34,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 01:18:34,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:34,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 01:18:34,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:34,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 01:18:34,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:34,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 01:18:34,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:34,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 01:18:34,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:34,418 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-24 01:18:34,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:34,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021958865] [2024-10-24 01:18:34,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021958865] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:34,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:34,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:18:34,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920542018] [2024-10-24 01:18:34,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:34,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:18:34,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:34,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:18:34,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:18:34,420 INFO L87 Difference]: Start difference. First operand 1075 states and 1450 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-24 01:18:34,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:34,653 INFO L93 Difference]: Finished difference Result 1919 states and 2599 transitions. [2024-10-24 01:18:34,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 01:18:34,653 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 88 [2024-10-24 01:18:34,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:34,660 INFO L225 Difference]: With dead ends: 1919 [2024-10-24 01:18:34,660 INFO L226 Difference]: Without dead ends: 1071 [2024-10-24 01:18:34,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-24 01:18:34,663 INFO L432 NwaCegarLoop]: 271 mSDtfsCounter, 146 mSDsluCounter, 1248 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 1519 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:34,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 1519 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:18:34,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2024-10-24 01:18:34,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 967. [2024-10-24 01:18:34,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 967 states, 740 states have (on average 1.3756756756756756) internal successors, (1018), 750 states have internal predecessors, (1018), 145 states have call successors, (145), 81 states have call predecessors, (145), 81 states have return successors, (145), 135 states have call predecessors, (145), 145 states have call successors, (145) [2024-10-24 01:18:34,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 1308 transitions. [2024-10-24 01:18:34,725 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 1308 transitions. Word has length 88 [2024-10-24 01:18:34,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:34,726 INFO L471 AbstractCegarLoop]: Abstraction has 967 states and 1308 transitions. [2024-10-24 01:18:34,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-24 01:18:34,726 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1308 transitions. [2024-10-24 01:18:34,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-24 01:18:34,727 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:34,727 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:18:34,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-24 01:18:34,728 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:34,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:34,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1697658043, now seen corresponding path program 1 times [2024-10-24 01:18:34,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:34,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068440720] [2024-10-24 01:18:34,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:34,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:34,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:35,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:35,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:35,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 01:18:35,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:35,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 01:18:35,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:35,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 01:18:35,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:35,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 01:18:35,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:35,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 01:18:35,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:35,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 01:18:35,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:35,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 01:18:35,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:35,295 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-24 01:18:35,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:35,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068440720] [2024-10-24 01:18:35,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068440720] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:35,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:35,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 01:18:35,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030878535] [2024-10-24 01:18:35,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:35,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 01:18:35,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:35,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 01:18:35,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-24 01:18:35,298 INFO L87 Difference]: Start difference. First operand 967 states and 1308 transitions. Second operand has 8 states, 8 states have (on average 8.25) internal successors, (66), 7 states have internal predecessors, (66), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-24 01:18:35,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:35,775 INFO L93 Difference]: Finished difference Result 1852 states and 2488 transitions. [2024-10-24 01:18:35,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 01:18:35,775 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 7 states have internal predecessors, (66), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 89 [2024-10-24 01:18:35,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:35,781 INFO L225 Difference]: With dead ends: 1852 [2024-10-24 01:18:35,781 INFO L226 Difference]: Without dead ends: 1031 [2024-10-24 01:18:35,783 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-10-24 01:18:35,784 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 535 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 1182 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:35,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [541 Valid, 1182 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 01:18:35,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2024-10-24 01:18:35,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 983. [2024-10-24 01:18:35,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 983 states, 748 states have (on average 1.3516042780748663) internal successors, (1011), 759 states have internal predecessors, (1011), 148 states have call successors, (148), 86 states have call predecessors, (148), 86 states have return successors, (148), 137 states have call predecessors, (148), 148 states have call successors, (148) [2024-10-24 01:18:35,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 1307 transitions. [2024-10-24 01:18:35,864 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 1307 transitions. Word has length 89 [2024-10-24 01:18:35,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:35,864 INFO L471 AbstractCegarLoop]: Abstraction has 983 states and 1307 transitions. [2024-10-24 01:18:35,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 7 states have internal predecessors, (66), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-24 01:18:35,865 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 1307 transitions. [2024-10-24 01:18:35,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-24 01:18:35,866 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:35,866 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:18:35,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-24 01:18:35,866 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:35,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:35,867 INFO L85 PathProgramCache]: Analyzing trace with hash -934830644, now seen corresponding path program 1 times [2024-10-24 01:18:35,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:35,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295908059] [2024-10-24 01:18:35,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:35,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:35,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:35,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:35,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:35,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-24 01:18:35,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:35,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 01:18:35,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:35,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 01:18:35,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:35,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 01:18:35,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:35,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-24 01:18:35,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:35,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 01:18:35,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:35,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 01:18:35,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:35,967 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-24 01:18:35,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:35,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295908059] [2024-10-24 01:18:35,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295908059] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:35,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:35,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 01:18:35,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534218411] [2024-10-24 01:18:35,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:35,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 01:18:35,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:35,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 01:18:35,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 01:18:35,970 INFO L87 Difference]: Start difference. First operand 983 states and 1307 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 01:18:36,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:36,142 INFO L93 Difference]: Finished difference Result 2606 states and 3483 transitions. [2024-10-24 01:18:36,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 01:18:36,142 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 90 [2024-10-24 01:18:36,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:36,151 INFO L225 Difference]: With dead ends: 2606 [2024-10-24 01:18:36,151 INFO L226 Difference]: Without dead ends: 1820 [2024-10-24 01:18:36,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 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-24 01:18:36,154 INFO L432 NwaCegarLoop]: 437 mSDtfsCounter, 198 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 1099 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:36,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 1099 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 01:18:36,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1820 states. [2024-10-24 01:18:36,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1820 to 1711. [2024-10-24 01:18:36,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1711 states, 1286 states have (on average 1.3413685847589425) internal successors, (1725), 1305 states have internal predecessors, (1725), 272 states have call successors, (272), 152 states have call predecessors, (272), 152 states have return successors, (272), 253 states have call predecessors, (272), 272 states have call successors, (272) [2024-10-24 01:18:36,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1711 states to 1711 states and 2269 transitions. [2024-10-24 01:18:36,329 INFO L78 Accepts]: Start accepts. Automaton has 1711 states and 2269 transitions. Word has length 90 [2024-10-24 01:18:36,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:36,329 INFO L471 AbstractCegarLoop]: Abstraction has 1711 states and 2269 transitions. [2024-10-24 01:18:36,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 01:18:36,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1711 states and 2269 transitions. [2024-10-24 01:18:36,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-24 01:18:36,331 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:36,331 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:18:36,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-24 01:18:36,332 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:36,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:36,332 INFO L85 PathProgramCache]: Analyzing trace with hash -102190207, now seen corresponding path program 1 times [2024-10-24 01:18:36,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:36,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586982679] [2024-10-24 01:18:36,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:36,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:36,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:36,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 01:18:36,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:36,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-24 01:18:36,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:36,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 01:18:36,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:36,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 01:18:36,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:36,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 01:18:36,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:36,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-24 01:18:36,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:36,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 01:18:36,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:36,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 01:18:36,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 01:18:36,791 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-24 01:18:36,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 01:18:36,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586982679] [2024-10-24 01:18:36,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586982679] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 01:18:36,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 01:18:36,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 01:18:36,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435446229] [2024-10-24 01:18:36,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 01:18:36,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 01:18:36,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 01:18:36,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 01:18:36,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 01:18:36,793 INFO L87 Difference]: Start difference. First operand 1711 states and 2269 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 01:18:37,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 01:18:37,412 INFO L93 Difference]: Finished difference Result 3342 states and 4426 transitions. [2024-10-24 01:18:37,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 01:18:37,413 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 92 [2024-10-24 01:18:37,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 01:18:37,424 INFO L225 Difference]: With dead ends: 3342 [2024-10-24 01:18:37,424 INFO L226 Difference]: Without dead ends: 1904 [2024-10-24 01:18:37,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-10-24 01:18:37,429 INFO L432 NwaCegarLoop]: 297 mSDtfsCounter, 481 mSDsluCounter, 1063 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 1360 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 01:18:37,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 1360 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 01:18:37,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1904 states. [2024-10-24 01:18:37,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1904 to 1738. [2024-10-24 01:18:37,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1738 states, 1300 states have (on average 1.3346153846153845) internal successors, (1735), 1320 states have internal predecessors, (1735), 280 states have call successors, (280), 157 states have call predecessors, (280), 157 states have return successors, (280), 260 states have call predecessors, (280), 280 states have call successors, (280) [2024-10-24 01:18:37,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2295 transitions. [2024-10-24 01:18:37,584 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2295 transitions. Word has length 92 [2024-10-24 01:18:37,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 01:18:37,584 INFO L471 AbstractCegarLoop]: Abstraction has 1738 states and 2295 transitions. [2024-10-24 01:18:37,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 01:18:37,584 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2295 transitions. [2024-10-24 01:18:37,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-24 01:18:37,585 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 01:18:37,586 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 01:18:37,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-24 01:18:37,586 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 01:18:37,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 01:18:37,586 INFO L85 PathProgramCache]: Analyzing trace with hash -499793690, now seen corresponding path program 1 times [2024-10-24 01:18:37,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 01:18:37,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645974775] [2024-10-24 01:18:37,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 01:18:37,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 01:18:37,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 01:18:37,672 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 01:18:37,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 01:18:37,812 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 01:18:37,813 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 01:18:37,814 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 01:18:37,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-24 01:18:37,821 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-24 01:18:37,967 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 01:18:37,972 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 01:18:37 BoogieIcfgContainer [2024-10-24 01:18:37,972 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 01:18:37,973 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 01:18:37,973 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 01:18:37,973 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 01:18:37,974 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:18:26" (3/4) ... [2024-10-24 01:18:37,974 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-24 01:18:38,103 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-24 01:18:38,103 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 01:18:38,104 INFO L158 Benchmark]: Toolchain (without parser) took 13272.11ms. Allocated memory was 165.7MB in the beginning and 635.4MB in the end (delta: 469.8MB). Free memory was 111.8MB in the beginning and 530.5MB in the end (delta: -418.6MB). Peak memory consumption was 52.3MB. Max. memory is 16.1GB. [2024-10-24 01:18:38,104 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 165.7MB. Free memory is still 130.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 01:18:38,104 INFO L158 Benchmark]: CACSL2BoogieTranslator took 433.72ms. Allocated memory is still 165.7MB. Free memory was 111.8MB in the beginning and 91.7MB in the end (delta: 20.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-24 01:18:38,105 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.23ms. Allocated memory is still 165.7MB. Free memory was 91.7MB in the beginning and 87.8MB in the end (delta: 3.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 01:18:38,105 INFO L158 Benchmark]: Boogie Preprocessor took 97.74ms. Allocated memory is still 165.7MB. Free memory was 87.8MB in the beginning and 83.3MB in the end (delta: 4.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 01:18:38,105 INFO L158 Benchmark]: RCFGBuilder took 936.75ms. Allocated memory is still 165.7MB. Free memory was 83.3MB in the beginning and 120.4MB in the end (delta: -37.1MB). Peak memory consumption was 46.3MB. Max. memory is 16.1GB. [2024-10-24 01:18:38,106 INFO L158 Benchmark]: TraceAbstraction took 11604.45ms. Allocated memory was 165.7MB in the beginning and 635.4MB in the end (delta: 469.8MB). Free memory was 119.5MB in the beginning and 551.4MB in the end (delta: -431.9MB). Peak memory consumption was 37.5MB. Max. memory is 16.1GB. [2024-10-24 01:18:38,106 INFO L158 Benchmark]: Witness Printer took 130.77ms. Allocated memory is still 635.4MB. Free memory was 550.4MB in the beginning and 530.5MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-24 01:18:38,107 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.28ms. Allocated memory is still 165.7MB. Free memory is still 130.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 433.72ms. Allocated memory is still 165.7MB. Free memory was 111.8MB in the beginning and 91.7MB in the end (delta: 20.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.23ms. Allocated memory is still 165.7MB. Free memory was 91.7MB in the beginning and 87.8MB in the end (delta: 3.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 97.74ms. Allocated memory is still 165.7MB. Free memory was 87.8MB in the beginning and 83.3MB in the end (delta: 4.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 936.75ms. Allocated memory is still 165.7MB. Free memory was 83.3MB in the beginning and 120.4MB in the end (delta: -37.1MB). Peak memory consumption was 46.3MB. Max. memory is 16.1GB. * TraceAbstraction took 11604.45ms. Allocated memory was 165.7MB in the beginning and 635.4MB in the end (delta: 469.8MB). Free memory was 119.5MB in the beginning and 551.4MB in the end (delta: -431.9MB). Peak memory consumption was 37.5MB. Max. memory is 16.1GB. * Witness Printer took 130.77ms. Allocated memory is still 635.4MB. Free memory was 550.4MB in the beginning and 530.5MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. 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: 619]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] msg_t nomsg = (msg_t )-1; [L25] port_t cs1 ; [L26] int8_t cs1_old ; [L27] int8_t cs1_new ; [L28] port_t cs2 ; [L29] int8_t cs2_old ; [L30] int8_t cs2_new ; [L31] port_t s1s2 ; [L32] int8_t s1s2_old ; [L33] int8_t s1s2_new ; [L34] port_t s1s1 ; [L35] int8_t s1s1_old ; [L36] int8_t s1s1_new ; [L37] port_t s2s1 ; [L38] int8_t s2s1_old ; [L39] int8_t s2s1_new ; [L40] port_t s2s2 ; [L41] int8_t s2s2_old ; [L42] int8_t s2s2_new ; [L43] port_t s1p ; [L44] int8_t s1p_old ; [L45] int8_t s1p_new ; [L46] port_t s2p ; [L47] int8_t s2p_old ; [L48] int8_t s2p_new ; [L51] _Bool side1Failed ; [L52] _Bool side2Failed ; [L53] msg_t side1_written ; [L54] msg_t side2_written ; [L60] static _Bool side1Failed_History_0 ; [L61] static _Bool side1Failed_History_1 ; [L62] static _Bool side1Failed_History_2 ; [L63] static _Bool side2Failed_History_0 ; [L64] static _Bool side2Failed_History_1 ; [L65] static _Bool side2Failed_History_2 ; [L66] static int8_t active_side_History_0 ; [L67] static int8_t active_side_History_1 ; [L68] static int8_t active_side_History_2 ; [L69] static msg_t manual_selection_History_0 ; [L70] static msg_t manual_selection_History_1 ; [L71] static msg_t manual_selection_History_2 ; [L542] int c1 ; [L543] int i2 ; [L546] c1 = 0 [L547] side1Failed = __VERIFIER_nondet_bool() [L548] side2Failed = __VERIFIER_nondet_bool() [L549] side1_written = __VERIFIER_nondet_char() [L550] side2_written = __VERIFIER_nondet_char() [L551] side1Failed_History_0 = __VERIFIER_nondet_bool() [L552] side1Failed_History_1 = __VERIFIER_nondet_bool() [L553] side1Failed_History_2 = __VERIFIER_nondet_bool() [L554] side2Failed_History_0 = __VERIFIER_nondet_bool() [L555] side2Failed_History_1 = __VERIFIER_nondet_bool() [L556] side2Failed_History_2 = __VERIFIER_nondet_bool() [L557] active_side_History_0 = __VERIFIER_nondet_char() [L558] active_side_History_1 = __VERIFIER_nondet_char() [L559] active_side_History_2 = __VERIFIER_nondet_char() [L560] manual_selection_History_0 = __VERIFIER_nondet_char() [L561] manual_selection_History_1 = __VERIFIER_nondet_char() [L562] manual_selection_History_2 = __VERIFIER_nondet_char() [L563] CALL, EXPR init() [L197] COND FALSE !((int )side1Failed_History_0 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed=1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L200] COND FALSE !((int )side2Failed_History_0 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed=1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L203] COND FALSE !((int )active_side_History_0 != -2) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed=1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L206] COND FALSE !((int )manual_selection_History_0 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed=1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L209] COND FALSE !((int )side1Failed_History_1 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed=1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L212] COND FALSE !((int )side2Failed_History_1 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed=1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L215] COND FALSE !((int )active_side_History_1 != -2) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed=1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L218] COND FALSE !((int )manual_selection_History_1 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed=1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L221] COND FALSE !((int )side1Failed_History_2 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed=1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L224] COND FALSE !((int )side2Failed_History_2 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed=1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L227] COND FALSE !((int )active_side_History_2 != -2) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed=1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L230] COND FALSE !((int )manual_selection_History_2 != 0) [L233] return (1); VAL [\result=1, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed=1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L563] RET, EXPR init() [L563] i2 = init() [L564] CALL assume_abort_if_not(i2) VAL [\old(cond)=1, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed=1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L58] COND FALSE !(!cond) VAL [\old(cond)=1, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed=1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L564] RET assume_abort_if_not(i2) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, i2=1, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed=1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L565] cs1_old = nomsg [L566] cs1_new = nomsg [L567] cs2_old = nomsg [L568] cs2_new = nomsg [L569] s1s2_old = nomsg [L570] s1s2_new = nomsg [L571] s1s1_old = nomsg [L572] s1s1_new = nomsg [L573] s2s1_old = nomsg [L574] s2s1_new = nomsg [L575] s2s2_old = nomsg [L576] s2s2_new = nomsg [L577] s1p_old = nomsg [L578] s1p_new = nomsg [L579] s2p_old = nomsg [L580] s2p_new = nomsg [L581] i2 = 0 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, i2=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1Failed=1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L582] COND TRUE i2 < 10 [L584] CALL Console_task_each_pals_period() [L251] msg_t manual_selection ; [L252] char tmp ; [L255] tmp = __VERIFIER_nondet_char() [L256] manual_selection = tmp [L257] CALL write_manual_selection_history(manual_selection) [L167] manual_selection_History_2 = manual_selection_History_1 [L168] manual_selection_History_1 = manual_selection_History_0 [L169] manual_selection_History_0 = val [L257] RET write_manual_selection_history(manual_selection) [L258] cs1_new = manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [L259] cs2_new = manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L260] manual_selection = (msg_t )0 [L584] RET Console_task_each_pals_period() [L585] CALL Side1_activestandby_task_each_pals_period() [L266] int8_t side1 ; [L267] int8_t side2 ; [L268] msg_t manual_selection ; [L269] int8_t next_state ; [L272] side1 = nomsg [L273] side2 = nomsg [L274] manual_selection = (msg_t )0 [L275] side1Failed = __VERIFIER_nondet_bool() [L276] CALL write_side1_failed_history(side1Failed) [L77] side1Failed_History_2 = side1Failed_History_1 [L78] side1Failed_History_1 = side1Failed_History_0 [L79] side1Failed_History_0 = val [L276] RET write_side1_failed_history(side1Failed) [L277] COND FALSE !(\read(side1Failed)) [L284] side1 = s1s1_old [L285] s1s1_old = nomsg [L286] side2 = s2s1_old [L287] s2s1_old = nomsg [L288] manual_selection = cs1_old [L289] cs1_old = nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L290] COND TRUE (int )side1 == (int )side2 [L291] next_state = (int8_t )1 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L314] s1s1_new = next_state != nomsg && s1s1_new == nomsg ? next_state : s1s1_new [L315] s1s2_new = next_state != nomsg && s1s2_new == nomsg ? next_state : s1s2_new [L316] s1p_new = next_state != nomsg && s1p_new == nomsg ? next_state : s1p_new [L317] side1_written = next_state VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L585] RET Side1_activestandby_task_each_pals_period() [L586] CALL Side2_activestandby_task_each_pals_period() [L323] int8_t side1 ; [L324] int8_t side2 ; [L325] msg_t manual_selection ; [L326] int8_t next_state ; [L329] side1 = nomsg [L330] side2 = nomsg [L331] manual_selection = (msg_t )0 [L332] side2Failed = __VERIFIER_nondet_bool() [L333] CALL write_side2_failed_history(side2Failed) [L107] side2Failed_History_2 = side2Failed_History_1 [L108] side2Failed_History_1 = side2Failed_History_0 [L109] side2Failed_History_0 = val [L333] RET write_side2_failed_history(side2Failed) [L334] COND FALSE !(\read(side2Failed)) [L341] side1 = s1s2_old [L342] s1s2_old = nomsg [L343] side2 = s2s2_old [L344] s2s2_old = nomsg [L345] manual_selection = cs2_old [L346] cs2_old = nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L347] COND TRUE (int )side1 == (int )side2 [L348] next_state = (int8_t )1 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L371] s2s1_new = next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new [L372] s2s2_new = next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new [L373] s2p_new = next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new [L374] side2_written = next_state VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L586] RET Side2_activestandby_task_each_pals_period() [L587] CALL Pendulum_prism_task_each_pals_period() [L380] int8_t active_side ; [L381] int8_t tmp ; [L382] int8_t side1 ; [L383] int8_t side2 ; VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L386] CALL, EXPR read_active_side_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L148] COND TRUE (int )index == 0 [L149] return (active_side_History_0); VAL [\old(index)=0, \result=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L386] RET, EXPR read_active_side_history((unsigned char)0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L386] tmp = read_active_side_history((unsigned char)0) [L387] active_side = tmp [L388] side1 = nomsg [L389] side2 = nomsg [L390] side1 = s1p_old [L391] s1p_old = nomsg [L392] side2 = s2p_old [L393] s2p_old = nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L394] COND FALSE !((int )side1 == 1) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L397] COND FALSE !((int )side2 == 1) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L400] COND FALSE !((int )side1 == 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L408] COND TRUE (int )side1 == (int )nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L409] COND FALSE !((int )side2 == 0) [L412] active_side = (int8_t )0 VAL [active_side=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L417] CALL write_active_side_history(active_side) [L137] active_side_History_2 = active_side_History_1 [L138] active_side_History_1 = active_side_History_0 [L139] active_side_History_0 = val [L417] RET write_active_side_history(active_side) [L587] RET Pendulum_prism_task_each_pals_period() [L588] cs1_old = cs1_new [L589] cs1_new = nomsg [L590] cs2_old = cs2_new [L591] cs2_new = nomsg [L592] s1s2_old = s1s2_new [L593] s1s2_new = nomsg [L594] s1s1_old = s1s1_new [L595] s1s1_new = nomsg [L596] s2s1_old = s2s1_new [L597] s2s1_new = nomsg [L598] s2s2_old = s2s2_new [L599] s2s2_new = nomsg [L600] s1p_old = s1p_new [L601] s1p_new = nomsg [L602] s2p_old = s2p_new [L603] s2p_new = nomsg [L604] CALL, EXPR check() [L423] int tmp ; [L424] msg_t tmp___0 ; [L425] _Bool tmp___1 ; [L426] _Bool tmp___2 ; [L427] _Bool tmp___3 ; [L428] _Bool tmp___4 ; [L429] int8_t tmp___5 ; [L430] _Bool tmp___6 ; [L431] _Bool tmp___7 ; [L432] _Bool tmp___8 ; [L433] int8_t tmp___9 ; [L434] _Bool tmp___10 ; [L435] _Bool tmp___11 ; [L436] _Bool tmp___12 ; [L437] msg_t tmp___13 ; [L438] _Bool tmp___14 ; [L439] _Bool tmp___15 ; [L440] _Bool tmp___16 ; [L441] _Bool tmp___17 ; [L442] int8_t tmp___18 ; [L443] int8_t tmp___19 ; [L444] int8_t tmp___20 ; VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L447] COND TRUE ! side1Failed [L448] tmp = 1 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1] [L455] CALL assume_abort_if_not((_Bool )tmp) VAL [\old(cond)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L58] COND FALSE !(!cond) VAL [\old(cond)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L455] RET assume_abort_if_not((_Bool )tmp) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1] [L456] CALL, EXPR read_manual_selection_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L178] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L181] COND TRUE (int )index == 1 [L182] return (manual_selection_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L456] RET, EXPR read_manual_selection_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1] [L456] tmp___0 = read_manual_selection_history((unsigned char)1) [L457] COND TRUE ! tmp___0 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1] [L458] CALL, EXPR read_side1_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L88] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L458] RET, EXPR read_side1_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1] [L458] tmp___1 = read_side1_failed_history((unsigned char)1) [L459] COND TRUE ! tmp___1 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1] [L460] CALL, EXPR read_side1_failed_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L88] COND TRUE (int )index == 0 [L89] return (side1Failed_History_0); VAL [\old(index)=0, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L460] RET, EXPR read_side1_failed_history((unsigned char)0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1] [L460] tmp___2 = read_side1_failed_history((unsigned char)0) [L461] COND TRUE ! tmp___2 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1] [L462] CALL, EXPR read_side2_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L118] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L121] COND TRUE (int )index == 1 [L122] return (side2Failed_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L462] RET, EXPR read_side2_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1] [L462] tmp___3 = read_side2_failed_history((unsigned char)1) [L463] COND TRUE ! tmp___3 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1] [L464] CALL, EXPR read_side2_failed_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L118] COND TRUE (int )index == 0 [L119] return (side2Failed_History_0); VAL [\old(index)=0, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L464] RET, EXPR read_side2_failed_history((unsigned char)0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1] [L464] tmp___4 = read_side2_failed_history((unsigned char)0) [L465] COND TRUE ! tmp___4 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1] [L466] COND FALSE !(! ((int )side1_written == 1)) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1] [L471] COND FALSE !(! (! ((int )side1_written == 0))) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1] [L476] COND TRUE ! (! ((int )side1_written == 1)) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1] [L477] COND TRUE ! ((int )side2_written == 0) [L478] return (0); VAL [\result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1] [L604] RET, EXPR check() [L604] c1 = check() [L605] CALL assert(c1) VAL [\old(arg)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L617] COND TRUE ! arg VAL [\old(arg)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] [L619] reach_error() VAL [\old(arg)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 171 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.4s, OverallIterations: 22, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3328 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3259 mSDsluCounter, 20332 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14726 mSDsCounter, 245 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1570 IncrementalHoareTripleChecker+Invalid, 1815 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 245 mSolverCounterUnsat, 5606 mSDtfsCounter, 1570 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 360 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1738occurred in iteration=21, InterpolantAutomatonStates: 111, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 21 MinimizatonAttempts, 1288 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 1443 NumberOfCodeBlocks, 1443 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1328 ConstructedInterpolants, 0 QuantifiedInterpolants, 3019 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 147/147 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-24 01:18:38,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE