./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.4_1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.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 ac8e60fb32c268c01bf0cc1d1cd76454411c67e3ab15d16b4eca5e74b982e97f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 19:58:13,071 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 19:58:13,164 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 19:58:13,174 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 19:58:13,176 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 19:58:13,219 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 19:58:13,220 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 19:58:13,220 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 19:58:13,221 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 19:58:13,221 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 19:58:13,221 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 19:58:13,222 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 19:58:13,222 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 19:58:13,222 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 19:58:13,223 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 19:58:13,223 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 19:58:13,228 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 19:58:13,228 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 19:58:13,229 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 19:58:13,229 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 19:58:13,229 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 19:58:13,232 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 19:58:13,236 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 19:58:13,236 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 19:58:13,236 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 19:58:13,237 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 19:58:13,237 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 19:58:13,237 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 19:58:13,237 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 19:58:13,237 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 19:58:13,238 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 19:58:13,238 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 19:58:13,238 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:58:13,238 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 19:58:13,238 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 19:58:13,238 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 19:58:13,239 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 19:58:13,239 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 19:58:13,239 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 19:58:13,240 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 19:58:13,240 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 19:58:13,244 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 19:58:13,244 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 -> ac8e60fb32c268c01bf0cc1d1cd76454411c67e3ab15d16b4eca5e74b982e97f [2024-10-12 19:58:13,587 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 19:58:13,603 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 19:58:13,605 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 19:58:13,606 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 19:58:13,606 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 19:58:13,607 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c [2024-10-12 19:58:14,899 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 19:58:15,148 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 19:58:15,148 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c [2024-10-12 19:58:15,164 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e01fbf199/0fe7af3e4f0245ae86db76dc45c145ee/FLAG400dfe3f7 [2024-10-12 19:58:15,504 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e01fbf199/0fe7af3e4f0245ae86db76dc45c145ee [2024-10-12 19:58:15,506 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 19:58:15,508 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 19:58:15,510 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 19:58:15,510 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 19:58:15,515 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 19:58:15,516 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:58:15" (1/1) ... [2024-10-12 19:58:15,516 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@341f808 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:58:15, skipping insertion in model container [2024-10-12 19:58:15,517 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:58:15" (1/1) ... [2024-10-12 19:58:15,545 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 19:58:15,789 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.4_1.ufo.UNBOUNDED.pals.c[14522,14535] [2024-10-12 19:58:15,819 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:58:15,830 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 19:58:15,887 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.4_1.ufo.UNBOUNDED.pals.c[14522,14535] [2024-10-12 19:58:15,887 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:58:15,906 INFO L204 MainTranslator]: Completed translation [2024-10-12 19:58:15,906 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:58:15 WrapperNode [2024-10-12 19:58:15,907 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 19:58:15,911 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 19:58:15,911 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 19:58:15,911 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 19:58:15,921 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:58:15" (1/1) ... [2024-10-12 19:58:15,937 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:58:15" (1/1) ... [2024-10-12 19:58:15,965 INFO L138 Inliner]: procedures = 32, calls = 48, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 502 [2024-10-12 19:58:15,966 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 19:58:15,967 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 19:58:15,967 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 19:58:15,967 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 19:58:15,975 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:58:15" (1/1) ... [2024-10-12 19:58:15,976 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:58:15" (1/1) ... [2024-10-12 19:58:15,979 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:58:15" (1/1) ... [2024-10-12 19:58:15,998 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 19:58:15,998 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:58:15" (1/1) ... [2024-10-12 19:58:15,999 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:58:15" (1/1) ... [2024-10-12 19:58:16,008 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:58:15" (1/1) ... [2024-10-12 19:58:16,012 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:58:15" (1/1) ... [2024-10-12 19:58:16,014 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:58:15" (1/1) ... [2024-10-12 19:58:16,016 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:58:15" (1/1) ... [2024-10-12 19:58:16,019 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 19:58:16,020 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 19:58:16,020 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 19:58:16,020 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 19:58:16,021 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:58:15" (1/1) ... [2024-10-12 19:58:16,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:58:16,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:58:16,051 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 19:58:16,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 19:58:16,088 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2024-10-12 19:58:16,088 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2024-10-12 19:58:16,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 19:58:16,088 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2024-10-12 19:58:16,088 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2024-10-12 19:58:16,088 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2024-10-12 19:58:16,088 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2024-10-12 19:58:16,089 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2024-10-12 19:58:16,089 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2024-10-12 19:58:16,089 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-12 19:58:16,089 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-12 19:58:16,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 19:58:16,089 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2024-10-12 19:58:16,089 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2024-10-12 19:58:16,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 19:58:16,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 19:58:16,090 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2024-10-12 19:58:16,090 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2024-10-12 19:58:16,172 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 19:58:16,174 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 19:58:16,639 INFO L? ?]: Removed 113 outVars from TransFormulas that were not future-live. [2024-10-12 19:58:16,639 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 19:58:16,699 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 19:58:16,699 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 19:58:16,699 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:58:16 BoogieIcfgContainer [2024-10-12 19:58:16,700 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 19:58:16,703 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 19:58:16,703 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 19:58:16,706 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 19:58:16,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 07:58:15" (1/3) ... [2024-10-12 19:58:16,708 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fae6e3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:58:16, skipping insertion in model container [2024-10-12 19:58:16,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:58:15" (2/3) ... [2024-10-12 19:58:16,708 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fae6e3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:58:16, skipping insertion in model container [2024-10-12 19:58:16,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:58:16" (3/3) ... [2024-10-12 19:58:16,709 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c [2024-10-12 19:58:16,722 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 19:58:16,722 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 19:58:16,789 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 19:58:16,795 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;@14eddd6c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 19:58:16,795 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 19:58:16,801 INFO L276 IsEmpty]: Start isEmpty. Operand has 168 states, 128 states have (on average 1.59375) 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-12 19:58:16,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-12 19:58:16,809 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:16,811 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-12 19:58:16,811 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:16,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:16,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1512492118, now seen corresponding path program 1 times [2024-10-12 19:58:16,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:16,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638272566] [2024-10-12 19:58:16,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:16,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:16,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:17,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 19:58:17,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:17,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:58:17,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:17,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638272566] [2024-10-12 19:58:17,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638272566] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:17,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:17,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 19:58:17,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460274976] [2024-10-12 19:58:17,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:17,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 19:58:17,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:17,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 19:58:17,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 19:58:17,051 INFO L87 Difference]: Start difference. First operand has 168 states, 128 states have (on average 1.59375) 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) 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-12 19:58:17,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:17,150 INFO L93 Difference]: Finished difference Result 319 states and 532 transitions. [2024-10-12 19:58:17,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 19:58:17,152 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-12 19:58:17,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:17,159 INFO L225 Difference]: With dead ends: 319 [2024-10-12 19:58:17,159 INFO L226 Difference]: Without dead ends: 166 [2024-10-12 19:58:17,164 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-12 19:58:17,166 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:58:17,167 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 256 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:58:17,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-10-12 19:58:17,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2024-10-12 19:58:17,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 127 states have (on average 1.5669291338582678) internal successors, (199), 128 states have internal predecessors, (199), 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-12 19:58:17,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 261 transitions. [2024-10-12 19:58:17,217 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 261 transitions. Word has length 23 [2024-10-12 19:58:17,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:17,217 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 261 transitions. [2024-10-12 19:58:17,217 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-12 19:58:17,217 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 261 transitions. [2024-10-12 19:58:17,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-12 19:58:17,224 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:17,224 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-12 19:58:17,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 19:58:17,225 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:17,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:17,226 INFO L85 PathProgramCache]: Analyzing trace with hash -481652588, now seen corresponding path program 1 times [2024-10-12 19:58:17,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:17,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518057747] [2024-10-12 19:58:17,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:17,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:17,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:17,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 19:58:17,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:17,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:58:17,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:17,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518057747] [2024-10-12 19:58:17,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518057747] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:17,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:17,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:58:17,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455979144] [2024-10-12 19:58:17,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:17,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:58:17,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:17,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:58:17,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:58:17,485 INFO L87 Difference]: Start difference. First operand 166 states and 261 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-12 19:58:17,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:17,580 INFO L93 Difference]: Finished difference Result 319 states and 497 transitions. [2024-10-12 19:58:17,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 19:58:17,581 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-12 19:58:17,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:17,583 INFO L225 Difference]: With dead ends: 319 [2024-10-12 19:58:17,583 INFO L226 Difference]: Without dead ends: 166 [2024-10-12 19:58:17,584 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-12 19:58:17,585 INFO L432 NwaCegarLoop]: 252 mSDtfsCounter, 0 mSDsluCounter, 988 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1240 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:58:17,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1240 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:58:17,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-10-12 19:58:17,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2024-10-12 19:58:17,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 127 states have (on average 1.4724409448818898) internal successors, (187), 128 states have internal predecessors, (187), 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-12 19:58:17,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 249 transitions. [2024-10-12 19:58:17,597 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 249 transitions. Word has length 23 [2024-10-12 19:58:17,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:17,598 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 249 transitions. [2024-10-12 19:58:17,598 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-12 19:58:17,598 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 249 transitions. [2024-10-12 19:58:17,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-12 19:58:17,599 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:17,599 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-12 19:58:17,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 19:58:17,599 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:17,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:17,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1100101477, now seen corresponding path program 1 times [2024-10-12 19:58:17,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:17,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879842621] [2024-10-12 19:58:17,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:17,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:17,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:17,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:17,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:17,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:58:17,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:17,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879842621] [2024-10-12 19:58:17,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879842621] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:17,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:17,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 19:58:17,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902450439] [2024-10-12 19:58:17,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:17,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 19:58:17,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:17,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 19:58:17,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 19:58:17,793 INFO L87 Difference]: Start difference. First operand 166 states and 249 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-12 19:58:17,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:17,863 INFO L93 Difference]: Finished difference Result 320 states and 489 transitions. [2024-10-12 19:58:17,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 19:58:17,864 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-12 19:58:17,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:17,866 INFO L225 Difference]: With dead ends: 320 [2024-10-12 19:58:17,869 INFO L226 Difference]: Without dead ends: 170 [2024-10-12 19:58:17,869 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-12 19:58:17,870 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 3 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 704 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.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:58:17,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 704 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:58:17,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-10-12 19:58:17,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2024-10-12 19:58:17,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 130 states have (on average 1.4615384615384615) internal successors, (190), 131 states have internal predecessors, (190), 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-12 19:58:17,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 252 transitions. [2024-10-12 19:58:17,891 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 252 transitions. Word has length 34 [2024-10-12 19:58:17,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:17,893 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 252 transitions. [2024-10-12 19:58:17,893 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-12 19:58:17,893 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 252 transitions. [2024-10-12 19:58:17,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-12 19:58:17,894 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:17,895 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-12 19:58:17,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 19:58:17,895 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:17,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:17,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1247131196, now seen corresponding path program 1 times [2024-10-12 19:58:17,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:17,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887226134] [2024-10-12 19:58:17,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:17,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:17,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:18,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:18,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:18,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 19:58:18,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:18,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-12 19:58:18,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:18,023 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-12 19:58:18,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:18,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887226134] [2024-10-12 19:58:18,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887226134] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:18,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:18,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 19:58:18,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479465654] [2024-10-12 19:58:18,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:18,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 19:58:18,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:18,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 19:58:18,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 19:58:18,027 INFO L87 Difference]: Start difference. First operand 170 states and 252 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-12 19:58:18,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:18,073 INFO L93 Difference]: Finished difference Result 467 states and 702 transitions. [2024-10-12 19:58:18,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 19:58:18,074 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-12 19:58:18,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:18,077 INFO L225 Difference]: With dead ends: 467 [2024-10-12 19:58:18,078 INFO L226 Difference]: Without dead ends: 313 [2024-10-12 19:58:18,079 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-12 19:58:18,082 INFO L432 NwaCegarLoop]: 249 mSDtfsCounter, 205 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 487 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-12 19:58:18,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 487 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:58:18,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2024-10-12 19:58:18,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 310. [2024-10-12 19:58:18,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 233 states have (on average 1.4763948497854078) internal successors, (344), 235 states have internal predecessors, (344), 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-12 19:58:18,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 464 transitions. [2024-10-12 19:58:18,116 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 464 transitions. Word has length 48 [2024-10-12 19:58:18,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:18,116 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 464 transitions. [2024-10-12 19:58:18,117 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-12 19:58:18,117 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 464 transitions. [2024-10-12 19:58:18,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-12 19:58:18,118 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:18,118 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-12 19:58:18,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 19:58:18,119 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:18,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:18,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1143351104, now seen corresponding path program 1 times [2024-10-12 19:58:18,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:18,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000220428] [2024-10-12 19:58:18,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:18,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:18,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:18,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:18,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:18,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 19:58:18,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:18,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 19:58:18,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:18,242 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-12 19:58:18,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:18,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000220428] [2024-10-12 19:58:18,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000220428] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:18,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:18,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 19:58:18,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93937672] [2024-10-12 19:58:18,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:18,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 19:58:18,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:18,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 19:58:18,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 19:58:18,247 INFO L87 Difference]: Start difference. First operand 310 states and 464 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-12 19:58:18,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:18,308 INFO L93 Difference]: Finished difference Result 874 states and 1318 transitions. [2024-10-12 19:58:18,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 19:58:18,308 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-12 19:58:18,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:18,314 INFO L225 Difference]: With dead ends: 874 [2024-10-12 19:58:18,315 INFO L226 Difference]: Without dead ends: 580 [2024-10-12 19:58:18,316 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-12 19:58:18,318 INFO L432 NwaCegarLoop]: 267 mSDtfsCounter, 206 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 507 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-12 19:58:18,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 507 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:58:18,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2024-10-12 19:58:18,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 574. [2024-10-12 19:58:18,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 425 states have (on average 1.484705882352941) internal successors, (631), 429 states have internal predecessors, (631), 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-12 19:58:18,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 865 transitions. [2024-10-12 19:58:18,347 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 865 transitions. Word has length 49 [2024-10-12 19:58:18,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:18,349 INFO L471 AbstractCegarLoop]: Abstraction has 574 states and 865 transitions. [2024-10-12 19:58:18,349 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-12 19:58:18,349 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 865 transitions. [2024-10-12 19:58:18,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-12 19:58:18,352 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:18,352 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-12 19:58:18,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 19:58:18,353 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:18,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:18,353 INFO L85 PathProgramCache]: Analyzing trace with hash -136512574, now seen corresponding path program 1 times [2024-10-12 19:58:18,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:18,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457765991] [2024-10-12 19:58:18,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:18,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:18,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:18,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:18,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:18,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 19:58:18,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:18,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 19:58:18,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:18,488 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-12 19:58:18,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:18,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457765991] [2024-10-12 19:58:18,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457765991] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:18,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:18,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 19:58:18,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037415210] [2024-10-12 19:58:18,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:18,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 19:58:18,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:18,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 19:58:18,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 19:58:18,490 INFO L87 Difference]: Start difference. First operand 574 states and 865 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-12 19:58:18,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:18,649 INFO L93 Difference]: Finished difference Result 1217 states and 1834 transitions. [2024-10-12 19:58:18,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 19:58:18,650 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-12 19:58:18,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:18,656 INFO L225 Difference]: With dead ends: 1217 [2024-10-12 19:58:18,656 INFO L226 Difference]: Without dead ends: 659 [2024-10-12 19:58:18,657 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-12 19:58:18,659 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 334 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:58:18,660 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 641 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:58:18,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2024-10-12 19:58:18,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 655. [2024-10-12 19:58:18,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 493 states have (on average 1.4726166328600405) internal successors, (726), 496 states have internal predecessors, (726), 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-12 19:58:18,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 974 transitions. [2024-10-12 19:58:18,705 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 974 transitions. Word has length 49 [2024-10-12 19:58:18,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:18,705 INFO L471 AbstractCegarLoop]: Abstraction has 655 states and 974 transitions. [2024-10-12 19:58:18,705 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-12 19:58:18,706 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 974 transitions. [2024-10-12 19:58:18,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-12 19:58:18,710 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:18,710 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-12 19:58:18,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 19:58:18,710 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:18,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:18,711 INFO L85 PathProgramCache]: Analyzing trace with hash 299113361, now seen corresponding path program 1 times [2024-10-12 19:58:18,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:18,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821007029] [2024-10-12 19:58:18,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:18,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:18,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:18,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:18,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:18,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 19:58:18,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:18,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:58:18,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:18,813 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-12 19:58:18,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:18,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821007029] [2024-10-12 19:58:18,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821007029] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:18,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:18,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 19:58:18,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482593065] [2024-10-12 19:58:18,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:18,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 19:58:18,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:18,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 19:58:18,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 19:58:18,816 INFO L87 Difference]: Start difference. First operand 655 states and 974 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-12 19:58:19,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:19,112 INFO L93 Difference]: Finished difference Result 1217 states and 1826 transitions. [2024-10-12 19:58:19,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 19:58:19,113 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-12 19:58:19,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:19,120 INFO L225 Difference]: With dead ends: 1217 [2024-10-12 19:58:19,120 INFO L226 Difference]: Without dead ends: 659 [2024-10-12 19:58:19,122 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-12 19:58:19,127 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 331 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:58:19,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 644 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 19:58:19,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2024-10-12 19:58:19,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 655. [2024-10-12 19:58:19,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 493 states have (on average 1.4645030425963488) internal successors, (722), 496 states have internal predecessors, (722), 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-12 19:58:19,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 970 transitions. [2024-10-12 19:58:19,191 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 970 transitions. Word has length 50 [2024-10-12 19:58:19,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:19,191 INFO L471 AbstractCegarLoop]: Abstraction has 655 states and 970 transitions. [2024-10-12 19:58:19,192 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-12 19:58:19,192 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 970 transitions. [2024-10-12 19:58:19,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-12 19:58:19,197 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:19,197 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] [2024-10-12 19:58:19,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 19:58:19,197 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:19,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:19,198 INFO L85 PathProgramCache]: Analyzing trace with hash 841576757, now seen corresponding path program 1 times [2024-10-12 19:58:19,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:19,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942924494] [2024-10-12 19:58:19,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:19,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:19,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:19,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:19,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:19,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 19:58:19,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:19,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 19:58:19,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:19,421 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-12 19:58:19,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:19,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942924494] [2024-10-12 19:58:19,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942924494] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:19,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:19,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 19:58:19,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783603092] [2024-10-12 19:58:19,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:19,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 19:58:19,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:19,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 19:58:19,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 19:58:19,426 INFO L87 Difference]: Start difference. First operand 655 states and 970 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 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-12 19:58:19,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:19,490 INFO L93 Difference]: Finished difference Result 1233 states and 1846 transitions. [2024-10-12 19:58:19,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 19:58:19,491 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 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 51 [2024-10-12 19:58:19,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:19,496 INFO L225 Difference]: With dead ends: 1233 [2024-10-12 19:58:19,498 INFO L226 Difference]: Without dead ends: 675 [2024-10-12 19:58:19,500 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-12 19:58:19,500 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 4 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 716 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-12 19:58:19,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 716 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:58:19,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2024-10-12 19:58:19,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 675. [2024-10-12 19:58:19,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 509 states have (on average 1.449901768172888) internal successors, (738), 512 states have internal predecessors, (738), 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-12 19:58:19,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 986 transitions. [2024-10-12 19:58:19,530 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 986 transitions. Word has length 51 [2024-10-12 19:58:19,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:19,531 INFO L471 AbstractCegarLoop]: Abstraction has 675 states and 986 transitions. [2024-10-12 19:58:19,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 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-12 19:58:19,531 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 986 transitions. [2024-10-12 19:58:19,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-12 19:58:19,533 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:19,533 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] [2024-10-12 19:58:19,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 19:58:19,533 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:19,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:19,534 INFO L85 PathProgramCache]: Analyzing trace with hash 741280384, now seen corresponding path program 1 times [2024-10-12 19:58:19,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:19,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709357558] [2024-10-12 19:58:19,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:19,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:19,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:19,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:19,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:19,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 19:58:19,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:19,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 19:58:19,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:19,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 19:58:19,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:19,755 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-12 19:58:19,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:19,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709357558] [2024-10-12 19:58:19,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709357558] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:19,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:19,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 19:58:19,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614613613] [2024-10-12 19:58:19,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:19,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 19:58:19,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:19,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 19:58:19,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 19:58:19,757 INFO L87 Difference]: Start difference. First operand 675 states and 986 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 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-12 19:58:19,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:19,873 INFO L93 Difference]: Finished difference Result 1273 states and 1890 transitions. [2024-10-12 19:58:19,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 19:58:19,874 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 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 59 [2024-10-12 19:58:19,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:19,877 INFO L225 Difference]: With dead ends: 1273 [2024-10-12 19:58:19,877 INFO L226 Difference]: Without dead ends: 695 [2024-10-12 19:58:19,879 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-12 19:58:19,880 INFO L432 NwaCegarLoop]: 237 mSDtfsCounter, 4 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 702 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-12 19:58:19,881 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 702 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:58:19,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2024-10-12 19:58:19,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 695. [2024-10-12 19:58:19,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 525 states have (on average 1.4361904761904762) internal successors, (754), 528 states have internal predecessors, (754), 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-12 19:58:19,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 1002 transitions. [2024-10-12 19:58:19,910 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 1002 transitions. Word has length 59 [2024-10-12 19:58:19,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:19,911 INFO L471 AbstractCegarLoop]: Abstraction has 695 states and 1002 transitions. [2024-10-12 19:58:19,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 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-12 19:58:19,912 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 1002 transitions. [2024-10-12 19:58:19,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-12 19:58:19,913 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:19,913 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] [2024-10-12 19:58:19,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 19:58:19,914 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:19,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:19,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1956794188, now seen corresponding path program 1 times [2024-10-12 19:58:19,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:19,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865599353] [2024-10-12 19:58:19,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:19,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:19,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:20,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:20,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:20,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 19:58:20,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:20,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 19:58:20,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:20,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 19:58:20,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:20,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-12 19:58:20,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:20,049 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-12 19:58:20,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:20,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865599353] [2024-10-12 19:58:20,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865599353] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:20,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:20,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 19:58:20,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168867035] [2024-10-12 19:58:20,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:20,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 19:58:20,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:20,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 19:58:20,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 19:58:20,051 INFO L87 Difference]: Start difference. First operand 695 states and 1002 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 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-12 19:58:20,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:20,122 INFO L93 Difference]: Finished difference Result 1313 states and 1922 transitions. [2024-10-12 19:58:20,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 19:58:20,123 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 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 67 [2024-10-12 19:58:20,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:20,126 INFO L225 Difference]: With dead ends: 1313 [2024-10-12 19:58:20,126 INFO L226 Difference]: Without dead ends: 715 [2024-10-12 19:58:20,128 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-12 19:58:20,128 INFO L432 NwaCegarLoop]: 237 mSDtfsCounter, 4 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 702 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-12 19:58:20,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 702 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:58:20,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2024-10-12 19:58:20,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 715. [2024-10-12 19:58:20,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 541 states have (on average 1.423290203327172) internal successors, (770), 544 states have internal predecessors, (770), 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-12 19:58:20,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1018 transitions. [2024-10-12 19:58:20,157 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1018 transitions. Word has length 67 [2024-10-12 19:58:20,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:20,157 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 1018 transitions. [2024-10-12 19:58:20,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 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-12 19:58:20,157 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1018 transitions. [2024-10-12 19:58:20,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-12 19:58:20,158 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:20,158 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] [2024-10-12 19:58:20,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 19:58:20,159 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:20,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:20,159 INFO L85 PathProgramCache]: Analyzing trace with hash -439665115, now seen corresponding path program 1 times [2024-10-12 19:58:20,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:20,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067885967] [2024-10-12 19:58:20,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:20,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:20,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:20,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:20,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:20,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 19:58:20,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:20,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 19:58:20,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:20,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 19:58:20,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:20,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-12 19:58:20,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:20,304 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-12 19:58:20,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:20,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067885967] [2024-10-12 19:58:20,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067885967] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:20,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:20,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 19:58:20,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462414555] [2024-10-12 19:58:20,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:20,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 19:58:20,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:20,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 19:58:20,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 19:58:20,306 INFO L87 Difference]: Start difference. First operand 715 states and 1018 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 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-12 19:58:20,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:20,379 INFO L93 Difference]: Finished difference Result 1349 states and 1938 transitions. [2024-10-12 19:58:20,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 19:58:20,379 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 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 67 [2024-10-12 19:58:20,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:20,383 INFO L225 Difference]: With dead ends: 1349 [2024-10-12 19:58:20,383 INFO L226 Difference]: Without dead ends: 731 [2024-10-12 19:58:20,384 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-12 19:58:20,385 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 3 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 712 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-12 19:58:20,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 712 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:58:20,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2024-10-12 19:58:20,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 731. [2024-10-12 19:58:20,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 731 states, 553 states have (on average 1.4141048824593128) internal successors, (782), 556 states have internal predecessors, (782), 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-12 19:58:20,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1030 transitions. [2024-10-12 19:58:20,411 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1030 transitions. Word has length 67 [2024-10-12 19:58:20,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:20,412 INFO L471 AbstractCegarLoop]: Abstraction has 731 states and 1030 transitions. [2024-10-12 19:58:20,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 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-12 19:58:20,412 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1030 transitions. [2024-10-12 19:58:20,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-12 19:58:20,413 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:20,413 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] [2024-10-12 19:58:20,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 19:58:20,413 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:20,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:20,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1540720212, now seen corresponding path program 1 times [2024-10-12 19:58:20,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:20,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546414684] [2024-10-12 19:58:20,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:20,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:20,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:20,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:20,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:20,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 19:58:20,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:20,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 19:58:20,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:20,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 19:58:20,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:20,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-12 19:58:20,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:20,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 19:58:20,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:20,552 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-12 19:58:20,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:20,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546414684] [2024-10-12 19:58:20,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546414684] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:20,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:20,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 19:58:20,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728189089] [2024-10-12 19:58:20,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:20,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 19:58:20,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:20,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 19:58:20,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 19:58:20,554 INFO L87 Difference]: Start difference. First operand 731 states and 1030 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, (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-12 19:58:20,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:20,642 INFO L93 Difference]: Finished difference Result 1389 states and 1974 transitions. [2024-10-12 19:58:20,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 19:58:20,643 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, (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 75 [2024-10-12 19:58:20,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:20,646 INFO L225 Difference]: With dead ends: 1389 [2024-10-12 19:58:20,646 INFO L226 Difference]: Without dead ends: 755 [2024-10-12 19:58:20,647 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-12 19:58:20,648 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 5 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 714 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-12 19:58:20,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 714 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:58:20,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2024-10-12 19:58:20,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 755. [2024-10-12 19:58:20,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 755 states, 573 states have (on average 1.399650959860384) internal successors, (802), 576 states have internal predecessors, (802), 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-12 19:58:20,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 1050 transitions. [2024-10-12 19:58:20,675 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 1050 transitions. Word has length 75 [2024-10-12 19:58:20,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:20,676 INFO L471 AbstractCegarLoop]: Abstraction has 755 states and 1050 transitions. [2024-10-12 19:58:20,676 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, (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-12 19:58:20,676 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 1050 transitions. [2024-10-12 19:58:20,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-12 19:58:20,677 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:20,677 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] [2024-10-12 19:58:20,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 19:58:20,678 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:20,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:20,678 INFO L85 PathProgramCache]: Analyzing trace with hash -224114551, now seen corresponding path program 1 times [2024-10-12 19:58:20,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:20,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959462423] [2024-10-12 19:58:20,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:20,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:20,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:21,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:21,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:21,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 19:58:21,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:21,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 19:58:21,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:21,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 19:58:21,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:21,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-12 19:58:21,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:21,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 19:58:21,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:21,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-12 19:58:21,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:21,100 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-12 19:58:21,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:21,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959462423] [2024-10-12 19:58:21,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959462423] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:21,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:21,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:58:21,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995274243] [2024-10-12 19:58:21,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:21,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:58:21,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:21,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:58:21,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:58:21,102 INFO L87 Difference]: Start difference. First operand 755 states and 1050 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 6 states have internal predecessors, (57), 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-12 19:58:21,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:21,327 INFO L93 Difference]: Finished difference Result 1971 states and 2725 transitions. [2024-10-12 19:58:21,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 19:58:21,327 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 6 states have internal predecessors, (57), 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 78 [2024-10-12 19:58:21,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:21,333 INFO L225 Difference]: With dead ends: 1971 [2024-10-12 19:58:21,333 INFO L226 Difference]: Without dead ends: 1313 [2024-10-12 19:58:21,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-12 19:58:21,335 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 204 mSDsluCounter, 1113 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 1355 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:58:21,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 1355 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:58:21,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1313 states. [2024-10-12 19:58:21,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1313 to 1031. [2024-10-12 19:58:21,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1031 states, 776 states have (on average 1.3865979381443299) internal successors, (1076), 781 states have internal predecessors, (1076), 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-12 19:58:21,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 1420 transitions. [2024-10-12 19:58:21,386 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 1420 transitions. Word has length 78 [2024-10-12 19:58:21,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:21,386 INFO L471 AbstractCegarLoop]: Abstraction has 1031 states and 1420 transitions. [2024-10-12 19:58:21,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 6 states have internal predecessors, (57), 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-12 19:58:21,387 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 1420 transitions. [2024-10-12 19:58:21,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-12 19:58:21,387 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:21,388 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] [2024-10-12 19:58:21,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 19:58:21,388 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:21,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:21,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1653300379, now seen corresponding path program 1 times [2024-10-12 19:58:21,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:21,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668197993] [2024-10-12 19:58:21,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:21,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:21,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:21,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:21,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:21,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 19:58:21,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:21,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 19:58:21,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:21,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 19:58:21,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:21,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-12 19:58:21,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:21,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 19:58:21,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:21,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-12 19:58:21,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:21,622 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-12 19:58:21,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:21,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668197993] [2024-10-12 19:58:21,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668197993] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:21,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:21,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 19:58:21,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197702512] [2024-10-12 19:58:21,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:21,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 19:58:21,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:21,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 19:58:21,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:58:21,624 INFO L87 Difference]: Start difference. First operand 1031 states and 1420 transitions. Second operand has 8 states, 6 states have (on average 9.5) internal successors, (57), 7 states have internal predecessors, (57), 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-12 19:58:21,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:21,822 INFO L93 Difference]: Finished difference Result 1437 states and 2078 transitions. [2024-10-12 19:58:21,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 19:58:21,823 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 9.5) internal successors, (57), 7 states have internal predecessors, (57), 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 81 [2024-10-12 19:58:21,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:21,829 INFO L225 Difference]: With dead ends: 1437 [2024-10-12 19:58:21,829 INFO L226 Difference]: Without dead ends: 1435 [2024-10-12 19:58:21,830 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-10-12 19:58:21,831 INFO L432 NwaCegarLoop]: 416 mSDtfsCounter, 251 mSDsluCounter, 2022 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 2438 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:58:21,831 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 2438 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:58:21,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1435 states. [2024-10-12 19:58:21,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1435 to 1039. [2024-10-12 19:58:21,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1039 states, 780 states have (on average 1.3846153846153846) internal successors, (1080), 787 states have internal predecessors, (1080), 174 states have call successors, (174), 84 states have call predecessors, (174), 84 states have return successors, (174), 167 states have call predecessors, (174), 174 states have call successors, (174) [2024-10-12 19:58:21,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 1039 states and 1428 transitions. [2024-10-12 19:58:21,894 INFO L78 Accepts]: Start accepts. Automaton has 1039 states and 1428 transitions. Word has length 81 [2024-10-12 19:58:21,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:21,895 INFO L471 AbstractCegarLoop]: Abstraction has 1039 states and 1428 transitions. [2024-10-12 19:58:21,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 9.5) internal successors, (57), 7 states have internal predecessors, (57), 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-12 19:58:21,895 INFO L276 IsEmpty]: Start isEmpty. Operand 1039 states and 1428 transitions. [2024-10-12 19:58:21,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-12 19:58:21,896 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:21,896 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] [2024-10-12 19:58:21,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 19:58:21,896 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:21,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:21,897 INFO L85 PathProgramCache]: Analyzing trace with hash 761700715, now seen corresponding path program 1 times [2024-10-12 19:58:21,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:21,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367574505] [2024-10-12 19:58:21,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:21,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:21,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:22,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:22,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:22,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 19:58:22,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:22,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 19:58:22,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:22,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 19:58:22,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:22,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-12 19:58:22,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:22,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 19:58:22,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:22,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-12 19:58:22,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:22,040 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-12 19:58:22,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:22,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367574505] [2024-10-12 19:58:22,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367574505] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:22,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:22,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 19:58:22,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424093195] [2024-10-12 19:58:22,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:22,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 19:58:22,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:22,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 19:58:22,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 19:58:22,042 INFO L87 Difference]: Start difference. First operand 1039 states and 1428 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 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-12 19:58:22,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:22,166 INFO L93 Difference]: Finished difference Result 1945 states and 2690 transitions. [2024-10-12 19:58:22,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 19:58:22,166 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 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 82 [2024-10-12 19:58:22,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:22,172 INFO L225 Difference]: With dead ends: 1945 [2024-10-12 19:58:22,172 INFO L226 Difference]: Without dead ends: 1063 [2024-10-12 19:58:22,174 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-12 19:58:22,174 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 3 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 712 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-12 19:58:22,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 712 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:58:22,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2024-10-12 19:58:22,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 1063. [2024-10-12 19:58:22,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1063 states, 798 states have (on average 1.3759398496240602) internal successors, (1098), 805 states have internal predecessors, (1098), 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-12 19:58:22,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 1063 states and 1446 transitions. [2024-10-12 19:58:22,252 INFO L78 Accepts]: Start accepts. Automaton has 1063 states and 1446 transitions. Word has length 82 [2024-10-12 19:58:22,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:22,252 INFO L471 AbstractCegarLoop]: Abstraction has 1063 states and 1446 transitions. [2024-10-12 19:58:22,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 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-12 19:58:22,252 INFO L276 IsEmpty]: Start isEmpty. Operand 1063 states and 1446 transitions. [2024-10-12 19:58:22,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-12 19:58:22,253 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:22,254 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] [2024-10-12 19:58:22,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 19:58:22,254 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:22,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:22,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1195123752, now seen corresponding path program 1 times [2024-10-12 19:58:22,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:22,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374215842] [2024-10-12 19:58:22,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:22,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:22,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:22,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:22,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:22,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 19:58:22,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:22,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 19:58:22,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:22,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 19:58:22,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:22,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-12 19:58:22,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:22,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 19:58:22,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:22,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-12 19:58:22,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:22,377 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-12 19:58:22,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:22,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374215842] [2024-10-12 19:58:22,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374215842] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:22,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:22,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:58:22,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585441379] [2024-10-12 19:58:22,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:22,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:58:22,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:22,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:58:22,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:58:22,379 INFO L87 Difference]: Start difference. First operand 1063 states and 1446 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 6 states have internal predecessors, (60), 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-12 19:58:22,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:22,549 INFO L93 Difference]: Finished difference Result 1913 states and 2605 transitions. [2024-10-12 19:58:22,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 19:58:22,549 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 6 states have internal predecessors, (60), 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 84 [2024-10-12 19:58:22,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:22,556 INFO L225 Difference]: With dead ends: 1913 [2024-10-12 19:58:22,556 INFO L226 Difference]: Without dead ends: 1089 [2024-10-12 19:58:22,559 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-12 19:58:22,560 INFO L432 NwaCegarLoop]: 243 mSDtfsCounter, 238 mSDsluCounter, 1154 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 1397 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-12 19:58:22,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 1397 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:58:22,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2024-10-12 19:58:22,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 1055. [2024-10-12 19:58:22,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1055 states, 801 states have (on average 1.3707865168539326) internal successors, (1098), 813 states have internal predecessors, (1098), 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-12 19:58:22,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1055 states to 1055 states and 1422 transitions. [2024-10-12 19:58:22,617 INFO L78 Accepts]: Start accepts. Automaton has 1055 states and 1422 transitions. Word has length 84 [2024-10-12 19:58:22,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:22,617 INFO L471 AbstractCegarLoop]: Abstraction has 1055 states and 1422 transitions. [2024-10-12 19:58:22,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 6 states have internal predecessors, (60), 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-12 19:58:22,618 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 1422 transitions. [2024-10-12 19:58:22,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-12 19:58:22,619 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:22,619 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] [2024-10-12 19:58:22,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 19:58:22,619 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:22,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:22,619 INFO L85 PathProgramCache]: Analyzing trace with hash -496735025, now seen corresponding path program 1 times [2024-10-12 19:58:22,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:22,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499820762] [2024-10-12 19:58:22,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:22,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:22,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:22,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:22,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:22,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 19:58:22,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:22,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 19:58:22,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:22,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 19:58:22,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:22,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-12 19:58:22,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:22,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 19:58:22,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:22,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-12 19:58:22,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:23,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-12 19:58:23,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:23,013 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-12 19:58:23,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:23,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499820762] [2024-10-12 19:58:23,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499820762] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:23,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:23,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:58:23,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429364946] [2024-10-12 19:58:23,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:23,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:58:23,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:23,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:58:23,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:58:23,015 INFO L87 Difference]: Start difference. First operand 1055 states and 1422 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, (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-12 19:58:23,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:23,207 INFO L93 Difference]: Finished difference Result 1887 states and 2551 transitions. [2024-10-12 19:58:23,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 19:58:23,208 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, (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 86 [2024-10-12 19:58:23,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:23,213 INFO L225 Difference]: With dead ends: 1887 [2024-10-12 19:58:23,213 INFO L226 Difference]: Without dead ends: 1051 [2024-10-12 19:58:23,215 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-12 19:58:23,215 INFO L432 NwaCegarLoop]: 266 mSDtfsCounter, 145 mSDsluCounter, 1223 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 1489 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-12 19:58:23,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 1489 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:58:23,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2024-10-12 19:58:23,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 948. [2024-10-12 19:58:23,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 948 states, 721 states have (on average 1.374479889042996) internal successors, (991), 731 states have internal predecessors, (991), 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-12 19:58:23,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1281 transitions. [2024-10-12 19:58:23,290 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1281 transitions. Word has length 86 [2024-10-12 19:58:23,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:23,290 INFO L471 AbstractCegarLoop]: Abstraction has 948 states and 1281 transitions. [2024-10-12 19:58:23,291 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, (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-12 19:58:23,291 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1281 transitions. [2024-10-12 19:58:23,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-12 19:58:23,291 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:23,292 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] [2024-10-12 19:58:23,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 19:58:23,292 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:23,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:23,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1997716092, now seen corresponding path program 1 times [2024-10-12 19:58:23,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:23,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965340657] [2024-10-12 19:58:23,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:23,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:23,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:23,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:23,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:23,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 19:58:23,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:23,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 19:58:23,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:23,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 19:58:23,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:23,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-12 19:58:23,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:23,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 19:58:23,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:23,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-12 19:58:23,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:23,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-12 19:58:23,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:23,658 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-12 19:58:23,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:23,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965340657] [2024-10-12 19:58:23,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965340657] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:23,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:23,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 19:58:23,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737977402] [2024-10-12 19:58:23,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:23,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 19:58:23,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:23,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 19:58:23,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:58:23,660 INFO L87 Difference]: Start difference. First operand 948 states and 1281 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 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-12 19:58:24,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:24,079 INFO L93 Difference]: Finished difference Result 1819 states and 2439 transitions. [2024-10-12 19:58:24,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 19:58:24,079 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 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 87 [2024-10-12 19:58:24,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:24,084 INFO L225 Difference]: With dead ends: 1819 [2024-10-12 19:58:24,084 INFO L226 Difference]: Without dead ends: 1009 [2024-10-12 19:58:24,085 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-12 19:58:24,086 INFO L432 NwaCegarLoop]: 257 mSDtfsCounter, 516 mSDsluCounter, 1058 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 1315 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 19:58:24,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 1315 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 19:58:24,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2024-10-12 19:58:24,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 964. [2024-10-12 19:58:24,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 964 states, 729 states have (on average 1.3497942386831276) internal successors, (984), 740 states have internal predecessors, (984), 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-12 19:58:24,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1280 transitions. [2024-10-12 19:58:24,139 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1280 transitions. Word has length 87 [2024-10-12 19:58:24,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:24,139 INFO L471 AbstractCegarLoop]: Abstraction has 964 states and 1280 transitions. [2024-10-12 19:58:24,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 7 states have internal predecessors, (64), 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-12 19:58:24,139 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1280 transitions. [2024-10-12 19:58:24,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-12 19:58:24,140 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:24,140 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] [2024-10-12 19:58:24,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 19:58:24,141 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:24,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:24,141 INFO L85 PathProgramCache]: Analyzing trace with hash 321058749, now seen corresponding path program 1 times [2024-10-12 19:58:24,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:24,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880647629] [2024-10-12 19:58:24,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:24,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:24,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:24,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:24,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:24,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-12 19:58:24,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:24,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 19:58:24,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:24,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 19:58:24,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:24,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 19:58:24,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:24,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 19:58:24,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:24,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-12 19:58:24,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:24,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-12 19:58:24,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:24,218 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-12 19:58:24,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:24,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880647629] [2024-10-12 19:58:24,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880647629] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:24,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:24,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 19:58:24,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628512384] [2024-10-12 19:58:24,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:24,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 19:58:24,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:24,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 19:58:24,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 19:58:24,220 INFO L87 Difference]: Start difference. First operand 964 states and 1280 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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-12 19:58:24,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:24,357 INFO L93 Difference]: Finished difference Result 2565 states and 3422 transitions. [2024-10-12 19:58:24,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 19:58:24,358 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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 88 [2024-10-12 19:58:24,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:24,365 INFO L225 Difference]: With dead ends: 2565 [2024-10-12 19:58:24,365 INFO L226 Difference]: Without dead ends: 1790 [2024-10-12 19:58:24,367 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-12 19:58:24,367 INFO L432 NwaCegarLoop]: 428 mSDtfsCounter, 195 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 1076 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.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:58:24,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 1076 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:58:24,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states. [2024-10-12 19:58:24,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1683. [2024-10-12 19:58:24,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1683 states, 1258 states have (on average 1.3394276629570747) internal successors, (1685), 1277 states have internal predecessors, (1685), 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-12 19:58:24,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1683 states to 1683 states and 2229 transitions. [2024-10-12 19:58:24,537 INFO L78 Accepts]: Start accepts. Automaton has 1683 states and 2229 transitions. Word has length 88 [2024-10-12 19:58:24,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:24,537 INFO L471 AbstractCegarLoop]: Abstraction has 1683 states and 2229 transitions. [2024-10-12 19:58:24,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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-12 19:58:24,537 INFO L276 IsEmpty]: Start isEmpty. Operand 1683 states and 2229 transitions. [2024-10-12 19:58:24,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-12 19:58:24,539 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:24,539 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-12 19:58:24,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 19:58:24,539 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:24,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:24,540 INFO L85 PathProgramCache]: Analyzing trace with hash -61134094, now seen corresponding path program 1 times [2024-10-12 19:58:24,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:24,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669164924] [2024-10-12 19:58:24,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:24,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:24,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:24,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:24,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:24,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-12 19:58:24,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:24,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 19:58:24,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:24,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 19:58:24,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:24,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 19:58:24,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:24,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 19:58:24,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:24,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-12 19:58:24,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:24,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-12 19:58:24,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:24,886 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-12 19:58:24,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:24,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669164924] [2024-10-12 19:58:24,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669164924] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:24,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:24,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:58:24,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575770390] [2024-10-12 19:58:24,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:24,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:58:24,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:24,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:58:24,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:58:24,888 INFO L87 Difference]: Start difference. First operand 1683 states and 2229 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 states have internal predecessors, (67), 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-12 19:58:25,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:25,403 INFO L93 Difference]: Finished difference Result 3297 states and 4357 transitions. [2024-10-12 19:58:25,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 19:58:25,403 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 states have internal predecessors, (67), 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 90 [2024-10-12 19:58:25,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:25,416 INFO L225 Difference]: With dead ends: 3297 [2024-10-12 19:58:25,416 INFO L226 Difference]: Without dead ends: 1875 [2024-10-12 19:58:25,422 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-12 19:58:25,423 INFO L432 NwaCegarLoop]: 291 mSDtfsCounter, 469 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 1331 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-12 19:58:25,430 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 1331 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 19:58:25,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1875 states. [2024-10-12 19:58:25,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1875 to 1712. [2024-10-12 19:58:25,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1712 states, 1274 states have (on average 1.3320251177394034) internal successors, (1697), 1294 states have internal predecessors, (1697), 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-12 19:58:25,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1712 states to 1712 states and 2257 transitions. [2024-10-12 19:58:25,588 INFO L78 Accepts]: Start accepts. Automaton has 1712 states and 2257 transitions. Word has length 90 [2024-10-12 19:58:25,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:25,589 INFO L471 AbstractCegarLoop]: Abstraction has 1712 states and 2257 transitions. [2024-10-12 19:58:25,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 states have internal predecessors, (67), 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-12 19:58:25,589 INFO L276 IsEmpty]: Start isEmpty. Operand 1712 states and 2257 transitions. [2024-10-12 19:58:25,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-12 19:58:25,590 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:25,590 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-12 19:58:25,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-12 19:58:25,590 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:25,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:25,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1601327255, now seen corresponding path program 1 times [2024-10-12 19:58:25,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:25,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163445667] [2024-10-12 19:58:25,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:25,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:25,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:25,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:25,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:25,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 19:58:25,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:25,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 19:58:25,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:25,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-12 19:58:25,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:25,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-12 19:58:25,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:25,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-12 19:58:25,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:25,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 19:58:25,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:25,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-12 19:58:25,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:25,682 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-12 19:58:25,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:25,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163445667] [2024-10-12 19:58:25,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163445667] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:25,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:25,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 19:58:25,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991164761] [2024-10-12 19:58:25,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:25,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 19:58:25,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:25,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 19:58:25,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 19:58:25,684 INFO L87 Difference]: Start difference. First operand 1712 states and 2257 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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-12 19:58:26,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:26,009 INFO L93 Difference]: Finished difference Result 4366 states and 5785 transitions. [2024-10-12 19:58:26,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 19:58:26,009 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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 92 [2024-10-12 19:58:26,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:26,019 INFO L225 Difference]: With dead ends: 4366 [2024-10-12 19:58:26,019 INFO L226 Difference]: Without dead ends: 2960 [2024-10-12 19:58:26,022 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-12 19:58:26,022 INFO L432 NwaCegarLoop]: 444 mSDtfsCounter, 200 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 1112 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:58:26,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 1112 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:58:26,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2960 states. [2024-10-12 19:58:26,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2960 to 2713. [2024-10-12 19:58:26,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2713 states, 2000 states have (on average 1.319) internal successors, (2638), 2031 states have internal predecessors, (2638), 460 states have call successors, (460), 252 states have call predecessors, (460), 252 states have return successors, (460), 429 states have call predecessors, (460), 460 states have call successors, (460) [2024-10-12 19:58:26,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2713 states to 2713 states and 3558 transitions. [2024-10-12 19:58:26,199 INFO L78 Accepts]: Start accepts. Automaton has 2713 states and 3558 transitions. Word has length 92 [2024-10-12 19:58:26,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:26,199 INFO L471 AbstractCegarLoop]: Abstraction has 2713 states and 3558 transitions. [2024-10-12 19:58:26,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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-12 19:58:26,200 INFO L276 IsEmpty]: Start isEmpty. Operand 2713 states and 3558 transitions. [2024-10-12 19:58:26,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-12 19:58:26,201 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:26,202 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-12 19:58:26,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-12 19:58:26,202 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:26,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:26,202 INFO L85 PathProgramCache]: Analyzing trace with hash -454143171, now seen corresponding path program 1 times [2024-10-12 19:58:26,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:26,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183220801] [2024-10-12 19:58:26,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:26,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:26,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:26,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:26,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:26,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 19:58:26,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:26,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 19:58:26,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:26,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-12 19:58:26,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:26,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-12 19:58:26,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:26,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-12 19:58:26,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:26,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 19:58:26,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:26,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 19:58:26,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:26,320 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-12 19:58:26,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:26,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183220801] [2024-10-12 19:58:26,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183220801] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:26,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:26,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 19:58:26,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302765684] [2024-10-12 19:58:26,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:26,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 19:58:26,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:26,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 19:58:26,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 19:58:26,322 INFO L87 Difference]: Start difference. First operand 2713 states and 3558 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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-12 19:58:26,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:26,717 INFO L93 Difference]: Finished difference Result 6366 states and 8382 transitions. [2024-10-12 19:58:26,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 19:58:26,718 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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 92 [2024-10-12 19:58:26,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:26,746 INFO L225 Difference]: With dead ends: 6366 [2024-10-12 19:58:26,746 INFO L226 Difference]: Without dead ends: 4071 [2024-10-12 19:58:26,754 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-12 19:58:26,755 INFO L432 NwaCegarLoop]: 454 mSDtfsCounter, 194 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 1126 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:58:26,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 1126 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:58:26,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4071 states. [2024-10-12 19:58:27,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4071 to 3900. [2024-10-12 19:58:27,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3900 states, 2863 states have (on average 1.3143555710792874) internal successors, (3763), 2907 states have internal predecessors, (3763), 672 states have call successors, (672), 364 states have call predecessors, (672), 364 states have return successors, (672), 628 states have call predecessors, (672), 672 states have call successors, (672) [2024-10-12 19:58:27,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3900 states to 3900 states and 5107 transitions. [2024-10-12 19:58:27,225 INFO L78 Accepts]: Start accepts. Automaton has 3900 states and 5107 transitions. Word has length 92 [2024-10-12 19:58:27,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:27,225 INFO L471 AbstractCegarLoop]: Abstraction has 3900 states and 5107 transitions. [2024-10-12 19:58:27,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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-12 19:58:27,226 INFO L276 IsEmpty]: Start isEmpty. Operand 3900 states and 5107 transitions. [2024-10-12 19:58:27,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-12 19:58:27,228 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:27,228 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] [2024-10-12 19:58:27,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-12 19:58:27,228 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:27,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:27,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1702199078, now seen corresponding path program 1 times [2024-10-12 19:58:27,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:27,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88362765] [2024-10-12 19:58:27,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:27,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:27,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:27,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:27,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:27,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-12 19:58:27,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:27,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 19:58:27,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:27,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-12 19:58:27,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:27,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-12 19:58:27,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:27,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-12 19:58:27,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:27,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 19:58:27,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:27,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-12 19:58:27,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:27,282 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-12 19:58:27,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:27,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88362765] [2024-10-12 19:58:27,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88362765] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:27,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:27,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 19:58:27,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620975323] [2024-10-12 19:58:27,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:27,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 19:58:27,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:27,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 19:58:27,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 19:58:27,284 INFO L87 Difference]: Start difference. First operand 3900 states and 5107 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 2 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-12 19:58:27,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:27,588 INFO L93 Difference]: Finished difference Result 7513 states and 9879 transitions. [2024-10-12 19:58:27,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 19:58:27,588 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 2 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 93 [2024-10-12 19:58:27,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:27,610 INFO L225 Difference]: With dead ends: 7513 [2024-10-12 19:58:27,611 INFO L226 Difference]: Without dead ends: 3933 [2024-10-12 19:58:27,619 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 19:58:27,619 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 6 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:58:27,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 460 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:58:27,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3933 states. [2024-10-12 19:58:27,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3933 to 3906. [2024-10-12 19:58:27,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3906 states, 2869 states have (on average 1.3136981526664342) internal successors, (3769), 2913 states have internal predecessors, (3769), 672 states have call successors, (672), 364 states have call predecessors, (672), 364 states have return successors, (672), 628 states have call predecessors, (672), 672 states have call successors, (672) [2024-10-12 19:58:27,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3906 states to 3906 states and 5113 transitions. [2024-10-12 19:58:27,885 INFO L78 Accepts]: Start accepts. Automaton has 3906 states and 5113 transitions. Word has length 93 [2024-10-12 19:58:27,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:27,885 INFO L471 AbstractCegarLoop]: Abstraction has 3906 states and 5113 transitions. [2024-10-12 19:58:27,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 2 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-12 19:58:27,885 INFO L276 IsEmpty]: Start isEmpty. Operand 3906 states and 5113 transitions. [2024-10-12 19:58:27,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-12 19:58:27,887 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:27,887 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-12 19:58:27,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-12 19:58:27,887 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:27,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:27,887 INFO L85 PathProgramCache]: Analyzing trace with hash -607814792, now seen corresponding path program 1 times [2024-10-12 19:58:27,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:27,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299480427] [2024-10-12 19:58:27,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:27,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:27,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:27,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:27,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:27,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 19:58:27,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:27,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 19:58:27,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:27,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-12 19:58:27,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:27,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-12 19:58:27,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:27,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-12 19:58:27,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:27,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 19:58:27,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:27,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 19:58:27,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:27,986 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-12 19:58:27,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:27,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299480427] [2024-10-12 19:58:27,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299480427] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:27,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:27,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 19:58:27,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102793402] [2024-10-12 19:58:27,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:27,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 19:58:27,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:27,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 19:58:27,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 19:58:27,989 INFO L87 Difference]: Start difference. First operand 3906 states and 5113 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 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-12 19:58:28,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:28,278 INFO L93 Difference]: Finished difference Result 7479 states and 9807 transitions. [2024-10-12 19:58:28,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 19:58:28,280 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 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 94 [2024-10-12 19:58:28,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:28,303 INFO L225 Difference]: With dead ends: 7479 [2024-10-12 19:58:28,303 INFO L226 Difference]: Without dead ends: 3635 [2024-10-12 19:58:28,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 19:58:28,314 INFO L432 NwaCegarLoop]: 247 mSDtfsCounter, 74 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:58:28,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 695 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:58:28,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3635 states. [2024-10-12 19:58:28,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3635 to 3572. [2024-10-12 19:58:28,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3572 states, 2618 states have (on average 1.322383498854087) internal successors, (3462), 2652 states have internal predecessors, (3462), 620 states have call successors, (620), 333 states have call predecessors, (620), 333 states have return successors, (620), 586 states have call predecessors, (620), 620 states have call successors, (620) [2024-10-12 19:58:28,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3572 states to 3572 states and 4702 transitions. [2024-10-12 19:58:28,536 INFO L78 Accepts]: Start accepts. Automaton has 3572 states and 4702 transitions. Word has length 94 [2024-10-12 19:58:28,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:28,536 INFO L471 AbstractCegarLoop]: Abstraction has 3572 states and 4702 transitions. [2024-10-12 19:58:28,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 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-12 19:58:28,537 INFO L276 IsEmpty]: Start isEmpty. Operand 3572 states and 4702 transitions. [2024-10-12 19:58:28,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-12 19:58:28,538 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:28,538 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, 1] [2024-10-12 19:58:28,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-12 19:58:28,538 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:28,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:28,539 INFO L85 PathProgramCache]: Analyzing trace with hash 36212784, now seen corresponding path program 1 times [2024-10-12 19:58:28,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:28,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532620018] [2024-10-12 19:58:28,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:28,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:28,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:28,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:28,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:28,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-12 19:58:28,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:28,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 19:58:28,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:28,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-12 19:58:28,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:28,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-12 19:58:28,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:28,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-12 19:58:28,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:28,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 19:58:28,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:28,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-12 19:58:28,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:28,601 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-12 19:58:28,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:28,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532620018] [2024-10-12 19:58:28,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532620018] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:28,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:28,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 19:58:28,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675448342] [2024-10-12 19:58:28,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:28,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 19:58:28,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:28,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 19:58:28,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 19:58:28,604 INFO L87 Difference]: Start difference. First operand 3572 states and 4702 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 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-12 19:58:28,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:28,865 INFO L93 Difference]: Finished difference Result 7032 states and 9292 transitions. [2024-10-12 19:58:28,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 19:58:28,866 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 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 95 [2024-10-12 19:58:28,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:28,888 INFO L225 Difference]: With dead ends: 7032 [2024-10-12 19:58:28,888 INFO L226 Difference]: Without dead ends: 3623 [2024-10-12 19:58:28,896 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 19:58:28,897 INFO L432 NwaCegarLoop]: 246 mSDtfsCounter, 6 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:58:28,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 460 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:58:28,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3623 states. [2024-10-12 19:58:29,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3623 to 3582. [2024-10-12 19:58:29,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3582 states, 2628 states have (on average 1.3211567732115677) internal successors, (3472), 2662 states have internal predecessors, (3472), 620 states have call successors, (620), 333 states have call predecessors, (620), 333 states have return successors, (620), 586 states have call predecessors, (620), 620 states have call successors, (620) [2024-10-12 19:58:29,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3582 states to 3582 states and 4712 transitions. [2024-10-12 19:58:29,123 INFO L78 Accepts]: Start accepts. Automaton has 3582 states and 4712 transitions. Word has length 95 [2024-10-12 19:58:29,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:29,123 INFO L471 AbstractCegarLoop]: Abstraction has 3582 states and 4712 transitions. [2024-10-12 19:58:29,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 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-12 19:58:29,124 INFO L276 IsEmpty]: Start isEmpty. Operand 3582 states and 4712 transitions. [2024-10-12 19:58:29,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-12 19:58:29,125 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:29,125 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, 1] [2024-10-12 19:58:29,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-12 19:58:29,125 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:29,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:29,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1078802283, now seen corresponding path program 1 times [2024-10-12 19:58:29,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:29,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888088019] [2024-10-12 19:58:29,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:29,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:29,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:29,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:29,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:29,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-12 19:58:29,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:29,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 19:58:29,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:29,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-12 19:58:29,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:29,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-12 19:58:29,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:29,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-12 19:58:29,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:29,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 19:58:29,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:29,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-12 19:58:29,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:29,292 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-12 19:58:29,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:29,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888088019] [2024-10-12 19:58:29,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888088019] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:29,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:29,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 19:58:29,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502841199] [2024-10-12 19:58:29,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:29,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 19:58:29,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:29,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 19:58:29,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 19:58:29,295 INFO L87 Difference]: Start difference. First operand 3582 states and 4712 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 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-12 19:58:29,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:29,636 INFO L93 Difference]: Finished difference Result 6982 states and 9202 transitions. [2024-10-12 19:58:29,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 19:58:29,637 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 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 95 [2024-10-12 19:58:29,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:29,654 INFO L225 Difference]: With dead ends: 6982 [2024-10-12 19:58:29,654 INFO L226 Difference]: Without dead ends: 3505 [2024-10-12 19:58:29,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 19:58:29,663 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 56 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:58:29,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 700 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:58:29,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3505 states. [2024-10-12 19:58:29,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3505 to 2697. [2024-10-12 19:58:29,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2697 states, 1977 states have (on average 1.3131006575619626) internal successors, (2596), 1996 states have internal predecessors, (2596), 469 states have call successors, (469), 250 states have call predecessors, (469), 250 states have return successors, (469), 450 states have call predecessors, (469), 469 states have call successors, (469) [2024-10-12 19:58:29,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2697 states to 2697 states and 3534 transitions. [2024-10-12 19:58:29,968 INFO L78 Accepts]: Start accepts. Automaton has 2697 states and 3534 transitions. Word has length 95 [2024-10-12 19:58:29,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:29,969 INFO L471 AbstractCegarLoop]: Abstraction has 2697 states and 3534 transitions. [2024-10-12 19:58:29,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 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-12 19:58:29,969 INFO L276 IsEmpty]: Start isEmpty. Operand 2697 states and 3534 transitions. [2024-10-12 19:58:29,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-12 19:58:29,973 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:29,973 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:58:29,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-12 19:58:29,973 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:29,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:29,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1226463043, now seen corresponding path program 1 times [2024-10-12 19:58:29,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:29,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441279085] [2024-10-12 19:58:29,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:29,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:30,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:30,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:30,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:30,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 19:58:30,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:30,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 19:58:30,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:30,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 19:58:30,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:30,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-12 19:58:30,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:30,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 19:58:30,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:30,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-12 19:58:30,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:30,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-12 19:58:30,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:30,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-12 19:58:30,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:30,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-12 19:58:30,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:30,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-12 19:58:30,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:30,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-12 19:58:30,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:30,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-12 19:58:30,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:30,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-12 19:58:30,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:30,347 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-12 19:58:30,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:30,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441279085] [2024-10-12 19:58:30,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441279085] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:58:30,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690429971] [2024-10-12 19:58:30,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:30,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:58:30,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:58:30,350 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 19:58:30,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 19:58:30,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:30,527 INFO L255 TraceCheckSpWp]: Trace formula consists of 619 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-12 19:58:30,540 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:58:30,795 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 27 proven. 42 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-12 19:58:30,795 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:58:31,072 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-12 19:58:31,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1690429971] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 19:58:31,073 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 19:58:31,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 8] total 22 [2024-10-12 19:58:31,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704202195] [2024-10-12 19:58:31,073 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 19:58:31,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-12 19:58:31,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:31,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-12 19:58:31,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2024-10-12 19:58:31,074 INFO L87 Difference]: Start difference. First operand 2697 states and 3534 transitions. Second operand has 22 states, 22 states have (on average 9.772727272727273) internal successors, (215), 20 states have internal predecessors, (215), 9 states have call successors, (41), 4 states have call predecessors, (41), 7 states have return successors, (40), 11 states have call predecessors, (40), 9 states have call successors, (40) [2024-10-12 19:58:35,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:35,530 INFO L93 Difference]: Finished difference Result 11254 states and 14679 transitions. [2024-10-12 19:58:35,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2024-10-12 19:58:35,531 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 9.772727272727273) internal successors, (215), 20 states have internal predecessors, (215), 9 states have call successors, (41), 4 states have call predecessors, (41), 7 states have return successors, (40), 11 states have call predecessors, (40), 9 states have call successors, (40) Word has length 138 [2024-10-12 19:58:35,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:35,570 INFO L225 Difference]: With dead ends: 11254 [2024-10-12 19:58:35,571 INFO L226 Difference]: Without dead ends: 8759 [2024-10-12 19:58:35,580 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 313 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1846 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1180, Invalid=5300, Unknown=0, NotChecked=0, Total=6480 [2024-10-12 19:58:35,580 INFO L432 NwaCegarLoop]: 339 mSDtfsCounter, 4906 mSDsluCounter, 3352 mSDsCounter, 0 mSdLazyCounter, 1694 mSolverCounterSat, 1939 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4906 SdHoareTripleChecker+Valid, 3691 SdHoareTripleChecker+Invalid, 3633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1939 IncrementalHoareTripleChecker+Valid, 1694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-12 19:58:35,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4906 Valid, 3691 Invalid, 3633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1939 Valid, 1694 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-12 19:58:35,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8759 states. [2024-10-12 19:58:36,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8759 to 7287. [2024-10-12 19:58:36,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7287 states, 5330 states have (on average 1.302063789868668) internal successors, (6940), 5382 states have internal predecessors, (6940), 1259 states have call successors, (1259), 697 states have call predecessors, (1259), 697 states have return successors, (1259), 1207 states have call predecessors, (1259), 1259 states have call successors, (1259) [2024-10-12 19:58:36,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7287 states to 7287 states and 9458 transitions. [2024-10-12 19:58:36,230 INFO L78 Accepts]: Start accepts. Automaton has 7287 states and 9458 transitions. Word has length 138 [2024-10-12 19:58:36,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:36,230 INFO L471 AbstractCegarLoop]: Abstraction has 7287 states and 9458 transitions. [2024-10-12 19:58:36,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 9.772727272727273) internal successors, (215), 20 states have internal predecessors, (215), 9 states have call successors, (41), 4 states have call predecessors, (41), 7 states have return successors, (40), 11 states have call predecessors, (40), 9 states have call successors, (40) [2024-10-12 19:58:36,231 INFO L276 IsEmpty]: Start isEmpty. Operand 7287 states and 9458 transitions. [2024-10-12 19:58:36,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-12 19:58:36,239 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:36,240 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:58:36,258 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 19:58:36,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-10-12 19:58:36,441 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:36,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:36,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1381769569, now seen corresponding path program 1 times [2024-10-12 19:58:36,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:36,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869498992] [2024-10-12 19:58:36,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:36,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:36,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:36,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:36,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:36,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-12 19:58:36,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:36,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-12 19:58:36,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:36,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 19:58:36,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:36,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 19:58:36,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:36,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 19:58:36,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:36,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 19:58:36,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:36,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-12 19:58:36,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:36,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-12 19:58:36,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:36,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-12 19:58:36,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:36,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-12 19:58:36,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:36,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-12 19:58:36,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:36,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-12 19:58:36,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:36,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-12 19:58:36,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:36,617 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-10-12 19:58:36,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:36,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869498992] [2024-10-12 19:58:36,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869498992] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:36,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:36,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:58:36,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628333049] [2024-10-12 19:58:36,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:36,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:58:36,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:36,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:58:36,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:58:36,619 INFO L87 Difference]: Start difference. First operand 7287 states and 9458 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 6 states have internal predecessors, (82), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-12 19:58:38,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:38,011 INFO L93 Difference]: Finished difference Result 21173 states and 27582 transitions. [2024-10-12 19:58:38,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 19:58:38,012 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 6 states have internal predecessors, (82), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 141 [2024-10-12 19:58:38,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:38,071 INFO L225 Difference]: With dead ends: 21173 [2024-10-12 19:58:38,072 INFO L226 Difference]: Without dead ends: 14346 [2024-10-12 19:58:38,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 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-12 19:58:38,093 INFO L432 NwaCegarLoop]: 376 mSDtfsCounter, 215 mSDsluCounter, 1656 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 2032 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:58:38,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 2032 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:58:38,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14346 states. [2024-10-12 19:58:39,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14346 to 12116. [2024-10-12 19:58:39,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12116 states, 8795 states have (on average 1.3022171688459352) internal successors, (11453), 8885 states have internal predecessors, (11453), 2161 states have call successors, (2161), 1159 states have call predecessors, (2161), 1159 states have return successors, (2161), 2071 states have call predecessors, (2161), 2161 states have call successors, (2161) [2024-10-12 19:58:39,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12116 states to 12116 states and 15775 transitions. [2024-10-12 19:58:39,378 INFO L78 Accepts]: Start accepts. Automaton has 12116 states and 15775 transitions. Word has length 141 [2024-10-12 19:58:39,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:39,379 INFO L471 AbstractCegarLoop]: Abstraction has 12116 states and 15775 transitions. [2024-10-12 19:58:39,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 6 states have internal predecessors, (82), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-12 19:58:39,379 INFO L276 IsEmpty]: Start isEmpty. Operand 12116 states and 15775 transitions. [2024-10-12 19:58:39,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-12 19:58:39,393 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:39,393 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:58:39,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-12 19:58:39,394 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:39,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:39,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1987662181, now seen corresponding path program 1 times [2024-10-12 19:58:39,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:39,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060848319] [2024-10-12 19:58:39,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:39,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:39,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:39,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:39,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:39,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 19:58:39,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:39,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 19:58:39,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:39,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-12 19:58:40,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:40,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-12 19:58:40,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:40,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-12 19:58:40,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:40,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 19:58:40,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:40,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-12 19:58:40,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:40,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-12 19:58:40,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:40,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-12 19:58:40,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:40,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-12 19:58:40,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:40,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-12 19:58:40,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:40,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-12 19:58:40,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:40,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-12 19:58:40,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:40,100 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 19 proven. 6 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-12 19:58:40,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:40,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060848319] [2024-10-12 19:58:40,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060848319] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:58:40,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816622460] [2024-10-12 19:58:40,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:40,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:58:40,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:58:40,102 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 19:58:40,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 19:58:40,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:40,265 INFO L255 TraceCheckSpWp]: Trace formula consists of 653 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-12 19:58:40,271 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:58:40,486 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 48 proven. 20 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-12 19:58:40,486 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:58:40,684 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-12 19:58:40,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1816622460] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-12 19:58:40,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-12 19:58:40,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9, 11] total 25 [2024-10-12 19:58:40,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699700390] [2024-10-12 19:58:40,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:40,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 19:58:40,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:40,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 19:58:40,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2024-10-12 19:58:40,686 INFO L87 Difference]: Start difference. First operand 12116 states and 15775 transitions. Second operand has 9 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-12 19:58:41,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:41,728 INFO L93 Difference]: Finished difference Result 23836 states and 31056 transitions. [2024-10-12 19:58:41,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 19:58:41,729 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 141 [2024-10-12 19:58:41,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:41,788 INFO L225 Difference]: With dead ends: 23836 [2024-10-12 19:58:41,788 INFO L226 Difference]: Without dead ends: 12180 [2024-10-12 19:58:41,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=667, Unknown=0, NotChecked=0, Total=756 [2024-10-12 19:58:41,814 INFO L432 NwaCegarLoop]: 253 mSDtfsCounter, 372 mSDsluCounter, 1147 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 1400 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:58:41,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 1400 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 19:58:41,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12180 states. [2024-10-12 19:58:42,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12180 to 8236. [2024-10-12 19:58:42,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8236 states, 6009 states have (on average 1.3058745215510068) internal successors, (7847), 6064 states have internal predecessors, (7847), 1444 states have call successors, (1444), 782 states have call predecessors, (1444), 782 states have return successors, (1444), 1389 states have call predecessors, (1444), 1444 states have call successors, (1444) [2024-10-12 19:58:42,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8236 states to 8236 states and 10735 transitions. [2024-10-12 19:58:42,566 INFO L78 Accepts]: Start accepts. Automaton has 8236 states and 10735 transitions. Word has length 141 [2024-10-12 19:58:42,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:42,567 INFO L471 AbstractCegarLoop]: Abstraction has 8236 states and 10735 transitions. [2024-10-12 19:58:42,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-12 19:58:42,567 INFO L276 IsEmpty]: Start isEmpty. Operand 8236 states and 10735 transitions. [2024-10-12 19:58:42,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-12 19:58:42,577 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:42,577 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:58:42,591 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-12 19:58:42,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-10-12 19:58:42,778 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:42,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:42,778 INFO L85 PathProgramCache]: Analyzing trace with hash -226652460, now seen corresponding path program 1 times [2024-10-12 19:58:42,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:42,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636849868] [2024-10-12 19:58:42,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:42,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:42,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:43,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:43,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:43,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 19:58:43,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:43,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 19:58:43,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:43,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-12 19:58:43,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:43,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-12 19:58:43,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:43,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-12 19:58:43,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:43,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 19:58:43,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:43,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-12 19:58:43,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:43,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-12 19:58:43,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:43,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-12 19:58:43,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:43,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-12 19:58:43,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:43,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-12 19:58:43,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:43,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-12 19:58:43,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:43,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-12 19:58:43,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:43,766 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 20 proven. 3 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-12 19:58:43,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:43,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636849868] [2024-10-12 19:58:43,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636849868] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:58:43,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895845428] [2024-10-12 19:58:43,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:43,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:58:43,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:58:43,771 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 19:58:43,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-12 19:58:43,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:43,922 INFO L255 TraceCheckSpWp]: Trace formula consists of 670 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-12 19:58:43,925 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:58:44,219 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 17 proven. 53 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-12 19:58:44,220 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:58:44,586 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-12 19:58:44,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1895845428] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 19:58:44,586 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 19:58:44,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 9] total 26 [2024-10-12 19:58:44,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748076907] [2024-10-12 19:58:44,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 19:58:44,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-12 19:58:44,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:44,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-12 19:58:44,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=580, Unknown=0, NotChecked=0, Total=650 [2024-10-12 19:58:44,590 INFO L87 Difference]: Start difference. First operand 8236 states and 10735 transitions. Second operand has 26 states, 26 states have (on average 9.423076923076923) internal successors, (245), 24 states have internal predecessors, (245), 10 states have call successors, (41), 5 states have call predecessors, (41), 8 states have return successors, (40), 12 states have call predecessors, (40), 10 states have call successors, (40) [2024-10-12 19:58:49,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:49,759 INFO L93 Difference]: Finished difference Result 19311 states and 25190 transitions. [2024-10-12 19:58:49,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-10-12 19:58:49,760 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 9.423076923076923) internal successors, (245), 24 states have internal predecessors, (245), 10 states have call successors, (41), 5 states have call predecessors, (41), 8 states have return successors, (40), 12 states have call predecessors, (40), 10 states have call successors, (40) Word has length 142 [2024-10-12 19:58:49,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:49,798 INFO L225 Difference]: With dead ends: 19311 [2024-10-12 19:58:49,799 INFO L226 Difference]: Without dead ends: 11279 [2024-10-12 19:58:49,812 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1466 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1059, Invalid=5103, Unknown=0, NotChecked=0, Total=6162 [2024-10-12 19:58:49,813 INFO L432 NwaCegarLoop]: 711 mSDtfsCounter, 1966 mSDsluCounter, 7594 mSDsCounter, 0 mSdLazyCounter, 4359 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1966 SdHoareTripleChecker+Valid, 8305 SdHoareTripleChecker+Invalid, 5019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 4359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-12 19:58:49,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1966 Valid, 8305 Invalid, 5019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 4359 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-12 19:58:49,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11279 states. [2024-10-12 19:58:50,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11279 to 7560. [2024-10-12 19:58:50,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7560 states, 5533 states have (on average 1.2973070666907645) internal successors, (7178), 5583 states have internal predecessors, (7178), 1315 states have call successors, (1315), 711 states have call predecessors, (1315), 711 states have return successors, (1315), 1265 states have call predecessors, (1315), 1315 states have call successors, (1315) [2024-10-12 19:58:50,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7560 states to 7560 states and 9808 transitions. [2024-10-12 19:58:50,482 INFO L78 Accepts]: Start accepts. Automaton has 7560 states and 9808 transitions. Word has length 142 [2024-10-12 19:58:50,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:50,482 INFO L471 AbstractCegarLoop]: Abstraction has 7560 states and 9808 transitions. [2024-10-12 19:58:50,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 9.423076923076923) internal successors, (245), 24 states have internal predecessors, (245), 10 states have call successors, (41), 5 states have call predecessors, (41), 8 states have return successors, (40), 12 states have call predecessors, (40), 10 states have call successors, (40) [2024-10-12 19:58:50,483 INFO L276 IsEmpty]: Start isEmpty. Operand 7560 states and 9808 transitions. [2024-10-12 19:58:50,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-12 19:58:50,490 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:50,491 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:58:50,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-12 19:58:50,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:58:50,692 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:50,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:50,692 INFO L85 PathProgramCache]: Analyzing trace with hash 851355554, now seen corresponding path program 1 times [2024-10-12 19:58:50,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:50,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144112694] [2024-10-12 19:58:50,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:50,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:50,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:51,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:51,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:51,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-12 19:58:51,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:51,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-12 19:58:51,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:51,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 19:58:51,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:51,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 19:58:51,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:51,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 19:58:51,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:51,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 19:58:51,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:51,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-12 19:58:51,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:51,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-12 19:58:51,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:51,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-12 19:58:51,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:51,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-12 19:58:51,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:51,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-12 19:58:51,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:51,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-12 19:58:51,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:51,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-12 19:58:51,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:51,398 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-12 19:58:51,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:51,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144112694] [2024-10-12 19:58:51,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144112694] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:58:51,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1584171415] [2024-10-12 19:58:51,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:51,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:58:51,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:58:51,401 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 19:58:51,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-12 19:58:51,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:51,551 INFO L255 TraceCheckSpWp]: Trace formula consists of 655 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-12 19:58:51,554 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:58:51,643 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 41 proven. 4 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-12 19:58:51,644 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:58:51,731 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-10-12 19:58:51,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1584171415] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 19:58:51,732 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 19:58:51,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 15 [2024-10-12 19:58:51,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436322578] [2024-10-12 19:58:51,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 19:58:51,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-12 19:58:51,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:51,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-12 19:58:51,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-10-12 19:58:51,733 INFO L87 Difference]: Start difference. First operand 7560 states and 9808 transitions. Second operand has 15 states, 15 states have (on average 11.066666666666666) internal successors, (166), 14 states have internal predecessors, (166), 6 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 7 states have call predecessors, (34), 6 states have call successors, (34) [2024-10-12 19:58:53,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:53,888 INFO L93 Difference]: Finished difference Result 16224 states and 21027 transitions. [2024-10-12 19:58:53,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-12 19:58:53,889 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 11.066666666666666) internal successors, (166), 14 states have internal predecessors, (166), 6 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 7 states have call predecessors, (34), 6 states have call successors, (34) Word has length 143 [2024-10-12 19:58:53,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:53,926 INFO L225 Difference]: With dead ends: 16224 [2024-10-12 19:58:53,926 INFO L226 Difference]: Without dead ends: 8862 [2024-10-12 19:58:53,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=277, Invalid=1529, Unknown=0, NotChecked=0, Total=1806 [2024-10-12 19:58:53,940 INFO L432 NwaCegarLoop]: 402 mSDtfsCounter, 1085 mSDsluCounter, 3129 mSDsCounter, 0 mSdLazyCounter, 990 mSolverCounterSat, 387 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1085 SdHoareTripleChecker+Valid, 3531 SdHoareTripleChecker+Invalid, 1377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 387 IncrementalHoareTripleChecker+Valid, 990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 19:58:53,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1085 Valid, 3531 Invalid, 1377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [387 Valid, 990 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 19:58:53,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8862 states. [2024-10-12 19:58:54,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8862 to 8579. [2024-10-12 19:58:54,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8579 states, 6270 states have (on average 1.2955342902711324) internal successors, (8123), 6328 states have internal predecessors, (8123), 1494 states have call successors, (1494), 814 states have call predecessors, (1494), 814 states have return successors, (1494), 1436 states have call predecessors, (1494), 1494 states have call successors, (1494) [2024-10-12 19:58:54,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8579 states to 8579 states and 11111 transitions. [2024-10-12 19:58:54,864 INFO L78 Accepts]: Start accepts. Automaton has 8579 states and 11111 transitions. Word has length 143 [2024-10-12 19:58:54,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:54,864 INFO L471 AbstractCegarLoop]: Abstraction has 8579 states and 11111 transitions. [2024-10-12 19:58:54,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 11.066666666666666) internal successors, (166), 14 states have internal predecessors, (166), 6 states have call successors, (34), 4 states have call predecessors, (34), 6 states have return successors, (34), 7 states have call predecessors, (34), 6 states have call successors, (34) [2024-10-12 19:58:54,865 INFO L276 IsEmpty]: Start isEmpty. Operand 8579 states and 11111 transitions. [2024-10-12 19:58:54,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-12 19:58:54,880 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:54,880 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:58:54,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-12 19:58:55,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:58:55,081 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:55,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:55,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1529891451, now seen corresponding path program 1 times [2024-10-12 19:58:55,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:55,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61667914] [2024-10-12 19:58:55,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:55,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:55,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:55,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:55,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:55,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 19:58:55,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:55,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 19:58:55,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:55,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 19:58:55,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:55,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-12 19:58:55,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:55,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 19:58:55,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:55,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-12 19:58:55,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:55,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-12 19:58:55,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:55,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 19:58:55,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:55,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-12 19:58:55,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:55,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-12 19:58:55,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:55,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-12 19:58:55,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:55,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-12 19:58:55,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:55,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-12 19:58:55,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:55,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-12 19:58:55,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:55,283 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 14 proven. 25 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2024-10-12 19:58:55,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:55,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61667914] [2024-10-12 19:58:55,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61667914] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:58:55,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297398956] [2024-10-12 19:58:55,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:55,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:58:55,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:58:55,288 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 19:58:55,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-12 19:58:55,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:55,437 INFO L255 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-12 19:58:55,440 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:58:55,579 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 8 proven. 94 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-12 19:58:55,580 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:58:55,711 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 14 proven. 25 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2024-10-12 19:58:55,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [297398956] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 19:58:55,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 19:58:55,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 10 [2024-10-12 19:58:55,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085506630] [2024-10-12 19:58:55,712 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 19:58:55,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 19:58:55,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:55,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 19:58:55,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:58:55,713 INFO L87 Difference]: Start difference. First operand 8579 states and 11111 transitions. Second operand has 10 states, 10 states have (on average 13.1) internal successors, (131), 9 states have internal predecessors, (131), 4 states have call successors, (32), 5 states have call predecessors, (32), 7 states have return successors, (31), 4 states have call predecessors, (31), 3 states have call successors, (31) [2024-10-12 19:58:57,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:57,346 INFO L93 Difference]: Finished difference Result 23011 states and 29506 transitions. [2024-10-12 19:58:57,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-12 19:58:57,347 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.1) internal successors, (131), 9 states have internal predecessors, (131), 4 states have call successors, (32), 5 states have call predecessors, (32), 7 states have return successors, (31), 4 states have call predecessors, (31), 3 states have call successors, (31) Word has length 153 [2024-10-12 19:58:57,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:57,400 INFO L225 Difference]: With dead ends: 23011 [2024-10-12 19:58:57,400 INFO L226 Difference]: Without dead ends: 14793 [2024-10-12 19:58:57,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 332 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2024-10-12 19:58:57,416 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 335 mSDsluCounter, 1375 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 1617 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:58:57,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 1617 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:58:57,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14793 states. [2024-10-12 19:58:58,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14793 to 12861. [2024-10-12 19:58:58,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12861 states, 9430 states have (on average 1.277730646871686) internal successors, (12049), 9540 states have internal predecessors, (12049), 2192 states have call successors, (2192), 1238 states have call predecessors, (2192), 1238 states have return successors, (2192), 2082 states have call predecessors, (2192), 2192 states have call successors, (2192) [2024-10-12 19:58:58,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12861 states to 12861 states and 16433 transitions. [2024-10-12 19:58:58,838 INFO L78 Accepts]: Start accepts. Automaton has 12861 states and 16433 transitions. Word has length 153 [2024-10-12 19:58:58,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:58,838 INFO L471 AbstractCegarLoop]: Abstraction has 12861 states and 16433 transitions. [2024-10-12 19:58:58,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.1) internal successors, (131), 9 states have internal predecessors, (131), 4 states have call successors, (32), 5 states have call predecessors, (32), 7 states have return successors, (31), 4 states have call predecessors, (31), 3 states have call successors, (31) [2024-10-12 19:58:58,838 INFO L276 IsEmpty]: Start isEmpty. Operand 12861 states and 16433 transitions. [2024-10-12 19:58:58,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-12 19:58:58,850 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:58,850 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:58:58,864 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-12 19:58:59,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:58:59,051 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:59,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:59,051 INFO L85 PathProgramCache]: Analyzing trace with hash -436147346, now seen corresponding path program 1 times [2024-10-12 19:58:59,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:59,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925742895] [2024-10-12 19:58:59,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:59,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:59,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:59,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:59,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:59,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-12 19:58:59,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:59,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-12 19:58:59,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:59,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 19:58:59,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:59,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 19:58:59,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:59,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 19:58:59,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:59,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 19:58:59,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:59,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-12 19:58:59,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:59,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-12 19:58:59,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:59,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-12 19:58:59,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:59,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-12 19:58:59,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:59,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-12 19:58:59,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:59,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-12 19:58:59,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:59,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-12 19:58:59,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:59,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-12 19:58:59,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:59,487 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 21 proven. 5 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-10-12 19:58:59,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:59,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925742895] [2024-10-12 19:58:59,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925742895] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:58:59,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1423285778] [2024-10-12 19:58:59,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:59,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:58:59,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:58:59,492 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 19:58:59,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-12 19:58:59,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:59,646 INFO L255 TraceCheckSpWp]: Trace formula consists of 674 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-10-12 19:58:59,649 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:59:00,135 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 65 proven. 13 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-12 19:59:00,136 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:59:00,924 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 14 proven. 12 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-10-12 19:59:00,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1423285778] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 19:59:00,924 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 19:59:00,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 12] total 28 [2024-10-12 19:59:00,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838606613] [2024-10-12 19:59:00,925 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 19:59:00,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-12 19:59:00,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:59:00,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-12 19:59:00,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=656, Unknown=0, NotChecked=0, Total=756 [2024-10-12 19:59:00,926 INFO L87 Difference]: Start difference. First operand 12861 states and 16433 transitions. Second operand has 28 states, 28 states have (on average 7.785714285714286) internal successors, (218), 28 states have internal predecessors, (218), 10 states have call successors, (41), 5 states have call predecessors, (41), 6 states have return successors, (40), 10 states have call predecessors, (40), 10 states have call successors, (40) [2024-10-12 19:59:06,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:59:06,292 INFO L93 Difference]: Finished difference Result 24618 states and 31574 transitions. [2024-10-12 19:59:06,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-10-12 19:59:06,293 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 7.785714285714286) internal successors, (218), 28 states have internal predecessors, (218), 10 states have call successors, (41), 5 states have call predecessors, (41), 6 states have return successors, (40), 10 states have call predecessors, (40), 10 states have call successors, (40) Word has length 152 [2024-10-12 19:59:06,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:59:06,351 INFO L225 Difference]: With dead ends: 24618 [2024-10-12 19:59:06,352 INFO L226 Difference]: Without dead ends: 13649 [2024-10-12 19:59:06,371 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1098 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=629, Invalid=4063, Unknown=0, NotChecked=0, Total=4692 [2024-10-12 19:59:06,372 INFO L432 NwaCegarLoop]: 446 mSDtfsCounter, 1380 mSDsluCounter, 5525 mSDsCounter, 0 mSdLazyCounter, 3233 mSolverCounterSat, 487 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1380 SdHoareTripleChecker+Valid, 5971 SdHoareTripleChecker+Invalid, 3720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 487 IncrementalHoareTripleChecker+Valid, 3233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-12 19:59:06,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1380 Valid, 5971 Invalid, 3720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [487 Valid, 3233 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-12 19:59:06,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13649 states. [2024-10-12 19:59:08,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13649 to 13319. [2024-10-12 19:59:08,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13319 states, 9808 states have (on average 1.2789559543230016) internal successors, (12544), 9918 states have internal predecessors, (12544), 2233 states have call successors, (2233), 1277 states have call predecessors, (2233), 1277 states have return successors, (2233), 2123 states have call predecessors, (2233), 2233 states have call successors, (2233) [2024-10-12 19:59:08,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13319 states to 13319 states and 17010 transitions. [2024-10-12 19:59:08,183 INFO L78 Accepts]: Start accepts. Automaton has 13319 states and 17010 transitions. Word has length 152 [2024-10-12 19:59:08,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:59:08,183 INFO L471 AbstractCegarLoop]: Abstraction has 13319 states and 17010 transitions. [2024-10-12 19:59:08,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 7.785714285714286) internal successors, (218), 28 states have internal predecessors, (218), 10 states have call successors, (41), 5 states have call predecessors, (41), 6 states have return successors, (40), 10 states have call predecessors, (40), 10 states have call successors, (40) [2024-10-12 19:59:08,184 INFO L276 IsEmpty]: Start isEmpty. Operand 13319 states and 17010 transitions. [2024-10-12 19:59:08,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-12 19:59:08,191 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:59:08,192 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:59:08,206 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-12 19:59:08,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:59:08,396 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:59:08,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:59:08,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1594842057, now seen corresponding path program 1 times [2024-10-12 19:59:08,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:59:08,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310677841] [2024-10-12 19:59:08,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:59:08,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:59:08,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:08,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:59:08,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:08,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-12 19:59:08,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:08,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-12 19:59:08,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:08,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 19:59:08,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:08,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 19:59:08,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:08,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 19:59:08,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:08,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 19:59:08,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:09,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-12 19:59:09,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:09,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-12 19:59:09,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:09,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-12 19:59:09,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:09,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-12 19:59:09,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:09,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 19:59:09,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:09,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 19:59:09,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:09,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-12 19:59:09,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:09,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-12 19:59:09,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:09,032 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 25 proven. 6 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-10-12 19:59:09,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:59:09,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310677841] [2024-10-12 19:59:09,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310677841] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:59:09,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434234639] [2024-10-12 19:59:09,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:59:09,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:59:09,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:59:09,036 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 19:59:09,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-12 19:59:09,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:09,191 INFO L255 TraceCheckSpWp]: Trace formula consists of 675 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-12 19:59:09,193 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:59:09,347 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 71 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-12 19:59:09,347 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:59:09,554 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 25 proven. 6 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-10-12 19:59:09,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434234639] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 19:59:09,554 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 19:59:09,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 10] total 23 [2024-10-12 19:59:09,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187992188] [2024-10-12 19:59:09,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 19:59:09,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-12 19:59:09,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:59:09,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-12 19:59:09,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2024-10-12 19:59:09,556 INFO L87 Difference]: Start difference. First operand 13319 states and 17010 transitions. Second operand has 23 states, 23 states have (on average 6.869565217391305) internal successors, (158), 18 states have internal predecessors, (158), 4 states have call successors, (25), 4 states have call predecessors, (25), 9 states have return successors, (28), 8 states have call predecessors, (28), 4 states have call successors, (28) [2024-10-12 19:59:13,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:59:13,274 INFO L93 Difference]: Finished difference Result 32772 states and 41508 transitions. [2024-10-12 19:59:13,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-10-12 19:59:13,275 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 6.869565217391305) internal successors, (158), 18 states have internal predecessors, (158), 4 states have call successors, (25), 4 states have call predecessors, (25), 9 states have return successors, (28), 8 states have call predecessors, (28), 4 states have call successors, (28) Word has length 153 [2024-10-12 19:59:13,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:59:13,350 INFO L225 Difference]: With dead ends: 32772 [2024-10-12 19:59:13,350 INFO L226 Difference]: Without dead ends: 19715 [2024-10-12 19:59:13,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 482 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=333, Invalid=2019, Unknown=0, NotChecked=0, Total=2352 [2024-10-12 19:59:13,372 INFO L432 NwaCegarLoop]: 286 mSDtfsCounter, 1127 mSDsluCounter, 2712 mSDsCounter, 0 mSdLazyCounter, 1056 mSolverCounterSat, 430 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1130 SdHoareTripleChecker+Valid, 2998 SdHoareTripleChecker+Invalid, 1486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 430 IncrementalHoareTripleChecker+Valid, 1056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 19:59:13,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1130 Valid, 2998 Invalid, 1486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [430 Valid, 1056 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 19:59:13,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19715 states. [2024-10-12 19:59:15,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19715 to 12951. [2024-10-12 19:59:15,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12951 states, 9563 states have (on average 1.266548154344871) internal successors, (12112), 9673 states have internal predecessors, (12112), 2107 states have call successors, (2107), 1280 states have call predecessors, (2107), 1280 states have return successors, (2107), 1997 states have call predecessors, (2107), 2107 states have call successors, (2107) [2024-10-12 19:59:15,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12951 states to 12951 states and 16326 transitions. [2024-10-12 19:59:15,333 INFO L78 Accepts]: Start accepts. Automaton has 12951 states and 16326 transitions. Word has length 153 [2024-10-12 19:59:15,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:59:15,333 INFO L471 AbstractCegarLoop]: Abstraction has 12951 states and 16326 transitions. [2024-10-12 19:59:15,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 6.869565217391305) internal successors, (158), 18 states have internal predecessors, (158), 4 states have call successors, (25), 4 states have call predecessors, (25), 9 states have return successors, (28), 8 states have call predecessors, (28), 4 states have call successors, (28) [2024-10-12 19:59:15,334 INFO L276 IsEmpty]: Start isEmpty. Operand 12951 states and 16326 transitions. [2024-10-12 19:59:15,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-12 19:59:15,342 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:59:15,343 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:59:15,358 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-12 19:59:15,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:59:15,548 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:59:15,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:59:15,548 INFO L85 PathProgramCache]: Analyzing trace with hash 2095630439, now seen corresponding path program 1 times [2024-10-12 19:59:15,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:59:15,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209342647] [2024-10-12 19:59:15,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:59:15,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:59:15,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:16,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:59:16,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:16,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-12 19:59:16,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:16,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-12 19:59:16,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:16,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 19:59:16,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:16,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 19:59:16,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:16,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 19:59:16,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:16,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 19:59:16,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:16,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-12 19:59:16,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:16,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 19:59:16,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:16,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-12 19:59:16,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:16,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-12 19:59:16,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:16,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-12 19:59:16,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:16,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 19:59:16,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:16,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-12 19:59:16,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:16,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-12 19:59:16,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:16,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-12 19:59:16,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:16,110 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 21 proven. 10 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-10-12 19:59:16,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:59:16,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209342647] [2024-10-12 19:59:16,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209342647] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:59:16,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195257572] [2024-10-12 19:59:16,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:59:16,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:59:16,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:59:16,115 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 19:59:16,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-12 19:59:16,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:16,278 INFO L255 TraceCheckSpWp]: Trace formula consists of 694 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-12 19:59:16,281 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:59:16,423 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 69 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-12 19:59:16,424 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:59:16,622 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 23 proven. 8 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-10-12 19:59:16,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1195257572] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 19:59:16,622 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 19:59:16,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 10] total 23 [2024-10-12 19:59:16,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409782398] [2024-10-12 19:59:16,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 19:59:16,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-12 19:59:16,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:59:16,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-12 19:59:16,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2024-10-12 19:59:16,624 INFO L87 Difference]: Start difference. First operand 12951 states and 16326 transitions. Second operand has 23 states, 23 states have (on average 7.130434782608695) internal successors, (164), 18 states have internal predecessors, (164), 4 states have call successors, (29), 4 states have call predecessors, (29), 10 states have return successors, (32), 9 states have call predecessors, (32), 4 states have call successors, (32) [2024-10-12 19:59:21,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:59:21,467 INFO L93 Difference]: Finished difference Result 34019 states and 44076 transitions. [2024-10-12 19:59:21,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-10-12 19:59:21,468 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 7.130434782608695) internal successors, (164), 18 states have internal predecessors, (164), 4 states have call successors, (29), 4 states have call predecessors, (29), 10 states have return successors, (32), 9 states have call predecessors, (32), 4 states have call successors, (32) Word has length 161 [2024-10-12 19:59:21,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:59:21,557 INFO L225 Difference]: With dead ends: 34019 [2024-10-12 19:59:21,557 INFO L226 Difference]: Without dead ends: 21079 [2024-10-12 19:59:21,586 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 351 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 599 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=393, Invalid=2469, Unknown=0, NotChecked=0, Total=2862 [2024-10-12 19:59:21,587 INFO L432 NwaCegarLoop]: 452 mSDtfsCounter, 1298 mSDsluCounter, 5230 mSDsCounter, 0 mSdLazyCounter, 1719 mSolverCounterSat, 499 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1303 SdHoareTripleChecker+Valid, 5682 SdHoareTripleChecker+Invalid, 2218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 499 IncrementalHoareTripleChecker+Valid, 1719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:59:21,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1303 Valid, 5682 Invalid, 2218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [499 Valid, 1719 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 19:59:21,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21079 states. [2024-10-12 19:59:24,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21079 to 15123. [2024-10-12 19:59:24,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15123 states, 11123 states have (on average 1.261080643711229) internal successors, (14027), 11257 states have internal predecessors, (14027), 2495 states have call successors, (2495), 1504 states have call predecessors, (2495), 1504 states have return successors, (2495), 2361 states have call predecessors, (2495), 2495 states have call successors, (2495) [2024-10-12 19:59:24,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15123 states to 15123 states and 19017 transitions. [2024-10-12 19:59:24,100 INFO L78 Accepts]: Start accepts. Automaton has 15123 states and 19017 transitions. Word has length 161 [2024-10-12 19:59:24,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:59:24,100 INFO L471 AbstractCegarLoop]: Abstraction has 15123 states and 19017 transitions. [2024-10-12 19:59:24,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 7.130434782608695) internal successors, (164), 18 states have internal predecessors, (164), 4 states have call successors, (29), 4 states have call predecessors, (29), 10 states have return successors, (32), 9 states have call predecessors, (32), 4 states have call successors, (32) [2024-10-12 19:59:24,100 INFO L276 IsEmpty]: Start isEmpty. Operand 15123 states and 19017 transitions. [2024-10-12 19:59:24,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-12 19:59:24,108 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:59:24,109 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:59:24,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-12 19:59:24,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2024-10-12 19:59:24,314 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:59:24,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:59:24,314 INFO L85 PathProgramCache]: Analyzing trace with hash 2067437013, now seen corresponding path program 1 times [2024-10-12 19:59:24,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:59:24,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973138483] [2024-10-12 19:59:24,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:59:24,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:59:24,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 19:59:24,380 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 19:59:24,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 19:59:24,493 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 19:59:24,494 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-12 19:59:24,495 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 19:59:24,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-10-12 19:59:24,499 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:59:24,638 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 19:59:24,643 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 07:59:24 BoogieIcfgContainer [2024-10-12 19:59:24,643 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 19:59:24,644 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 19:59:24,644 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 19:59:24,644 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 19:59:24,644 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:58:16" (3/4) ... [2024-10-12 19:59:24,645 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-12 19:59:24,774 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 19:59:24,775 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 19:59:24,775 INFO L158 Benchmark]: Toolchain (without parser) took 69267.40ms. Allocated memory was 174.1MB in the beginning and 3.7GB in the end (delta: 3.5GB). Free memory was 103.0MB in the beginning and 2.8GB in the end (delta: -2.7GB). Peak memory consumption was 793.9MB. Max. memory is 16.1GB. [2024-10-12 19:59:24,777 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 174.1MB. Free memory is still 130.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 19:59:24,777 INFO L158 Benchmark]: CACSL2BoogieTranslator took 397.34ms. Allocated memory is still 174.1MB. Free memory was 102.8MB in the beginning and 138.3MB in the end (delta: -35.5MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. [2024-10-12 19:59:24,778 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.46ms. Allocated memory is still 174.1MB. Free memory was 138.3MB in the beginning and 134.8MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-12 19:59:24,778 INFO L158 Benchmark]: Boogie Preprocessor took 52.90ms. Allocated memory is still 174.1MB. Free memory was 134.8MB in the beginning and 129.9MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-12 19:59:24,778 INFO L158 Benchmark]: RCFGBuilder took 680.34ms. Allocated memory is still 174.1MB. Free memory was 129.9MB in the beginning and 80.2MB in the end (delta: 49.7MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2024-10-12 19:59:24,778 INFO L158 Benchmark]: TraceAbstraction took 67940.09ms. Allocated memory was 174.1MB in the beginning and 3.7GB in the end (delta: 3.5GB). Free memory was 79.6MB in the beginning and 2.9GB in the end (delta: -2.8GB). Peak memory consumption was 737.0MB. Max. memory is 16.1GB. [2024-10-12 19:59:24,778 INFO L158 Benchmark]: Witness Printer took 131.12ms. Allocated memory is still 3.7GB. Free memory was 2.9GB in the beginning and 2.8GB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-10-12 19:59:24,778 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.14ms. Allocated memory is still 174.1MB. Free memory is still 130.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 397.34ms. Allocated memory is still 174.1MB. Free memory was 102.8MB in the beginning and 138.3MB in the end (delta: -35.5MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.46ms. Allocated memory is still 174.1MB. Free memory was 138.3MB in the beginning and 134.8MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.90ms. Allocated memory is still 174.1MB. Free memory was 134.8MB in the beginning and 129.9MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 680.34ms. Allocated memory is still 174.1MB. Free memory was 129.9MB in the beginning and 80.2MB in the end (delta: 49.7MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 67940.09ms. Allocated memory was 174.1MB in the beginning and 3.7GB in the end (delta: 3.5GB). Free memory was 79.6MB in the beginning and 2.9GB in the end (delta: -2.8GB). Peak memory consumption was 737.0MB. Max. memory is 16.1GB. * Witness Printer took 131.12ms. Allocated memory is still 3.7GB. Free memory was 2.9GB in the beginning and 2.8GB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. 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: 610]: 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 ; [L534] int c1 ; [L535] int i2 ; [L538] c1 = 0 [L539] side1Failed = __VERIFIER_nondet_bool() [L540] side2Failed = __VERIFIER_nondet_bool() [L541] side1_written = __VERIFIER_nondet_char() [L542] side2_written = __VERIFIER_nondet_char() [L543] side1Failed_History_0 = __VERIFIER_nondet_bool() [L544] side1Failed_History_1 = __VERIFIER_nondet_bool() [L545] side1Failed_History_2 = __VERIFIER_nondet_bool() [L546] side2Failed_History_0 = __VERIFIER_nondet_bool() [L547] side2Failed_History_1 = __VERIFIER_nondet_bool() [L548] side2Failed_History_2 = __VERIFIER_nondet_bool() [L549] active_side_History_0 = __VERIFIER_nondet_char() [L550] active_side_History_1 = __VERIFIER_nondet_char() [L551] active_side_History_2 = __VERIFIER_nondet_char() [L552] manual_selection_History_0 = __VERIFIER_nondet_char() [L553] manual_selection_History_1 = __VERIFIER_nondet_char() [L554] manual_selection_History_2 = __VERIFIER_nondet_char() [L555] 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, 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=1, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L555] RET, EXPR init() [L555] i2 = init() [L556] 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=1, 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=1, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L556] 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=1, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L557] cs1_old = nomsg [L558] cs1_new = nomsg [L559] cs2_old = nomsg [L560] cs2_new = nomsg [L561] s1s2_old = nomsg [L562] s1s2_new = nomsg [L563] s1s1_old = nomsg [L564] s1s1_new = nomsg [L565] s2s1_old = nomsg [L566] s2s1_new = nomsg [L567] s2s2_old = nomsg [L568] s2s2_new = nomsg [L569] s1p_old = nomsg [L570] s1p_new = nomsg [L571] s2p_old = nomsg [L572] s2p_new = nomsg [L573] 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=1, 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=1, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L574] COND TRUE 1 [L576] 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 [L576] RET Console_task_each_pals_period() [L577] 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 TRUE \read(side1Failed) [L278] s1s1_new = nomsg != nomsg && s1s1_new == nomsg ? nomsg : s1s1_new [L279] s1s2_new = nomsg != nomsg && s1s2_new == nomsg ? nomsg : s1s2_new [L280] s1p_new = nomsg != nomsg && s1p_new == nomsg ? nomsg : s1p_new [L281] side1_written = 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=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=-1, side2Failed=1, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L577] RET Side1_activestandby_task_each_pals_period() [L578] 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=1, side1Failed_History_0=1, 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 )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=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, next_state=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=1, 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=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1Failed=1, side1Failed_History_0=1, 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] [L578] RET Side2_activestandby_task_each_pals_period() [L579] 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=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1Failed=1, side1Failed_History_0=1, 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] [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=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1Failed=1, side1Failed_History_0=1, 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] [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=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1Failed=1, side1Failed_History_0=1, 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] [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=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1Failed=1, side1Failed_History_0=1, 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] [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=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1Failed=1, side1Failed_History_0=1, 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] [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=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1Failed=1, side1Failed_History_0=1, 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] [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=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1Failed=1, side1Failed_History_0=1, 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] [L400] COND FALSE !((int )side1 == 0) [L407] 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=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1Failed=1, side1Failed_History_0=1, 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] [L409] 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 [L409] RET write_active_side_history(active_side) [L579] RET Pendulum_prism_task_each_pals_period() [L580] cs1_old = cs1_new [L581] cs1_new = nomsg [L582] cs2_old = cs2_new [L583] cs2_new = nomsg [L584] s1s2_old = s1s2_new [L585] s1s2_new = nomsg [L586] s1s1_old = s1s1_new [L587] s1s1_new = nomsg [L588] s2s1_old = s2s1_new [L589] s2s1_new = nomsg [L590] s2s2_old = s2s2_new [L591] s2s2_new = nomsg [L592] s1p_old = s1p_new [L593] s1p_new = nomsg [L594] s2p_old = s2p_new [L595] s2p_new = nomsg [L596] CALL, EXPR check() [L415] int tmp ; [L416] msg_t tmp___0 ; [L417] _Bool tmp___1 ; [L418] _Bool tmp___2 ; [L419] _Bool tmp___3 ; [L420] _Bool tmp___4 ; [L421] int8_t tmp___5 ; [L422] _Bool tmp___6 ; [L423] _Bool tmp___7 ; [L424] _Bool tmp___8 ; [L425] int8_t tmp___9 ; [L426] _Bool tmp___10 ; [L427] _Bool tmp___11 ; [L428] _Bool tmp___12 ; [L429] msg_t tmp___13 ; [L430] _Bool tmp___14 ; [L431] _Bool tmp___15 ; [L432] _Bool tmp___16 ; [L433] _Bool tmp___17 ; [L434] int8_t tmp___18 ; [L435] int8_t tmp___19 ; [L436] 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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] [L439] COND FALSE !(! side1Failed) 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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] [L442] COND TRUE ! side2Failed [L443] 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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, tmp=1] [L447] 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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] [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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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] [L447] 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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, tmp=1] [L448] 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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] [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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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] [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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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] [L448] 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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, tmp=1] [L448] tmp___0 = read_manual_selection_history((unsigned char)1) [L449] 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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, tmp=1] [L450] 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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] [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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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] [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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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] [L450] 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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, tmp=1] [L450] tmp___1 = read_side1_failed_history((unsigned char)1) [L451] 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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, tmp=1] [L452] 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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] [L88] COND TRUE (int )index == 0 [L89] return (side1Failed_History_0); VAL [\old(index)=0, \result=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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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] [L452] 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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, tmp=1] [L452] tmp___2 = read_side1_failed_history((unsigned char)0) [L453] COND FALSE !(! 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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, tmp=1] [L478] 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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] [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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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] [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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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] [L478] 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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, tmp=1] [L478] tmp___7 = read_side1_failed_history((unsigned char)1) [L479] COND FALSE !(\read(tmp___7)) 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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, tmp=1] [L494] 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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] [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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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] [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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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] [L494] 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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, tmp=1] [L494] tmp___11 = read_side1_failed_history((unsigned char)1) [L495] COND TRUE ! tmp___11 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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, tmp=1] [L496] 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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] [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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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] [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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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] [L496] 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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, tmp=1] [L496] tmp___12 = read_side2_failed_history((unsigned char)1) [L497] COND FALSE !(\read(tmp___12)) 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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, tmp=1] [L510] CALL, EXPR read_active_side_history((unsigned char)2) VAL [\old(index)=2, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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] [L148] COND FALSE !((int )index == 0) VAL [\old(index)=2, 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=2, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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] [L151] COND FALSE !((int )index == 1) VAL [\old(index)=2, 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=2, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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] [L154] COND TRUE (int )index == 2 [L155] return (active_side_History_2); VAL [\old(index)=2, \result=-2, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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] [L510] RET, EXPR read_active_side_history((unsigned char)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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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, tmp=1] [L510] tmp___20 = read_active_side_history((unsigned char)2) [L511] COND FALSE !((int )tmp___20 > -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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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, tmp=1] [L529] return (1); VAL [\result=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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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, tmp=1] [L596] RET, EXPR check() [L596] c1 = check() [L597] CALL assert(c1) VAL [\old(arg)=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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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] [L608] COND FALSE !(! arg) VAL [\old(arg)=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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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] [L597] RET assert(c1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, c1=1, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, i2=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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=1, side1Failed_History_0=1, 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] [L574] COND TRUE 1 [L576] 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 [L576] RET Console_task_each_pals_period() [L577] 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=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=-1, manual_selection_History_0=-1, manual_selection_History_1=-1, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L290] COND FALSE !((int )side1 == (int )side2) 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=-1, manual_selection_History_0=-1, manual_selection_History_1=-1, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L293] COND TRUE (int )side1 == (int )nomsg 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=-1, manual_selection_History_0=-1, manual_selection_History_1=-1, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, side2=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L294] COND TRUE (int )side2 != (int )nomsg [L295] next_state = (int8_t )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=-1, manual_selection_History_0=-1, manual_selection_History_1=-1, manual_selection_History_2=0, next_state=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=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=-1, 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=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=-1, manual_selection_History_0=-1, manual_selection_History_1=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0] [L577] RET Side1_activestandby_task_each_pals_period() [L578] 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 TRUE \read(side2Failed) [L335] s2s1_new = nomsg != nomsg && s2s1_new == nomsg ? nomsg : s2s1_new [L336] s2s2_new = nomsg != nomsg && s2s2_new == nomsg ? nomsg : s2s2_new [L337] s2p_new = nomsg != nomsg && s2p_new == nomsg ? nomsg : s2p_new [L338] side2_written = nomsg 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=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1] [L578] RET Side2_activestandby_task_each_pals_period() [L579] 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=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=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, 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=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=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, 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=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=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, 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=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=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, 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=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=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, 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=0, side1=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=0, side2=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1] [L394] COND FALSE !((int )side1 == 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=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, 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=0, side1=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=0, side2=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1] [L397] COND FALSE !((int )side2 == 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=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, 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=0, side1=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=0, side2=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1] [L400] COND FALSE !((int )side1 == 0) [L407] active_side = (int8_t )0 VAL [active_side=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=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, 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=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side1_written=0, side2=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1] [L409] 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 [L409] RET write_active_side_history(active_side) [L579] RET Pendulum_prism_task_each_pals_period() [L580] cs1_old = cs1_new [L581] cs1_new = nomsg [L582] cs2_old = cs2_new [L583] cs2_new = nomsg [L584] s1s2_old = s1s2_new [L585] s1s2_new = nomsg [L586] s1s1_old = s1s1_new [L587] s1s1_new = nomsg [L588] s2s1_old = s2s1_new [L589] s2s1_new = nomsg [L590] s2s2_old = s2s2_new [L591] s2s2_new = nomsg [L592] s1p_old = s1p_new [L593] s1p_new = nomsg [L594] s2p_old = s2p_new [L595] s2p_new = nomsg [L596] CALL, EXPR check() [L415] int tmp ; [L416] msg_t tmp___0 ; [L417] _Bool tmp___1 ; [L418] _Bool tmp___2 ; [L419] _Bool tmp___3 ; [L420] _Bool tmp___4 ; [L421] int8_t tmp___5 ; [L422] _Bool tmp___6 ; [L423] _Bool tmp___7 ; [L424] _Bool tmp___8 ; [L425] int8_t tmp___9 ; [L426] _Bool tmp___10 ; [L427] _Bool tmp___11 ; [L428] _Bool tmp___12 ; [L429] msg_t tmp___13 ; [L430] _Bool tmp___14 ; [L431] _Bool tmp___15 ; [L432] _Bool tmp___16 ; [L433] _Bool tmp___17 ; [L434] int8_t tmp___18 ; [L435] int8_t tmp___19 ; [L436] int8_t tmp___20 ; VAL [active_side_History_0=0, active_side_History_1=0, 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=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1] [L439] COND TRUE ! side1Failed [L440] tmp = 1 VAL [active_side_History_0=0, active_side_History_1=0, 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=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1, tmp=1] [L447] CALL assume_abort_if_not((_Bool )tmp) VAL [\old(cond)=1, active_side_History_0=0, active_side_History_1=0, 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=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, 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=0, 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=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1] [L447] RET assume_abort_if_not((_Bool )tmp) VAL [active_side_History_0=0, active_side_History_1=0, 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=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1, tmp=1] [L448] CALL, EXPR read_manual_selection_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=0, 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=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, 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=0, 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=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, 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=-1, active_side_History_0=0, active_side_History_1=0, 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=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1] [L448] RET, EXPR read_manual_selection_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=0, 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=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1, tmp=1] [L448] tmp___0 = read_manual_selection_history((unsigned char)1) [L449] COND FALSE !(! tmp___0) VAL [active_side_History_0=0, active_side_History_1=0, 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=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1, tmp=1] [L478] CALL, EXPR read_side1_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=0, 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=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, 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=0, 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=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, 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=1, active_side_History_0=0, active_side_History_1=0, 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=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1] [L478] RET, EXPR read_side1_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=0, 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=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1, tmp=1] [L478] tmp___7 = read_side1_failed_history((unsigned char)1) [L479] COND TRUE \read(tmp___7) VAL [active_side_History_0=0, active_side_History_1=0, 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=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1, tmp=1] [L480] CALL, EXPR read_side2_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=0, 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=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, 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=0, 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=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, 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=0, 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=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1] [L480] RET, EXPR read_side2_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=0, 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=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1, tmp=1] [L480] tmp___8 = read_side2_failed_history((unsigned char)1) [L481] COND TRUE ! tmp___8 VAL [active_side_History_0=0, active_side_History_1=0, 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=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1, tmp=1] [L482] CALL, EXPR read_active_side_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=0, active_side_History_1=0, 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=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, 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=0, active_side_History_0=0, active_side_History_1=0, 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=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1] [L482] RET, EXPR read_active_side_history((unsigned char)0) VAL [active_side_History_0=0, active_side_History_1=0, 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=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1, tmp=1] [L482] tmp___5 = read_active_side_history((unsigned char)0) [L483] COND TRUE ! ((int )tmp___5 == 2) [L484] return (0); VAL [\result=0, active_side_History_0=0, active_side_History_1=0, 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=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1, tmp=1] [L596] RET, EXPR check() [L596] c1 = check() [L597] CALL assert(c1) VAL [\old(arg)=0, active_side_History_0=0, active_side_History_1=0, 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=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1] [L608] COND TRUE ! arg VAL [\old(arg)=0, active_side_History_0=0, active_side_History_1=0, 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=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1] [L610] reach_error() VAL [\old(arg)=0, active_side_History_0=0, active_side_History_1=0, 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=-1, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, 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=1, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=-1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 168 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 67.7s, OverallIterations: 36, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 36.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 16403 SdHoareTripleChecker+Valid, 11.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16340 mSDsluCounter, 58918 SdHoareTripleChecker+Invalid, 9.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 48248 mSDsCounter, 4820 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15223 IncrementalHoareTripleChecker+Invalid, 20043 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4820 mSolverCounterUnsat, 10670 mSDtfsCounter, 15223 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3526 GetRequests, 2996 SyntacticMatches, 4 SemanticMatches, 526 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6113 ImplicationChecksByTransitivity, 7.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15123occurred in iteration=35, InterpolantAutomatonStates: 424, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 14.5s AutomataMinimizationTime, 35 MinimizatonAttempts, 29134 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 12.3s InterpolantComputationTime, 4507 NumberOfCodeBlocks, 4507 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 5471 ConstructedInterpolants, 0 QuantifiedInterpolants, 14246 SizeOfPredicates, 33 NumberOfNonLiveVariables, 5283 ConjunctsInSsa, 211 ConjunctsInUnsatCore, 51 InterpolantComputations, 28 PerfectInterpolantSequences, 2094/2481 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-12 19:59:24,814 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE