./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 Calling Ultimate with: /usr/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 ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --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 a30aa210ed4a7c8ee647a70aef136aef282e5eccb07388ecda6495e33bc30b6d --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 05:18:36,597 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 05:18:36,598 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 05:18:36,628 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 05:18:36,631 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 05:18:36,632 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 05:18:36,633 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 05:18:36,636 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 05:18:36,638 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 05:18:36,638 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 05:18:36,639 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 05:18:36,641 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 05:18:36,642 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 05:18:36,647 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 05:18:36,648 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 05:18:36,649 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 05:18:36,650 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 05:18:36,650 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 05:18:36,651 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 05:18:36,652 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 05:18:36,653 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 05:18:36,654 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 05:18:36,655 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 05:18:36,657 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 05:18:36,657 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 05:18:36,660 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 05:18:36,660 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 05:18:36,660 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 05:18:36,661 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 05:18:36,661 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 05:18:36,662 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 05:18:36,662 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 05:18:36,663 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 05:18:36,663 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 05:18:36,664 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 05:18:36,664 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 05:18:36,665 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 05:18:36,665 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 05:18:36,665 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 05:18:36,666 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 05:18:36,666 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 05:18:36,674 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 05:18:36,677 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-21 05:18:36,709 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 05:18:36,711 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 05:18:36,712 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 05:18:36,712 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 05:18:36,712 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 05:18:36,712 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 05:18:36,713 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 05:18:36,713 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 05:18:36,713 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 05:18:36,714 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 05:18:36,714 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 05:18:36,714 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 05:18:36,715 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 05:18:36,715 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 05:18:36,715 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 05:18:36,715 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 05:18:36,715 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 05:18:36,715 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 05:18:36,716 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 05:18:36,716 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 05:18:36,716 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 05:18:36,716 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 05:18:36,716 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 05:18:36,717 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 05:18:36,717 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 05:18:36,717 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 05:18:36,717 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 05:18:36,717 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 05:18:36,717 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 05:18:36,717 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 05:18:36,718 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 05:18:36,718 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 05:18:36,718 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 05:18:36,718 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.graphml 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 -> a30aa210ed4a7c8ee647a70aef136aef282e5eccb07388ecda6495e33bc30b6d [2022-07-21 05:18:37,029 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 05:18:37,045 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 05:18:37,047 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 05:18:37,048 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 05:18:37,049 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 05:18:37,050 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c [2022-07-21 05:18:37,093 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e792ca87c/b217981ed98e4552a4e09f2bc12dabda/FLAGd0b10e86f [2022-07-21 05:18:37,520 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 05:18:37,521 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c [2022-07-21 05:18:37,531 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e792ca87c/b217981ed98e4552a4e09f2bc12dabda/FLAGd0b10e86f [2022-07-21 05:18:37,899 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e792ca87c/b217981ed98e4552a4e09f2bc12dabda [2022-07-21 05:18:37,901 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 05:18:37,903 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 05:18:37,904 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 05:18:37,904 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 05:18:37,906 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 05:18:37,907 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:18:37" (1/1) ... [2022-07-21 05:18:37,908 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5874b97e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:18:37, skipping insertion in model container [2022-07-21 05:18:37,908 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:18:37" (1/1) ... [2022-07-21 05:18:37,912 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 05:18:37,947 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 05:18:38,185 WARN L230 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.BOUNDED-10.pals.c[14540,14553] [2022-07-21 05:18:38,187 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 05:18:38,198 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 05:18:38,262 WARN L230 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.BOUNDED-10.pals.c[14540,14553] [2022-07-21 05:18:38,263 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 05:18:38,276 INFO L208 MainTranslator]: Completed translation [2022-07-21 05:18:38,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:18:38 WrapperNode [2022-07-21 05:18:38,277 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 05:18:38,278 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 05:18:38,278 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 05:18:38,278 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 05:18:38,283 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:18:38" (1/1) ... [2022-07-21 05:18:38,306 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:18:38" (1/1) ... [2022-07-21 05:18:38,344 INFO L137 Inliner]: procedures = 32, calls = 48, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 533 [2022-07-21 05:18:38,350 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 05:18:38,351 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 05:18:38,352 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 05:18:38,352 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 05:18:38,358 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:18:38" (1/1) ... [2022-07-21 05:18:38,358 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:18:38" (1/1) ... [2022-07-21 05:18:38,365 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:18:38" (1/1) ... [2022-07-21 05:18:38,365 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:18:38" (1/1) ... [2022-07-21 05:18:38,378 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:18:38" (1/1) ... [2022-07-21 05:18:38,388 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:18:38" (1/1) ... [2022-07-21 05:18:38,393 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:18:38" (1/1) ... [2022-07-21 05:18:38,406 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 05:18:38,408 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 05:18:38,408 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 05:18:38,408 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 05:18:38,411 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:18:38" (1/1) ... [2022-07-21 05:18:38,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 05:18:38,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:18:38,432 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-21 05:18:38,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-21 05:18:38,464 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2022-07-21 05:18:38,464 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2022-07-21 05:18:38,464 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 05:18:38,465 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2022-07-21 05:18:38,465 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2022-07-21 05:18:38,465 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2022-07-21 05:18:38,465 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2022-07-21 05:18:38,465 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2022-07-21 05:18:38,465 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2022-07-21 05:18:38,465 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-21 05:18:38,465 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-21 05:18:38,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 05:18:38,466 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2022-07-21 05:18:38,466 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2022-07-21 05:18:38,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 05:18:38,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 05:18:38,466 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2022-07-21 05:18:38,466 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2022-07-21 05:18:38,560 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 05:18:38,561 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 05:18:38,982 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 05:18:38,988 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 05:18:38,988 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-21 05:18:38,989 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:18:38 BoogieIcfgContainer [2022-07-21 05:18:38,990 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 05:18:38,991 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 05:18:38,991 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 05:18:38,993 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 05:18:38,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 05:18:37" (1/3) ... [2022-07-21 05:18:38,993 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@745cbd8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 05:18:38, skipping insertion in model container [2022-07-21 05:18:38,994 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:18:38" (2/3) ... [2022-07-21 05:18:38,994 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@745cbd8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 05:18:38, skipping insertion in model container [2022-07-21 05:18:38,994 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:18:38" (3/3) ... [2022-07-21 05:18:38,995 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c [2022-07-21 05:18:39,004 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 05:18:39,005 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 05:18:39,044 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 05:18:39,048 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@f604150, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@624f5623 [2022-07-21 05:18:39,048 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 05:18:39,052 INFO L276 IsEmpty]: Start isEmpty. Operand has 205 states, 165 states have (on average 1.5454545454545454) internal successors, (255), 166 states have internal predecessors, (255), 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) [2022-07-21 05:18:39,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-21 05:18:39,059 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:18:39,059 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:18:39,060 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:18:39,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:18:39,063 INFO L85 PathProgramCache]: Analyzing trace with hash 255328600, now seen corresponding path program 1 times [2022-07-21 05:18:39,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:18:39,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51906546] [2022-07-21 05:18:39,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:18:39,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:18:39,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:39,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 05:18:39,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:39,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 05:18:39,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:18:39,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51906546] [2022-07-21 05:18:39,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51906546] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:18:39,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 05:18:39,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 05:18:39,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024829002] [2022-07-21 05:18:39,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:18:39,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-21 05:18:39,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:18:39,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-21 05:18:39,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-21 05:18:39,265 INFO L87 Difference]: Start difference. First operand has 205 states, 165 states have (on average 1.5454545454545454) internal successors, (255), 166 states have internal predecessors, (255), 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 20.0) internal successors, (40), 2 states have internal predecessors, (40), 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) [2022-07-21 05:18:39,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:18:39,306 INFO L93 Difference]: Finished difference Result 394 states and 634 transitions. [2022-07-21 05:18:39,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-21 05:18:39,308 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 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 44 [2022-07-21 05:18:39,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:18:39,315 INFO L225 Difference]: With dead ends: 394 [2022-07-21 05:18:39,315 INFO L226 Difference]: Without dead ends: 201 [2022-07-21 05:18:39,319 INFO L412 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 [2022-07-21 05:18:39,322 INFO L413 NwaCegarLoop]: 308 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 05:18:39,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 05:18:39,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-07-21 05:18:39,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2022-07-21 05:18:39,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 162 states have (on average 1.4938271604938271) internal successors, (242), 162 states have internal predecessors, (242), 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) [2022-07-21 05:18:39,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 304 transitions. [2022-07-21 05:18:39,385 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 304 transitions. Word has length 44 [2022-07-21 05:18:39,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:18:39,386 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 304 transitions. [2022-07-21 05:18:39,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 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) [2022-07-21 05:18:39,386 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 304 transitions. [2022-07-21 05:18:39,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-21 05:18:39,388 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:18:39,388 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:18:39,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 05:18:39,388 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:18:39,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:18:39,389 INFO L85 PathProgramCache]: Analyzing trace with hash 246563096, now seen corresponding path program 1 times [2022-07-21 05:18:39,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:18:39,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389694349] [2022-07-21 05:18:39,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:18:39,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:18:39,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:39,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 05:18:39,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:39,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 05:18:39,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:18:39,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389694349] [2022-07-21 05:18:39,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389694349] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:18:39,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 05:18:39,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 05:18:39,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610761199] [2022-07-21 05:18:39,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:18:39,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 05:18:39,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:18:39,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 05:18:39,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 05:18:39,499 INFO L87 Difference]: Start difference. First operand 201 states and 304 transitions. Second operand has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 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) [2022-07-21 05:18:39,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:18:39,608 INFO L93 Difference]: Finished difference Result 525 states and 799 transitions. [2022-07-21 05:18:39,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 05:18:39,610 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 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 44 [2022-07-21 05:18:39,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:18:39,615 INFO L225 Difference]: With dead ends: 525 [2022-07-21 05:18:39,615 INFO L226 Difference]: Without dead ends: 338 [2022-07-21 05:18:39,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-21 05:18:39,617 INFO L413 NwaCegarLoop]: 323 mSDtfsCounter, 167 mSDsluCounter, 1241 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 1564 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 05:18:39,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 1564 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 05:18:39,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2022-07-21 05:18:39,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 201. [2022-07-21 05:18:39,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 162 states have (on average 1.4197530864197532) internal successors, (230), 162 states have internal predecessors, (230), 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) [2022-07-21 05:18:39,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 292 transitions. [2022-07-21 05:18:39,639 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 292 transitions. Word has length 44 [2022-07-21 05:18:39,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:18:39,639 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 292 transitions. [2022-07-21 05:18:39,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 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) [2022-07-21 05:18:39,640 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 292 transitions. [2022-07-21 05:18:39,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-21 05:18:39,641 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:18:39,641 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:18:39,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 05:18:39,641 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:18:39,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:18:39,642 INFO L85 PathProgramCache]: Analyzing trace with hash -428937283, now seen corresponding path program 1 times [2022-07-21 05:18:39,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:18:39,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695362090] [2022-07-21 05:18:39,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:18:39,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:18:39,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:39,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 05:18:39,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:39,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 05:18:39,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:18:39,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695362090] [2022-07-21 05:18:39,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695362090] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:18:39,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 05:18:39,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 05:18:39,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144323746] [2022-07-21 05:18:39,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:18:39,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 05:18:39,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:18:39,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 05:18:39,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 05:18:39,800 INFO L87 Difference]: Start difference. First operand 201 states and 292 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 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) [2022-07-21 05:18:39,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:18:39,854 INFO L93 Difference]: Finished difference Result 389 states and 574 transitions. [2022-07-21 05:18:39,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 05:18:39,854 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 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 55 [2022-07-21 05:18:39,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:18:39,857 INFO L225 Difference]: With dead ends: 389 [2022-07-21 05:18:39,857 INFO L226 Difference]: Without dead ends: 205 [2022-07-21 05:18:39,858 INFO L412 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 [2022-07-21 05:18:39,863 INFO L413 NwaCegarLoop]: 286 mSDtfsCounter, 5 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 05:18:39,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 848 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 05:18:39,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-07-21 05:18:39,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2022-07-21 05:18:39,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 165 states have (on average 1.412121212121212) internal successors, (233), 165 states have internal predecessors, (233), 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) [2022-07-21 05:18:39,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 295 transitions. [2022-07-21 05:18:39,887 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 295 transitions. Word has length 55 [2022-07-21 05:18:39,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:18:39,888 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 295 transitions. [2022-07-21 05:18:39,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 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) [2022-07-21 05:18:39,888 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 295 transitions. [2022-07-21 05:18:39,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-21 05:18:39,892 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:18:39,893 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:18:39,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 05:18:39,893 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:18:39,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:18:39,894 INFO L85 PathProgramCache]: Analyzing trace with hash 544058639, now seen corresponding path program 1 times [2022-07-21 05:18:39,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:18:39,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567257165] [2022-07-21 05:18:39,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:18:39,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:18:39,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:40,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 05:18:40,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:40,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 05:18:40,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:40,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 05:18:40,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:40,028 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 05:18:40,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:18:40,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567257165] [2022-07-21 05:18:40,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567257165] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:18:40,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 05:18:40,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 05:18:40,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870330429] [2022-07-21 05:18:40,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:18:40,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 05:18:40,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:18:40,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 05:18:40,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 05:18:40,035 INFO L87 Difference]: Start difference. First operand 205 states and 295 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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) [2022-07-21 05:18:40,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:18:40,091 INFO L93 Difference]: Finished difference Result 558 states and 814 transitions. [2022-07-21 05:18:40,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 05:18:40,092 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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 71 [2022-07-21 05:18:40,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:18:40,099 INFO L225 Difference]: With dead ends: 558 [2022-07-21 05:18:40,099 INFO L226 Difference]: Without dead ends: 370 [2022-07-21 05:18:40,101 INFO L412 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 [2022-07-21 05:18:40,111 INFO L413 NwaCegarLoop]: 337 mSDtfsCounter, 223 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 05:18:40,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 614 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 05:18:40,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2022-07-21 05:18:40,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 360. [2022-07-21 05:18:40,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 283 states have (on average 1.431095406360424) internal successors, (405), 284 states have internal predecessors, (405), 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) [2022-07-21 05:18:40,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 525 transitions. [2022-07-21 05:18:40,144 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 525 transitions. Word has length 71 [2022-07-21 05:18:40,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:18:40,144 INFO L495 AbstractCegarLoop]: Abstraction has 360 states and 525 transitions. [2022-07-21 05:18:40,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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) [2022-07-21 05:18:40,145 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 525 transitions. [2022-07-21 05:18:40,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-21 05:18:40,148 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:18:40,148 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:18:40,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 05:18:40,148 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:18:40,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:18:40,149 INFO L85 PathProgramCache]: Analyzing trace with hash -729077, now seen corresponding path program 1 times [2022-07-21 05:18:40,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:18:40,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419140625] [2022-07-21 05:18:40,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:18:40,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:18:40,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:40,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 05:18:40,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:40,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 05:18:40,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:40,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-21 05:18:40,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:40,233 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 05:18:40,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:18:40,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419140625] [2022-07-21 05:18:40,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419140625] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:18:40,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 05:18:40,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 05:18:40,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647801736] [2022-07-21 05:18:40,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:18:40,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 05:18:40,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:18:40,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 05:18:40,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 05:18:40,235 INFO L87 Difference]: Start difference. First operand 360 states and 525 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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) [2022-07-21 05:18:40,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:18:40,274 INFO L93 Difference]: Finished difference Result 997 states and 1468 transitions. [2022-07-21 05:18:40,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 05:18:40,275 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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 72 [2022-07-21 05:18:40,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:18:40,279 INFO L225 Difference]: With dead ends: 997 [2022-07-21 05:18:40,279 INFO L226 Difference]: Without dead ends: 654 [2022-07-21 05:18:40,280 INFO L412 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 [2022-07-21 05:18:40,281 INFO L413 NwaCegarLoop]: 370 mSDtfsCounter, 231 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 05:18:40,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 649 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 05:18:40,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2022-07-21 05:18:40,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 637. [2022-07-21 05:18:40,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 488 states have (on average 1.4487704918032787) internal successors, (707), 491 states have internal predecessors, (707), 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) [2022-07-21 05:18:40,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 941 transitions. [2022-07-21 05:18:40,313 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 941 transitions. Word has length 72 [2022-07-21 05:18:40,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:18:40,315 INFO L495 AbstractCegarLoop]: Abstraction has 637 states and 941 transitions. [2022-07-21 05:18:40,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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) [2022-07-21 05:18:40,315 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 941 transitions. [2022-07-21 05:18:40,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-21 05:18:40,317 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:18:40,317 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:18:40,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 05:18:40,317 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:18:40,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:18:40,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1280592755, now seen corresponding path program 1 times [2022-07-21 05:18:40,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:18:40,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949944789] [2022-07-21 05:18:40,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:18:40,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:18:40,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:40,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 05:18:40,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:40,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 05:18:40,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:40,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-21 05:18:40,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:40,430 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 05:18:40,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:18:40,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949944789] [2022-07-21 05:18:40,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949944789] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:18:40,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 05:18:40,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 05:18:40,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374299383] [2022-07-21 05:18:40,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:18:40,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 05:18:40,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:18:40,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 05:18:40,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 05:18:40,432 INFO L87 Difference]: Start difference. First operand 637 states and 941 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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) [2022-07-21 05:18:40,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:18:40,699 INFO L93 Difference]: Finished difference Result 1785 states and 2683 transitions. [2022-07-21 05:18:40,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 05:18:40,700 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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 72 [2022-07-21 05:18:40,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:18:40,707 INFO L225 Difference]: With dead ends: 1785 [2022-07-21 05:18:40,708 INFO L226 Difference]: Without dead ends: 1165 [2022-07-21 05:18:40,709 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-21 05:18:40,710 INFO L413 NwaCegarLoop]: 287 mSDtfsCounter, 770 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 770 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 05:18:40,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [770 Valid, 776 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 05:18:40,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2022-07-21 05:18:40,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 762. [2022-07-21 05:18:40,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 762 states, 600 states have (on average 1.4283333333333332) internal successors, (857), 603 states have internal predecessors, (857), 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) [2022-07-21 05:18:40,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 1105 transitions. [2022-07-21 05:18:40,775 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 1105 transitions. Word has length 72 [2022-07-21 05:18:40,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:18:40,776 INFO L495 AbstractCegarLoop]: Abstraction has 762 states and 1105 transitions. [2022-07-21 05:18:40,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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) [2022-07-21 05:18:40,776 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 1105 transitions. [2022-07-21 05:18:40,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-07-21 05:18:40,777 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:18:40,777 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:18:40,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-21 05:18:40,778 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:18:40,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:18:40,778 INFO L85 PathProgramCache]: Analyzing trace with hash 740165986, now seen corresponding path program 1 times [2022-07-21 05:18:40,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:18:40,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308015798] [2022-07-21 05:18:40,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:18:40,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:18:40,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:40,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 05:18:40,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:40,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 05:18:40,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:40,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-21 05:18:40,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:40,860 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 05:18:40,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:18:40,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308015798] [2022-07-21 05:18:40,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308015798] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:18:40,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 05:18:40,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 05:18:40,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897077024] [2022-07-21 05:18:40,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:18:40,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 05:18:40,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:18:40,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 05:18:40,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 05:18:40,863 INFO L87 Difference]: Start difference. First operand 762 states and 1105 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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) [2022-07-21 05:18:41,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:18:41,134 INFO L93 Difference]: Finished difference Result 1785 states and 2675 transitions. [2022-07-21 05:18:41,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 05:18:41,135 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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 73 [2022-07-21 05:18:41,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:18:41,143 INFO L225 Difference]: With dead ends: 1785 [2022-07-21 05:18:41,143 INFO L226 Difference]: Without dead ends: 1165 [2022-07-21 05:18:41,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-21 05:18:41,147 INFO L413 NwaCegarLoop]: 288 mSDtfsCounter, 766 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 766 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 05:18:41,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [766 Valid, 779 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 05:18:41,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2022-07-21 05:18:41,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 762. [2022-07-21 05:18:41,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 762 states, 600 states have (on average 1.4216666666666666) internal successors, (853), 603 states have internal predecessors, (853), 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) [2022-07-21 05:18:41,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 1101 transitions. [2022-07-21 05:18:41,206 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 1101 transitions. Word has length 73 [2022-07-21 05:18:41,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:18:41,207 INFO L495 AbstractCegarLoop]: Abstraction has 762 states and 1101 transitions. [2022-07-21 05:18:41,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 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) [2022-07-21 05:18:41,207 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 1101 transitions. [2022-07-21 05:18:41,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-21 05:18:41,209 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:18:41,209 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:18:41,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-21 05:18:41,215 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:18:41,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:18:41,215 INFO L85 PathProgramCache]: Analyzing trace with hash -2060570112, now seen corresponding path program 1 times [2022-07-21 05:18:41,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:18:41,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100500936] [2022-07-21 05:18:41,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:18:41,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:18:41,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:41,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 05:18:41,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:41,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 05:18:41,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:41,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 05:18:41,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:41,291 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 05:18:41,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:18:41,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100500936] [2022-07-21 05:18:41,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100500936] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:18:41,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 05:18:41,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 05:18:41,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173904044] [2022-07-21 05:18:41,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:18:41,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 05:18:41,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:18:41,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 05:18:41,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 05:18:41,293 INFO L87 Difference]: Start difference. First operand 762 states and 1101 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (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) [2022-07-21 05:18:41,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:18:41,345 INFO L93 Difference]: Finished difference Result 1402 states and 2052 transitions. [2022-07-21 05:18:41,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 05:18:41,347 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (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 74 [2022-07-21 05:18:41,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:18:41,350 INFO L225 Difference]: With dead ends: 1402 [2022-07-21 05:18:41,350 INFO L226 Difference]: Without dead ends: 782 [2022-07-21 05:18:41,352 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 05:18:41,352 INFO L413 NwaCegarLoop]: 288 mSDtfsCounter, 6 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 860 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 05:18:41,353 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 860 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 05:18:41,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2022-07-21 05:18:41,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 782. [2022-07-21 05:18:41,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 782 states, 616 states have (on average 1.4107142857142858) internal successors, (869), 619 states have internal predecessors, (869), 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) [2022-07-21 05:18:41,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1117 transitions. [2022-07-21 05:18:41,418 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1117 transitions. Word has length 74 [2022-07-21 05:18:41,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:18:41,418 INFO L495 AbstractCegarLoop]: Abstraction has 782 states and 1117 transitions. [2022-07-21 05:18:41,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (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) [2022-07-21 05:18:41,418 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1117 transitions. [2022-07-21 05:18:41,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-21 05:18:41,420 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:18:41,420 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:18:41,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-21 05:18:41,420 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:18:41,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:18:41,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1071682645, now seen corresponding path program 1 times [2022-07-21 05:18:41,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:18:41,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067360614] [2022-07-21 05:18:41,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:18:41,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:18:41,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:41,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 05:18:41,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:41,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 05:18:41,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:41,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 05:18:41,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:41,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-21 05:18:41,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:41,514 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 05:18:41,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:18:41,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067360614] [2022-07-21 05:18:41,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067360614] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:18:41,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 05:18:41,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 05:18:41,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292058802] [2022-07-21 05:18:41,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:18:41,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 05:18:41,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:18:41,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 05:18:41,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 05:18:41,517 INFO L87 Difference]: Start difference. First operand 782 states and 1117 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 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) [2022-07-21 05:18:41,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:18:41,587 INFO L93 Difference]: Finished difference Result 1442 states and 2096 transitions. [2022-07-21 05:18:41,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 05:18:41,588 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 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 82 [2022-07-21 05:18:41,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:18:41,592 INFO L225 Difference]: With dead ends: 1442 [2022-07-21 05:18:41,592 INFO L226 Difference]: Without dead ends: 802 [2022-07-21 05:18:41,594 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 05:18:41,596 INFO L413 NwaCegarLoop]: 285 mSDtfsCounter, 6 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 05:18:41,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 846 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 05:18:41,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2022-07-21 05:18:41,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 802. [2022-07-21 05:18:41,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 802 states, 632 states have (on average 1.4003164556962024) internal successors, (885), 635 states have internal predecessors, (885), 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) [2022-07-21 05:18:41,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 1133 transitions. [2022-07-21 05:18:41,638 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 1133 transitions. Word has length 82 [2022-07-21 05:18:41,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:18:41,638 INFO L495 AbstractCegarLoop]: Abstraction has 802 states and 1133 transitions. [2022-07-21 05:18:41,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 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) [2022-07-21 05:18:41,639 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1133 transitions. [2022-07-21 05:18:41,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-07-21 05:18:41,640 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:18:41,640 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:18:41,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-21 05:18:41,641 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:18:41,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:18:41,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1920470825, now seen corresponding path program 1 times [2022-07-21 05:18:41,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:18:41,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402516242] [2022-07-21 05:18:41,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:18:41,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:18:41,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:41,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 05:18:41,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:41,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 05:18:41,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:41,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 05:18:41,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:41,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-21 05:18:41,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:41,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 05:18:41,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:41,745 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 05:18:41,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:18:41,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402516242] [2022-07-21 05:18:41,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402516242] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:18:41,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 05:18:41,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 05:18:41,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706031396] [2022-07-21 05:18:41,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:18:41,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 05:18:41,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:18:41,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 05:18:41,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 05:18:41,747 INFO L87 Difference]: Start difference. First operand 802 states and 1133 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 3 states have internal predecessors, (75), 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) [2022-07-21 05:18:41,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:18:41,814 INFO L93 Difference]: Finished difference Result 1482 states and 2128 transitions. [2022-07-21 05:18:41,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 05:18:41,814 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 3 states have internal predecessors, (75), 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 90 [2022-07-21 05:18:41,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:18:41,818 INFO L225 Difference]: With dead ends: 1482 [2022-07-21 05:18:41,818 INFO L226 Difference]: Without dead ends: 822 [2022-07-21 05:18:41,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 05:18:41,820 INFO L413 NwaCegarLoop]: 285 mSDtfsCounter, 6 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 05:18:41,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 846 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 05:18:41,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2022-07-21 05:18:41,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 822. [2022-07-21 05:18:41,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 822 states, 648 states have (on average 1.3904320987654322) internal successors, (901), 651 states have internal predecessors, (901), 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) [2022-07-21 05:18:41,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1149 transitions. [2022-07-21 05:18:41,857 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1149 transitions. Word has length 90 [2022-07-21 05:18:41,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:18:41,857 INFO L495 AbstractCegarLoop]: Abstraction has 822 states and 1149 transitions. [2022-07-21 05:18:41,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 3 states have internal predecessors, (75), 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) [2022-07-21 05:18:41,858 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1149 transitions. [2022-07-21 05:18:41,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-07-21 05:18:41,859 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:18:41,859 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:18:41,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-21 05:18:41,860 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:18:41,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:18:41,860 INFO L85 PathProgramCache]: Analyzing trace with hash -21962832, now seen corresponding path program 1 times [2022-07-21 05:18:41,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:18:41,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450718980] [2022-07-21 05:18:41,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:18:41,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:18:41,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:41,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 05:18:41,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:41,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 05:18:41,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:41,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 05:18:41,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:41,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-21 05:18:41,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:41,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 05:18:41,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:41,919 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-21 05:18:41,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:18:41,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450718980] [2022-07-21 05:18:41,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450718980] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:18:41,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 05:18:41,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 05:18:41,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045525621] [2022-07-21 05:18:41,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:18:41,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 05:18:41,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:18:41,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 05:18:41,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 05:18:41,921 INFO L87 Difference]: Start difference. First operand 822 states and 1149 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 3 states have internal predecessors, (75), 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) [2022-07-21 05:18:41,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:18:41,968 INFO L93 Difference]: Finished difference Result 1518 states and 2144 transitions. [2022-07-21 05:18:41,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 05:18:41,969 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 3 states have internal predecessors, (75), 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 90 [2022-07-21 05:18:41,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:18:41,972 INFO L225 Difference]: With dead ends: 1518 [2022-07-21 05:18:41,973 INFO L226 Difference]: Without dead ends: 838 [2022-07-21 05:18:41,974 INFO L412 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 [2022-07-21 05:18:41,975 INFO L413 NwaCegarLoop]: 290 mSDtfsCounter, 5 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 05:18:41,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 855 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 05:18:41,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2022-07-21 05:18:42,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2022-07-21 05:18:42,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 660 states have (on average 1.3833333333333333) internal successors, (913), 663 states have internal predecessors, (913), 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) [2022-07-21 05:18:42,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1161 transitions. [2022-07-21 05:18:42,017 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1161 transitions. Word has length 90 [2022-07-21 05:18:42,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:18:42,017 INFO L495 AbstractCegarLoop]: Abstraction has 838 states and 1161 transitions. [2022-07-21 05:18:42,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 3 states have internal predecessors, (75), 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) [2022-07-21 05:18:42,018 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1161 transitions. [2022-07-21 05:18:42,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-21 05:18:42,020 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:18:42,020 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:18:42,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-21 05:18:42,021 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:18:42,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:18:42,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1155165143, now seen corresponding path program 1 times [2022-07-21 05:18:42,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:18:42,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432494185] [2022-07-21 05:18:42,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:18:42,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:18:42,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:42,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 05:18:42,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:42,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 05:18:42,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:42,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 05:18:42,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:42,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-21 05:18:42,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:42,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 05:18:42,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:42,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 05:18:42,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:42,099 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-21 05:18:42,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:18:42,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432494185] [2022-07-21 05:18:42,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432494185] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:18:42,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 05:18:42,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 05:18:42,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872517945] [2022-07-21 05:18:42,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:18:42,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 05:18:42,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:18:42,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 05:18:42,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 05:18:42,101 INFO L87 Difference]: Start difference. First operand 838 states and 1161 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 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) [2022-07-21 05:18:42,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:18:42,153 INFO L93 Difference]: Finished difference Result 1558 states and 2180 transitions. [2022-07-21 05:18:42,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 05:18:42,154 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 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 98 [2022-07-21 05:18:42,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:18:42,157 INFO L225 Difference]: With dead ends: 1558 [2022-07-21 05:18:42,157 INFO L226 Difference]: Without dead ends: 862 [2022-07-21 05:18:42,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 05:18:42,160 INFO L413 NwaCegarLoop]: 289 mSDtfsCounter, 7 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 05:18:42,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 857 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 05:18:42,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2022-07-21 05:18:42,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 862. [2022-07-21 05:18:42,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 862 states, 680 states have (on average 1.3720588235294118) internal successors, (933), 683 states have internal predecessors, (933), 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) [2022-07-21 05:18:42,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 1181 transitions. [2022-07-21 05:18:42,200 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 1181 transitions. Word has length 98 [2022-07-21 05:18:42,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:18:42,201 INFO L495 AbstractCegarLoop]: Abstraction has 862 states and 1181 transitions. [2022-07-21 05:18:42,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 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) [2022-07-21 05:18:42,201 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1181 transitions. [2022-07-21 05:18:42,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-21 05:18:42,202 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:18:42,203 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:18:42,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-21 05:18:42,203 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:18:42,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:18:42,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1039496388, now seen corresponding path program 1 times [2022-07-21 05:18:42,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:18:42,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310179542] [2022-07-21 05:18:42,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:18:42,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:18:42,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:42,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 05:18:42,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:42,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 05:18:42,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:42,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 05:18:42,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:42,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-21 05:18:42,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:42,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 05:18:42,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:42,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 05:18:42,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:42,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-21 05:18:42,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:42,352 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-21 05:18:42,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:18:42,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310179542] [2022-07-21 05:18:42,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310179542] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:18:42,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 05:18:42,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 05:18:42,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926009577] [2022-07-21 05:18:42,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:18:42,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 05:18:42,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:18:42,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 05:18:42,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 05:18:42,354 INFO L87 Difference]: Start difference. First operand 862 states and 1181 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 6 states have internal predecessors, (80), 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) [2022-07-21 05:18:42,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:18:42,622 INFO L93 Difference]: Finished difference Result 2467 states and 3431 transitions. [2022-07-21 05:18:42,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 05:18:42,623 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 6 states have internal predecessors, (80), 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 101 [2022-07-21 05:18:42,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:18:42,630 INFO L225 Difference]: With dead ends: 2467 [2022-07-21 05:18:42,630 INFO L226 Difference]: Without dead ends: 1747 [2022-07-21 05:18:42,632 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-07-21 05:18:42,632 INFO L413 NwaCegarLoop]: 411 mSDtfsCounter, 391 mSDsluCounter, 1849 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 2260 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 05:18:42,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 2260 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 05:18:42,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1747 states. [2022-07-21 05:18:42,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1747 to 1146. [2022-07-21 05:18:42,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1146 states, 891 states have (on average 1.3636363636363635) internal successors, (1215), 896 states have internal predecessors, (1215), 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) [2022-07-21 05:18:42,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 1146 states and 1559 transitions. [2022-07-21 05:18:42,702 INFO L78 Accepts]: Start accepts. Automaton has 1146 states and 1559 transitions. Word has length 101 [2022-07-21 05:18:42,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:18:42,703 INFO L495 AbstractCegarLoop]: Abstraction has 1146 states and 1559 transitions. [2022-07-21 05:18:42,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 6 states have internal predecessors, (80), 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) [2022-07-21 05:18:42,703 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 1559 transitions. [2022-07-21 05:18:42,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-07-21 05:18:42,705 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:18:42,705 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:18:42,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-21 05:18:42,705 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:18:42,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:18:42,706 INFO L85 PathProgramCache]: Analyzing trace with hash -410105680, now seen corresponding path program 1 times [2022-07-21 05:18:42,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:18:42,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287907270] [2022-07-21 05:18:42,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:18:42,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:18:42,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:42,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 05:18:42,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:42,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 05:18:42,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:42,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 05:18:42,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:42,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-21 05:18:42,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:42,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 05:18:42,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:42,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 05:18:42,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:42,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-21 05:18:42,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:42,795 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-21 05:18:42,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:18:42,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287907270] [2022-07-21 05:18:42,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287907270] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:18:42,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 05:18:42,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 05:18:42,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512024973] [2022-07-21 05:18:42,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:18:42,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 05:18:42,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:18:42,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 05:18:42,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 05:18:42,797 INFO L87 Difference]: Start difference. First operand 1146 states and 1559 transitions. Second operand has 6 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-21 05:18:42,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:18:42,922 INFO L93 Difference]: Finished difference Result 1611 states and 2289 transitions. [2022-07-21 05:18:42,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 05:18:42,922 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 104 [2022-07-21 05:18:42,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:18:42,930 INFO L225 Difference]: With dead ends: 1611 [2022-07-21 05:18:42,930 INFO L226 Difference]: Without dead ends: 1609 [2022-07-21 05:18:42,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-21 05:18:42,932 INFO L413 NwaCegarLoop]: 509 mSDtfsCounter, 255 mSDsluCounter, 1718 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 2227 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 05:18:42,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 2227 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 05:18:42,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1609 states. [2022-07-21 05:18:43,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1609 to 1154. [2022-07-21 05:18:43,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1154 states, 895 states have (on average 1.3620111731843576) internal successors, (1219), 902 states have internal predecessors, (1219), 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) [2022-07-21 05:18:43,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 1567 transitions. [2022-07-21 05:18:43,018 INFO L78 Accepts]: Start accepts. Automaton has 1154 states and 1567 transitions. Word has length 104 [2022-07-21 05:18:43,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:18:43,018 INFO L495 AbstractCegarLoop]: Abstraction has 1154 states and 1567 transitions. [2022-07-21 05:18:43,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-21 05:18:43,019 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 1567 transitions. [2022-07-21 05:18:43,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-07-21 05:18:43,020 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:18:43,020 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:18:43,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-21 05:18:43,020 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:18:43,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:18:43,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1945149666, now seen corresponding path program 1 times [2022-07-21 05:18:43,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:18:43,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494020727] [2022-07-21 05:18:43,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:18:43,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:18:43,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:43,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 05:18:43,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:43,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 05:18:43,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:43,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 05:18:43,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:43,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-21 05:18:43,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:43,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 05:18:43,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:43,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 05:18:43,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:43,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-21 05:18:43,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:43,073 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-21 05:18:43,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:18:43,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494020727] [2022-07-21 05:18:43,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494020727] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:18:43,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 05:18:43,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 05:18:43,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100787480] [2022-07-21 05:18:43,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:18:43,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 05:18:43,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:18:43,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 05:18:43,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 05:18:43,075 INFO L87 Difference]: Start difference. First operand 1154 states and 1567 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 3 states have internal predecessors, (84), 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) [2022-07-21 05:18:43,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:18:43,162 INFO L93 Difference]: Finished difference Result 2122 states and 2904 transitions. [2022-07-21 05:18:43,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 05:18:43,162 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 3 states have internal predecessors, (84), 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 105 [2022-07-21 05:18:43,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:18:43,168 INFO L225 Difference]: With dead ends: 2122 [2022-07-21 05:18:43,168 INFO L226 Difference]: Without dead ends: 1178 [2022-07-21 05:18:43,170 INFO L412 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 [2022-07-21 05:18:43,170 INFO L413 NwaCegarLoop]: 290 mSDtfsCounter, 5 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 05:18:43,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 855 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 05:18:43,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2022-07-21 05:18:43,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 1178. [2022-07-21 05:18:43,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1178 states, 913 states have (on average 1.3548740416210296) internal successors, (1237), 920 states have internal predecessors, (1237), 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) [2022-07-21 05:18:43,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1178 states to 1178 states and 1585 transitions. [2022-07-21 05:18:43,226 INFO L78 Accepts]: Start accepts. Automaton has 1178 states and 1585 transitions. Word has length 105 [2022-07-21 05:18:43,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:18:43,226 INFO L495 AbstractCegarLoop]: Abstraction has 1178 states and 1585 transitions. [2022-07-21 05:18:43,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 3 states have internal predecessors, (84), 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) [2022-07-21 05:18:43,227 INFO L276 IsEmpty]: Start isEmpty. Operand 1178 states and 1585 transitions. [2022-07-21 05:18:43,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-21 05:18:43,228 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:18:43,228 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:18:43,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-21 05:18:43,228 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:18:43,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:18:43,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1810984556, now seen corresponding path program 1 times [2022-07-21 05:18:43,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:18:43,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216595522] [2022-07-21 05:18:43,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:18:43,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:18:43,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:43,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 05:18:43,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:43,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 05:18:43,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:43,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 05:18:43,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:43,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-21 05:18:43,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:43,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 05:18:43,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:43,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 05:18:43,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:43,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-21 05:18:43,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:43,305 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-21 05:18:43,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:18:43,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216595522] [2022-07-21 05:18:43,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216595522] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:18:43,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 05:18:43,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 05:18:43,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197001100] [2022-07-21 05:18:43,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:18:43,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 05:18:43,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:18:43,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 05:18:43,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 05:18:43,308 INFO L87 Difference]: Start difference. First operand 1178 states and 1585 transitions. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 6 states have internal predecessors, (83), 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) [2022-07-21 05:18:43,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:18:43,502 INFO L93 Difference]: Finished difference Result 2408 states and 3282 transitions. [2022-07-21 05:18:43,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 05:18:43,503 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 6 states have internal predecessors, (83), 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 107 [2022-07-21 05:18:43,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:18:43,508 INFO L225 Difference]: With dead ends: 2408 [2022-07-21 05:18:43,509 INFO L226 Difference]: Without dead ends: 1522 [2022-07-21 05:18:43,511 INFO L412 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 [2022-07-21 05:18:43,512 INFO L413 NwaCegarLoop]: 404 mSDtfsCounter, 513 mSDsluCounter, 1827 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 2231 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 05:18:43,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 2231 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 05:18:43,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1522 states. [2022-07-21 05:18:43,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1522 to 1224. [2022-07-21 05:18:43,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1224 states, 970 states have (on average 1.3443298969072166) internal successors, (1304), 982 states have internal predecessors, (1304), 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) [2022-07-21 05:18:43,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 1224 states and 1628 transitions. [2022-07-21 05:18:43,607 INFO L78 Accepts]: Start accepts. Automaton has 1224 states and 1628 transitions. Word has length 107 [2022-07-21 05:18:43,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:18:43,607 INFO L495 AbstractCegarLoop]: Abstraction has 1224 states and 1628 transitions. [2022-07-21 05:18:43,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 6 states have internal predecessors, (83), 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) [2022-07-21 05:18:43,607 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 1628 transitions. [2022-07-21 05:18:43,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-07-21 05:18:43,608 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:18:43,608 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:18:43,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-21 05:18:43,609 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:18:43,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:18:43,609 INFO L85 PathProgramCache]: Analyzing trace with hash 687723298, now seen corresponding path program 1 times [2022-07-21 05:18:43,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:18:43,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790679611] [2022-07-21 05:18:43,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:18:43,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:18:43,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:43,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 05:18:43,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:43,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 05:18:43,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:43,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 05:18:43,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:43,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-21 05:18:43,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:43,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 05:18:43,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:43,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 05:18:43,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:43,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-21 05:18:43,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:43,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-21 05:18:43,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:43,725 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-21 05:18:43,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:18:43,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790679611] [2022-07-21 05:18:43,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790679611] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:18:43,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 05:18:43,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 05:18:43,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288703629] [2022-07-21 05:18:43,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:18:43,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 05:18:43,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:18:43,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 05:18:43,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 05:18:43,727 INFO L87 Difference]: Start difference. First operand 1224 states and 1628 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, (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) [2022-07-21 05:18:43,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:18:43,931 INFO L93 Difference]: Finished difference Result 2518 states and 3425 transitions. [2022-07-21 05:18:43,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 05:18:43,932 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, (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 109 [2022-07-21 05:18:43,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:18:43,938 INFO L225 Difference]: With dead ends: 2518 [2022-07-21 05:18:43,938 INFO L226 Difference]: Without dead ends: 1566 [2022-07-21 05:18:43,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-07-21 05:18:43,941 INFO L413 NwaCegarLoop]: 434 mSDtfsCounter, 395 mSDsluCounter, 1947 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 2381 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 05:18:43,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 2381 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 05:18:43,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1566 states. [2022-07-21 05:18:44,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1566 to 1110. [2022-07-21 05:18:44,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1110 states, 883 states have (on average 1.345413363533409) internal successors, (1188), 893 states have internal predecessors, (1188), 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) [2022-07-21 05:18:44,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1478 transitions. [2022-07-21 05:18:44,011 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 1478 transitions. Word has length 109 [2022-07-21 05:18:44,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:18:44,011 INFO L495 AbstractCegarLoop]: Abstraction has 1110 states and 1478 transitions. [2022-07-21 05:18:44,012 INFO L496 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, (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) [2022-07-21 05:18:44,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1478 transitions. [2022-07-21 05:18:44,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-21 05:18:44,013 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:18:44,013 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:18:44,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-21 05:18:44,013 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:18:44,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:18:44,013 INFO L85 PathProgramCache]: Analyzing trace with hash 943897966, now seen corresponding path program 1 times [2022-07-21 05:18:44,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:18:44,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188198059] [2022-07-21 05:18:44,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:18:44,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:18:44,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:44,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 05:18:44,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:44,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 05:18:44,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:44,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 05:18:44,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:44,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-21 05:18:44,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:44,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 05:18:44,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:44,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 05:18:44,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:44,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-21 05:18:44,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:44,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 05:18:44,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:44,128 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-21 05:18:44,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:18:44,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188198059] [2022-07-21 05:18:44,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188198059] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:18:44,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 05:18:44,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 05:18:44,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748203906] [2022-07-21 05:18:44,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:18:44,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 05:18:44,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:18:44,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 05:18:44,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-21 05:18:44,130 INFO L87 Difference]: Start difference. First operand 1110 states and 1478 transitions. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 7 states have internal predecessors, (87), 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) [2022-07-21 05:18:44,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:18:44,595 INFO L93 Difference]: Finished difference Result 2589 states and 3532 transitions. [2022-07-21 05:18:44,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 05:18:44,596 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 7 states have internal predecessors, (87), 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 110 [2022-07-21 05:18:44,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:18:44,602 INFO L225 Difference]: With dead ends: 2589 [2022-07-21 05:18:44,602 INFO L226 Difference]: Without dead ends: 1671 [2022-07-21 05:18:44,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-07-21 05:18:44,605 INFO L413 NwaCegarLoop]: 501 mSDtfsCounter, 1030 mSDsluCounter, 1628 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1036 SdHoareTripleChecker+Valid, 2129 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 05:18:44,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1036 Valid, 2129 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 05:18:44,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2022-07-21 05:18:44,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1126. [2022-07-21 05:18:44,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1126 states, 891 states have (on average 1.3254769921436589) internal successors, (1181), 902 states have internal predecessors, (1181), 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) [2022-07-21 05:18:44,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 1126 states and 1477 transitions. [2022-07-21 05:18:44,701 INFO L78 Accepts]: Start accepts. Automaton has 1126 states and 1477 transitions. Word has length 110 [2022-07-21 05:18:44,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:18:44,702 INFO L495 AbstractCegarLoop]: Abstraction has 1126 states and 1477 transitions. [2022-07-21 05:18:44,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 7 states have internal predecessors, (87), 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) [2022-07-21 05:18:44,702 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 1477 transitions. [2022-07-21 05:18:44,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-21 05:18:44,703 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:18:44,703 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:18:44,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-21 05:18:44,704 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:18:44,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:18:44,704 INFO L85 PathProgramCache]: Analyzing trace with hash 272075901, now seen corresponding path program 1 times [2022-07-21 05:18:44,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:18:44,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371367945] [2022-07-21 05:18:44,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:18:44,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:18:44,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:44,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 05:18:44,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:44,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 05:18:44,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:44,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 05:18:44,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:44,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-21 05:18:44,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:44,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 05:18:44,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:44,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 05:18:44,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:44,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-21 05:18:44,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:44,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 05:18:44,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:44,759 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-21 05:18:44,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:18:44,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371367945] [2022-07-21 05:18:44,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371367945] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:18:44,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 05:18:44,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 05:18:44,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942233505] [2022-07-21 05:18:44,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:18:44,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 05:18:44,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:18:44,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 05:18:44,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 05:18:44,761 INFO L87 Difference]: Start difference. First operand 1126 states and 1477 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 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) [2022-07-21 05:18:45,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:18:45,020 INFO L93 Difference]: Finished difference Result 3155 states and 4223 transitions. [2022-07-21 05:18:45,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 05:18:45,020 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 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 110 [2022-07-21 05:18:45,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:18:45,029 INFO L225 Difference]: With dead ends: 3155 [2022-07-21 05:18:45,029 INFO L226 Difference]: Without dead ends: 2272 [2022-07-21 05:18:45,031 INFO L412 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 [2022-07-21 05:18:45,031 INFO L413 NwaCegarLoop]: 503 mSDtfsCounter, 434 mSDsluCounter, 708 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 1211 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 05:18:45,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 1211 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 05:18:45,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2272 states. [2022-07-21 05:18:45,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2272 to 1915. [2022-07-21 05:18:45,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1915 states, 1490 states have (on average 1.323489932885906) internal successors, (1972), 1509 states have internal predecessors, (1972), 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) [2022-07-21 05:18:45,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1915 states to 1915 states and 2516 transitions. [2022-07-21 05:18:45,201 INFO L78 Accepts]: Start accepts. Automaton has 1915 states and 2516 transitions. Word has length 110 [2022-07-21 05:18:45,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:18:45,201 INFO L495 AbstractCegarLoop]: Abstraction has 1915 states and 2516 transitions. [2022-07-21 05:18:45,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 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) [2022-07-21 05:18:45,202 INFO L276 IsEmpty]: Start isEmpty. Operand 1915 states and 2516 transitions. [2022-07-21 05:18:45,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-07-21 05:18:45,203 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:18:45,203 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:18:45,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-21 05:18:45,203 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:18:45,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:18:45,204 INFO L85 PathProgramCache]: Analyzing trace with hash 173907826, now seen corresponding path program 1 times [2022-07-21 05:18:45,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:18:45,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635074462] [2022-07-21 05:18:45,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:18:45,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:18:45,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:45,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 05:18:45,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:45,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 05:18:45,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:45,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 05:18:45,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:45,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-21 05:18:45,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:45,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 05:18:45,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:45,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 05:18:45,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:45,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-21 05:18:45,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:45,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 05:18:45,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:45,334 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-21 05:18:45,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:18:45,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635074462] [2022-07-21 05:18:45,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635074462] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:18:45,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 05:18:45,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 05:18:45,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232863663] [2022-07-21 05:18:45,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:18:45,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 05:18:45,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:18:45,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 05:18:45,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 05:18:45,336 INFO L87 Difference]: Start difference. First operand 1915 states and 2516 transitions. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 6 states have internal predecessors, (89), 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) [2022-07-21 05:18:45,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:18:45,909 INFO L93 Difference]: Finished difference Result 4352 states and 5848 transitions. [2022-07-21 05:18:45,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 05:18:45,910 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 6 states have internal predecessors, (89), 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 112 [2022-07-21 05:18:45,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:18:45,920 INFO L225 Difference]: With dead ends: 4352 [2022-07-21 05:18:45,920 INFO L226 Difference]: Without dead ends: 2774 [2022-07-21 05:18:45,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-07-21 05:18:45,924 INFO L413 NwaCegarLoop]: 570 mSDtfsCounter, 788 mSDsluCounter, 1912 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 791 SdHoareTripleChecker+Valid, 2482 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 05:18:45,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [791 Valid, 2482 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 05:18:45,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2774 states. [2022-07-21 05:18:46,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2774 to 1936. [2022-07-21 05:18:46,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1936 states, 1498 states have (on average 1.3190921228304406) internal successors, (1976), 1518 states have internal predecessors, (1976), 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) [2022-07-21 05:18:46,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1936 states to 1936 states and 2536 transitions. [2022-07-21 05:18:46,098 INFO L78 Accepts]: Start accepts. Automaton has 1936 states and 2536 transitions. Word has length 112 [2022-07-21 05:18:46,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:18:46,098 INFO L495 AbstractCegarLoop]: Abstraction has 1936 states and 2536 transitions. [2022-07-21 05:18:46,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 6 states have internal predecessors, (89), 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) [2022-07-21 05:18:46,112 INFO L276 IsEmpty]: Start isEmpty. Operand 1936 states and 2536 transitions. [2022-07-21 05:18:46,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-07-21 05:18:46,113 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:18:46,113 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:18:46,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-21 05:18:46,114 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:18:46,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:18:46,114 INFO L85 PathProgramCache]: Analyzing trace with hash 540191593, now seen corresponding path program 1 times [2022-07-21 05:18:46,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:18:46,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838773297] [2022-07-21 05:18:46,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:18:46,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:18:46,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:46,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 05:18:46,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:46,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 05:18:46,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:46,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 05:18:46,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:46,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 05:18:46,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:46,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 05:18:46,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:46,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-21 05:18:46,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:46,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-21 05:18:46,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:46,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-21 05:18:46,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:46,191 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-21 05:18:46,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:18:46,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838773297] [2022-07-21 05:18:46,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838773297] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:18:46,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 05:18:46,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 05:18:46,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111884884] [2022-07-21 05:18:46,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:18:46,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 05:18:46,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:18:46,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 05:18:46,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 05:18:46,195 INFO L87 Difference]: Start difference. First operand 1936 states and 2536 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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) [2022-07-21 05:18:46,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:18:46,514 INFO L93 Difference]: Finished difference Result 5122 states and 6787 transitions. [2022-07-21 05:18:46,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 05:18:46,515 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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 113 [2022-07-21 05:18:46,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:18:46,526 INFO L225 Difference]: With dead ends: 5122 [2022-07-21 05:18:46,526 INFO L226 Difference]: Without dead ends: 3560 [2022-07-21 05:18:46,529 INFO L412 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 [2022-07-21 05:18:46,530 INFO L413 NwaCegarLoop]: 519 mSDtfsCounter, 481 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 1275 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 05:18:46,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 1275 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 05:18:46,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3560 states. [2022-07-21 05:18:46,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3560 to 2987. [2022-07-21 05:18:46,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2987 states, 2274 states have (on average 1.3153034300791557) internal successors, (2991), 2305 states have internal predecessors, (2991), 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) [2022-07-21 05:18:46,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2987 states to 2987 states and 3911 transitions. [2022-07-21 05:18:46,778 INFO L78 Accepts]: Start accepts. Automaton has 2987 states and 3911 transitions. Word has length 113 [2022-07-21 05:18:46,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:18:46,778 INFO L495 AbstractCegarLoop]: Abstraction has 2987 states and 3911 transitions. [2022-07-21 05:18:46,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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) [2022-07-21 05:18:46,779 INFO L276 IsEmpty]: Start isEmpty. Operand 2987 states and 3911 transitions. [2022-07-21 05:18:46,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-07-21 05:18:46,780 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:18:46,780 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:18:46,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-21 05:18:46,781 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:18:46,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:18:46,781 INFO L85 PathProgramCache]: Analyzing trace with hash -290051495, now seen corresponding path program 1 times [2022-07-21 05:18:46,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:18:46,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239899465] [2022-07-21 05:18:46,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:18:46,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:18:46,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:46,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 05:18:46,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:46,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 05:18:46,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:46,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 05:18:46,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:46,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 05:18:46,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:46,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-21 05:18:46,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:46,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 05:18:46,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:46,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-21 05:18:46,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:46,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-21 05:18:46,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:46,828 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-21 05:18:46,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:18:46,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239899465] [2022-07-21 05:18:46,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239899465] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:18:46,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 05:18:46,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 05:18:46,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859594239] [2022-07-21 05:18:46,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:18:46,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 05:18:46,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:18:46,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 05:18:46,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 05:18:46,830 INFO L87 Difference]: Start difference. First operand 2987 states and 3911 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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) [2022-07-21 05:18:47,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:18:47,214 INFO L93 Difference]: Finished difference Result 7078 states and 9333 transitions. [2022-07-21 05:18:47,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 05:18:47,216 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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 113 [2022-07-21 05:18:47,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:18:47,232 INFO L225 Difference]: With dead ends: 7078 [2022-07-21 05:18:47,233 INFO L226 Difference]: Without dead ends: 4591 [2022-07-21 05:18:47,240 INFO L412 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 [2022-07-21 05:18:47,241 INFO L413 NwaCegarLoop]: 543 mSDtfsCounter, 428 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 1272 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 05:18:47,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 1272 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 05:18:47,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4591 states. [2022-07-21 05:18:47,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4591 to 4255. [2022-07-21 05:18:47,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4255 states, 3218 states have (on average 1.3132380360472342) internal successors, (4226), 3262 states have internal predecessors, (4226), 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) [2022-07-21 05:18:47,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4255 states to 4255 states and 5570 transitions. [2022-07-21 05:18:47,555 INFO L78 Accepts]: Start accepts. Automaton has 4255 states and 5570 transitions. Word has length 113 [2022-07-21 05:18:47,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:18:47,555 INFO L495 AbstractCegarLoop]: Abstraction has 4255 states and 5570 transitions. [2022-07-21 05:18:47,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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) [2022-07-21 05:18:47,556 INFO L276 IsEmpty]: Start isEmpty. Operand 4255 states and 5570 transitions. [2022-07-21 05:18:47,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-21 05:18:47,557 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:18:47,558 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:18:47,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-21 05:18:47,558 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:18:47,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:18:47,558 INFO L85 PathProgramCache]: Analyzing trace with hash 725293879, now seen corresponding path program 1 times [2022-07-21 05:18:47,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:18:47,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727386082] [2022-07-21 05:18:47,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:18:47,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:18:47,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:47,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 05:18:47,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:47,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 05:18:47,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:47,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-21 05:18:47,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:47,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-21 05:18:47,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:47,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-21 05:18:47,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:47,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 05:18:47,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:47,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-21 05:18:47,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:47,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-21 05:18:47,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:47,588 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-21 05:18:47,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:18:47,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727386082] [2022-07-21 05:18:47,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727386082] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:18:47,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 05:18:47,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 05:18:47,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009276806] [2022-07-21 05:18:47,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:18:47,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 05:18:47,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:18:47,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 05:18:47,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 05:18:47,590 INFO L87 Difference]: Start difference. First operand 4255 states and 5570 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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) [2022-07-21 05:18:48,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:18:48,078 INFO L93 Difference]: Finished difference Result 9626 states and 13040 transitions. [2022-07-21 05:18:48,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 05:18:48,079 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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 114 [2022-07-21 05:18:48,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:18:48,096 INFO L225 Difference]: With dead ends: 9626 [2022-07-21 05:18:48,097 INFO L226 Difference]: Without dead ends: 5764 [2022-07-21 05:18:48,105 INFO L412 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 [2022-07-21 05:18:48,105 INFO L413 NwaCegarLoop]: 452 mSDtfsCounter, 148 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 05:18:48,106 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 696 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 05:18:48,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5764 states. [2022-07-21 05:18:48,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5764 to 4261. [2022-07-21 05:18:48,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4261 states, 3224 states have (on average 1.3126550868486353) internal successors, (4232), 3268 states have internal predecessors, (4232), 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) [2022-07-21 05:18:48,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4261 states to 4261 states and 5576 transitions. [2022-07-21 05:18:48,514 INFO L78 Accepts]: Start accepts. Automaton has 4261 states and 5576 transitions. Word has length 114 [2022-07-21 05:18:48,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:18:48,515 INFO L495 AbstractCegarLoop]: Abstraction has 4261 states and 5576 transitions. [2022-07-21 05:18:48,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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) [2022-07-21 05:18:48,515 INFO L276 IsEmpty]: Start isEmpty. Operand 4261 states and 5576 transitions. [2022-07-21 05:18:48,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-07-21 05:18:48,517 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:18:48,518 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:18:48,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-21 05:18:48,518 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:18:48,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:18:48,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1766585516, now seen corresponding path program 1 times [2022-07-21 05:18:48,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:18:48,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099246171] [2022-07-21 05:18:48,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:18:48,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:18:48,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:48,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 05:18:48,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:48,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 05:18:48,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:48,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 05:18:48,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:48,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 05:18:48,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:48,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-21 05:18:48,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:48,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 05:18:48,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:48,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-21 05:18:48,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:48,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-21 05:18:48,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:48,573 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-21 05:18:48,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:18:48,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099246171] [2022-07-21 05:18:48,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099246171] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:18:48,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 05:18:48,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 05:18:48,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286041540] [2022-07-21 05:18:48,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:18:48,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 05:18:48,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:18:48,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 05:18:48,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 05:18:48,576 INFO L87 Difference]: Start difference. First operand 4261 states and 5576 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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) [2022-07-21 05:18:49,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:18:49,071 INFO L93 Difference]: Finished difference Result 8938 states and 11948 transitions. [2022-07-21 05:18:49,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 05:18:49,072 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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 115 [2022-07-21 05:18:49,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:18:49,086 INFO L225 Difference]: With dead ends: 8938 [2022-07-21 05:18:49,087 INFO L226 Difference]: Without dead ends: 4770 [2022-07-21 05:18:49,098 INFO L412 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 [2022-07-21 05:18:49,099 INFO L413 NwaCegarLoop]: 329 mSDtfsCounter, 356 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 05:18:49,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 870 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 05:18:49,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4770 states. [2022-07-21 05:18:49,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4770 to 3836. [2022-07-21 05:18:49,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3836 states, 2882 states have (on average 1.3178348369188064) internal successors, (3798), 2916 states have internal predecessors, (3798), 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) [2022-07-21 05:18:49,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3836 states to 3836 states and 5038 transitions. [2022-07-21 05:18:49,412 INFO L78 Accepts]: Start accepts. Automaton has 3836 states and 5038 transitions. Word has length 115 [2022-07-21 05:18:49,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:18:49,412 INFO L495 AbstractCegarLoop]: Abstraction has 3836 states and 5038 transitions. [2022-07-21 05:18:49,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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) [2022-07-21 05:18:49,413 INFO L276 IsEmpty]: Start isEmpty. Operand 3836 states and 5038 transitions. [2022-07-21 05:18:49,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-07-21 05:18:49,414 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:18:49,414 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:18:49,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-21 05:18:49,414 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:18:49,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:18:49,415 INFO L85 PathProgramCache]: Analyzing trace with hash -723784830, now seen corresponding path program 1 times [2022-07-21 05:18:49,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:18:49,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479106968] [2022-07-21 05:18:49,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:18:49,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:18:49,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:49,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 05:18:49,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:49,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 05:18:49,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:49,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-21 05:18:49,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:49,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-21 05:18:49,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:49,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-21 05:18:49,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:49,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 05:18:49,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:49,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-21 05:18:49,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:49,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-21 05:18:49,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:49,454 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-21 05:18:49,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:18:49,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479106968] [2022-07-21 05:18:49,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479106968] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:18:49,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 05:18:49,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 05:18:49,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563160581] [2022-07-21 05:18:49,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:18:49,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 05:18:49,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:18:49,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 05:18:49,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 05:18:49,456 INFO L87 Difference]: Start difference. First operand 3836 states and 5038 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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) [2022-07-21 05:18:49,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:18:49,891 INFO L93 Difference]: Finished difference Result 8444 states and 11382 transitions. [2022-07-21 05:18:49,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 05:18:49,891 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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 116 [2022-07-21 05:18:49,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:18:49,904 INFO L225 Difference]: With dead ends: 8444 [2022-07-21 05:18:49,904 INFO L226 Difference]: Without dead ends: 4815 [2022-07-21 05:18:49,911 INFO L412 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 [2022-07-21 05:18:49,912 INFO L413 NwaCegarLoop]: 432 mSDtfsCounter, 148 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 05:18:49,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 674 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 05:18:49,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4815 states. [2022-07-21 05:18:50,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4815 to 3846. [2022-07-21 05:18:50,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3846 states, 2892 states have (on average 1.3167358229598893) internal successors, (3808), 2926 states have internal predecessors, (3808), 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) [2022-07-21 05:18:50,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3846 states to 3846 states and 5048 transitions. [2022-07-21 05:18:50,215 INFO L78 Accepts]: Start accepts. Automaton has 3846 states and 5048 transitions. Word has length 116 [2022-07-21 05:18:50,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:18:50,215 INFO L495 AbstractCegarLoop]: Abstraction has 3846 states and 5048 transitions. [2022-07-21 05:18:50,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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) [2022-07-21 05:18:50,218 INFO L276 IsEmpty]: Start isEmpty. Operand 3846 states and 5048 transitions. [2022-07-21 05:18:50,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-07-21 05:18:50,220 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:18:50,220 INFO L195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:18:50,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-21 05:18:50,220 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:18:50,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:18:50,221 INFO L85 PathProgramCache]: Analyzing trace with hash -440834179, now seen corresponding path program 1 times [2022-07-21 05:18:50,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:18:50,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601268699] [2022-07-21 05:18:50,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:18:50,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:18:50,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:50,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 05:18:50,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:50,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 05:18:50,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:50,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-21 05:18:50,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:50,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-21 05:18:50,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:50,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-21 05:18:50,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:50,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 05:18:50,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:50,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-21 05:18:50,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:50,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-21 05:18:50,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:50,279 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-21 05:18:50,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:18:50,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601268699] [2022-07-21 05:18:50,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601268699] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:18:50,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 05:18:50,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 05:18:50,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056025477] [2022-07-21 05:18:50,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:18:50,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 05:18:50,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:18:50,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 05:18:50,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 05:18:50,282 INFO L87 Difference]: Start difference. First operand 3846 states and 5048 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 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) [2022-07-21 05:18:50,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:18:50,705 INFO L93 Difference]: Finished difference Result 8395 states and 11302 transitions. [2022-07-21 05:18:50,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 05:18:50,706 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 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 116 [2022-07-21 05:18:50,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:18:50,719 INFO L225 Difference]: With dead ends: 8395 [2022-07-21 05:18:50,720 INFO L226 Difference]: Without dead ends: 4691 [2022-07-21 05:18:50,726 INFO L412 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 [2022-07-21 05:18:50,727 INFO L413 NwaCegarLoop]: 354 mSDtfsCounter, 271 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 901 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 05:18:50,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 901 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 05:18:50,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4691 states. [2022-07-21 05:18:50,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4691 to 2895. [2022-07-21 05:18:50,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2895 states, 2175 states have (on average 1.3066666666666666) internal successors, (2842), 2194 states have internal predecessors, (2842), 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) [2022-07-21 05:18:50,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2895 states to 2895 states and 3780 transitions. [2022-07-21 05:18:50,991 INFO L78 Accepts]: Start accepts. Automaton has 2895 states and 3780 transitions. Word has length 116 [2022-07-21 05:18:50,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:18:50,991 INFO L495 AbstractCegarLoop]: Abstraction has 2895 states and 3780 transitions. [2022-07-21 05:18:50,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 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) [2022-07-21 05:18:50,992 INFO L276 IsEmpty]: Start isEmpty. Operand 2895 states and 3780 transitions. [2022-07-21 05:18:50,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2022-07-21 05:18:50,996 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:18:50,997 INFO L195 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, 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] [2022-07-21 05:18:50,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-21 05:18:50,998 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:18:50,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:18:50,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1943845531, now seen corresponding path program 1 times [2022-07-21 05:18:50,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:18:50,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756640898] [2022-07-21 05:18:50,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:18:50,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:18:51,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:51,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 05:18:51,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:51,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 05:18:51,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:51,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 05:18:51,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:51,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-21 05:18:51,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:51,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 05:18:51,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:51,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 05:18:51,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:51,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-21 05:18:51,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:51,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-21 05:18:51,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:51,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-21 05:18:51,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:51,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-21 05:18:51,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:51,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-21 05:18:51,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:51,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-21 05:18:51,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:51,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-21 05:18:51,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:51,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-21 05:18:51,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:51,132 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 16 proven. 28 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-07-21 05:18:51,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:18:51,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756640898] [2022-07-21 05:18:51,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756640898] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:18:51,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217182206] [2022-07-21 05:18:51,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:18:51,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:18:51,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:18:51,134 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) [2022-07-21 05:18:51,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-21 05:18:51,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:51,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 745 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-21 05:18:51,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:18:51,603 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 77 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-21 05:18:51,603 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 05:18:51,748 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 44 proven. 2 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-07-21 05:18:51,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [217182206] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 05:18:51,749 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 05:18:51,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-07-21 05:18:51,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582066082] [2022-07-21 05:18:51,749 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 05:18:51,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-21 05:18:51,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:18:51,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-21 05:18:51,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-07-21 05:18:51,751 INFO L87 Difference]: Start difference. First operand 2895 states and 3780 transitions. Second operand has 14 states, 14 states have (on average 18.571428571428573) internal successors, (260), 13 states have internal predecessors, (260), 6 states have call successors, (37), 4 states have call predecessors, (37), 6 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) [2022-07-21 05:18:55,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:18:55,126 INFO L93 Difference]: Finished difference Result 9922 states and 13848 transitions. [2022-07-21 05:18:55,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-07-21 05:18:55,126 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 18.571428571428573) internal successors, (260), 13 states have internal predecessors, (260), 6 states have call successors, (37), 4 states have call predecessors, (37), 6 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) Word has length 184 [2022-07-21 05:18:55,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:18:55,148 INFO L225 Difference]: With dead ends: 9922 [2022-07-21 05:18:55,149 INFO L226 Difference]: Without dead ends: 7306 [2022-07-21 05:18:55,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 464 GetRequests, 400 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1358 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=749, Invalid=3411, Unknown=0, NotChecked=0, Total=4160 [2022-07-21 05:18:55,155 INFO L413 NwaCegarLoop]: 334 mSDtfsCounter, 4409 mSDsluCounter, 2924 mSDsCounter, 0 mSdLazyCounter, 2010 mSolverCounterSat, 1308 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4409 SdHoareTripleChecker+Valid, 3258 SdHoareTripleChecker+Invalid, 3318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1308 IncrementalHoareTripleChecker+Valid, 2010 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-21 05:18:55,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4409 Valid, 3258 Invalid, 3318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1308 Valid, 2010 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-21 05:18:55,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7306 states. [2022-07-21 05:18:55,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7306 to 3419. [2022-07-21 05:18:55,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3419 states, 2592 states have (on average 1.3036265432098766) internal successors, (3379), 2612 states have internal predecessors, (3379), 531 states have call successors, (531), 295 states have call predecessors, (531), 295 states have return successors, (531), 511 states have call predecessors, (531), 531 states have call successors, (531) [2022-07-21 05:18:55,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3419 states to 3419 states and 4441 transitions. [2022-07-21 05:18:55,546 INFO L78 Accepts]: Start accepts. Automaton has 3419 states and 4441 transitions. Word has length 184 [2022-07-21 05:18:55,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:18:55,546 INFO L495 AbstractCegarLoop]: Abstraction has 3419 states and 4441 transitions. [2022-07-21 05:18:55,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 18.571428571428573) internal successors, (260), 13 states have internal predecessors, (260), 6 states have call successors, (37), 4 states have call predecessors, (37), 6 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) [2022-07-21 05:18:55,547 INFO L276 IsEmpty]: Start isEmpty. Operand 3419 states and 4441 transitions. [2022-07-21 05:18:55,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2022-07-21 05:18:55,552 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:18:55,553 INFO L195 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, 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] [2022-07-21 05:18:55,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-21 05:18:55,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-07-21 05:18:55,780 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:18:55,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:18:55,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1757506182, now seen corresponding path program 1 times [2022-07-21 05:18:55,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:18:55,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069215421] [2022-07-21 05:18:55,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:18:55,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:18:55,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:55,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 05:18:55,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:55,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 05:18:55,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:55,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 05:18:55,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:55,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-21 05:18:55,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:55,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 05:18:55,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:55,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 05:18:55,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:55,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-21 05:18:55,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:55,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-21 05:18:55,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:55,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-21 05:18:55,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:55,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-21 05:18:55,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:55,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-21 05:18:55,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:55,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-21 05:18:55,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:55,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-21 05:18:55,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:55,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-21 05:18:55,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:55,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-21 05:18:55,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:55,925 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 16 proven. 23 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2022-07-21 05:18:55,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:18:55,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069215421] [2022-07-21 05:18:55,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069215421] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:18:55,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161006924] [2022-07-21 05:18:55,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:18:55,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:18:55,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:18:55,927 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) [2022-07-21 05:18:55,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-21 05:18:56,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:18:56,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-21 05:18:56,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:18:56,370 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 36 proven. 53 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-21 05:18:56,370 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 05:18:56,523 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 15 proven. 26 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-07-21 05:18:56,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [161006924] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 05:18:56,524 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 05:18:56,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2022-07-21 05:18:56,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338185841] [2022-07-21 05:18:56,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 05:18:56,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-21 05:18:56,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:18:56,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-21 05:18:56,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2022-07-21 05:18:56,526 INFO L87 Difference]: Start difference. First operand 3419 states and 4441 transitions. Second operand has 16 states, 16 states have (on average 16.375) internal successors, (262), 14 states have internal predecessors, (262), 6 states have call successors, (43), 4 states have call predecessors, (43), 7 states have return successors, (42), 8 states have call predecessors, (42), 6 states have call successors, (42) [2022-07-21 05:19:04,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:19:04,382 INFO L93 Difference]: Finished difference Result 17212 states and 23325 transitions. [2022-07-21 05:19:04,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2022-07-21 05:19:04,382 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 16.375) internal successors, (262), 14 states have internal predecessors, (262), 6 states have call successors, (43), 4 states have call predecessors, (43), 7 states have return successors, (42), 8 states have call predecessors, (42), 6 states have call successors, (42) Word has length 192 [2022-07-21 05:19:04,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:19:04,424 INFO L225 Difference]: With dead ends: 17212 [2022-07-21 05:19:04,425 INFO L226 Difference]: Without dead ends: 14081 [2022-07-21 05:19:04,437 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 590 GetRequests, 472 SyntacticMatches, 1 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5045 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1835, Invalid=12207, Unknown=0, NotChecked=0, Total=14042 [2022-07-21 05:19:04,437 INFO L413 NwaCegarLoop]: 1788 mSDtfsCounter, 5757 mSDsluCounter, 13477 mSDsCounter, 0 mSdLazyCounter, 5456 mSolverCounterSat, 3537 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5757 SdHoareTripleChecker+Valid, 15265 SdHoareTripleChecker+Invalid, 8993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3537 IncrementalHoareTripleChecker+Valid, 5456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-21 05:19:04,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5757 Valid, 15265 Invalid, 8993 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3537 Valid, 5456 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-07-21 05:19:04,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14081 states. [2022-07-21 05:19:05,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14081 to 6242. [2022-07-21 05:19:05,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6242 states, 4698 states have (on average 1.3018305661983822) internal successors, (6116), 4736 states have internal predecessors, (6116), 992 states have call successors, (992), 551 states have call predecessors, (992), 551 states have return successors, (992), 954 states have call predecessors, (992), 992 states have call successors, (992) [2022-07-21 05:19:05,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6242 states to 6242 states and 8100 transitions. [2022-07-21 05:19:05,223 INFO L78 Accepts]: Start accepts. Automaton has 6242 states and 8100 transitions. Word has length 192 [2022-07-21 05:19:05,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:19:05,223 INFO L495 AbstractCegarLoop]: Abstraction has 6242 states and 8100 transitions. [2022-07-21 05:19:05,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 16.375) internal successors, (262), 14 states have internal predecessors, (262), 6 states have call successors, (43), 4 states have call predecessors, (43), 7 states have return successors, (42), 8 states have call predecessors, (42), 6 states have call successors, (42) [2022-07-21 05:19:05,224 INFO L276 IsEmpty]: Start isEmpty. Operand 6242 states and 8100 transitions. [2022-07-21 05:19:05,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-07-21 05:19:05,233 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:19:05,233 INFO L195 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, 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] [2022-07-21 05:19:05,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-21 05:19:05,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-07-21 05:19:05,442 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:19:05,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:19:05,443 INFO L85 PathProgramCache]: Analyzing trace with hash 2073750461, now seen corresponding path program 1 times [2022-07-21 05:19:05,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:19:05,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658004704] [2022-07-21 05:19:05,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:19:05,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:19:05,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:05,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 05:19:05,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:05,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 05:19:05,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:05,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 05:19:05,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:05,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 05:19:05,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:05,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 05:19:05,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:05,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-21 05:19:05,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:05,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 05:19:05,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:05,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-21 05:19:05,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:05,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 05:19:05,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:05,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-21 05:19:05,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:05,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-21 05:19:05,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:05,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-21 05:19:05,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:05,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-21 05:19:05,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:05,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-21 05:19:05,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:05,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-21 05:19:05,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:05,531 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-07-21 05:19:05,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:19:05,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658004704] [2022-07-21 05:19:05,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658004704] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:19:05,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 05:19:05,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 05:19:05,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722538069] [2022-07-21 05:19:05,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:19:05,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 05:19:05,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:19:05,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 05:19:05,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 05:19:05,534 INFO L87 Difference]: Start difference. First operand 6242 states and 8100 transitions. Second operand has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 6 states have internal predecessors, (115), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-21 05:19:07,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:19:07,477 INFO L93 Difference]: Finished difference Result 20990 states and 27898 transitions. [2022-07-21 05:19:07,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-21 05:19:07,477 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 6 states have internal predecessors, (115), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 194 [2022-07-21 05:19:07,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:19:07,517 INFO L225 Difference]: With dead ends: 20990 [2022-07-21 05:19:07,517 INFO L226 Difference]: Without dead ends: 15098 [2022-07-21 05:19:07,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-07-21 05:19:07,532 INFO L413 NwaCegarLoop]: 566 mSDtfsCounter, 801 mSDsluCounter, 2482 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 820 SdHoareTripleChecker+Valid, 3048 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 05:19:07,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [820 Valid, 3048 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 05:19:07,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15098 states. [2022-07-21 05:19:08,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15098 to 8084. [2022-07-21 05:19:08,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8084 states, 6028 states have (on average 1.3012607830126077) internal successors, (7844), 6079 states have internal predecessors, (7844), 1335 states have call successors, (1335), 720 states have call predecessors, (1335), 720 states have return successors, (1335), 1284 states have call predecessors, (1335), 1335 states have call successors, (1335) [2022-07-21 05:19:08,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8084 states to 8084 states and 10514 transitions. [2022-07-21 05:19:08,447 INFO L78 Accepts]: Start accepts. Automaton has 8084 states and 10514 transitions. Word has length 194 [2022-07-21 05:19:08,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:19:08,448 INFO L495 AbstractCegarLoop]: Abstraction has 8084 states and 10514 transitions. [2022-07-21 05:19:08,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 6 states have internal predecessors, (115), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-21 05:19:08,448 INFO L276 IsEmpty]: Start isEmpty. Operand 8084 states and 10514 transitions. [2022-07-21 05:19:08,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2022-07-21 05:19:08,459 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:19:08,459 INFO L195 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, 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] [2022-07-21 05:19:08,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-21 05:19:08,459 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:19:08,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:19:08,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1452894841, now seen corresponding path program 1 times [2022-07-21 05:19:08,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:19:08,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384955917] [2022-07-21 05:19:08,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:19:08,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:19:08,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:08,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 05:19:08,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:08,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 05:19:08,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:08,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 05:19:08,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:08,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 05:19:08,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:08,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 05:19:08,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:08,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-21 05:19:08,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:08,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 05:19:08,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:08,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-21 05:19:08,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:08,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 05:19:08,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:08,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-21 05:19:08,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:08,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-21 05:19:08,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:08,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-21 05:19:08,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:08,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-21 05:19:08,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:08,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-21 05:19:08,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:08,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-21 05:19:08,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:08,603 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 35 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-07-21 05:19:08,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:19:08,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384955917] [2022-07-21 05:19:08,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384955917] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:19:08,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123218772] [2022-07-21 05:19:08,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:19:08,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:19:08,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:19:08,605 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) [2022-07-21 05:19:08,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-21 05:19:08,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:08,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 792 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-21 05:19:08,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:19:08,801 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 49 proven. 6 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-07-21 05:19:08,802 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 05:19:08,866 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-07-21 05:19:08,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123218772] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-21 05:19:08,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-21 05:19:08,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 7] total 13 [2022-07-21 05:19:08,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469245878] [2022-07-21 05:19:08,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:19:08,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 05:19:08,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:19:08,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 05:19:08,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-07-21 05:19:08,869 INFO L87 Difference]: Start difference. First operand 8084 states and 10514 transitions. Second operand has 5 states, 4 states have (on average 27.75) internal successors, (111), 5 states have internal predecessors, (111), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2022-07-21 05:19:09,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:19:09,442 INFO L93 Difference]: Finished difference Result 13320 states and 17375 transitions. [2022-07-21 05:19:09,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 05:19:09,443 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 27.75) internal successors, (111), 5 states have internal predecessors, (111), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 195 [2022-07-21 05:19:09,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:19:09,454 INFO L225 Difference]: With dead ends: 13320 [2022-07-21 05:19:09,455 INFO L226 Difference]: Without dead ends: 5440 [2022-07-21 05:19:09,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 414 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-07-21 05:19:09,464 INFO L413 NwaCegarLoop]: 289 mSDtfsCounter, 2 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 05:19:09,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 858 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 05:19:09,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5440 states. [2022-07-21 05:19:09,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5440 to 5440. [2022-07-21 05:19:09,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5440 states, 4058 states have (on average 1.3013799901429275) internal successors, (5281), 4092 states have internal predecessors, (5281), 901 states have call successors, (901), 480 states have call predecessors, (901), 480 states have return successors, (901), 867 states have call predecessors, (901), 901 states have call successors, (901) [2022-07-21 05:19:09,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5440 states to 5440 states and 7083 transitions. [2022-07-21 05:19:10,001 INFO L78 Accepts]: Start accepts. Automaton has 5440 states and 7083 transitions. Word has length 195 [2022-07-21 05:19:10,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:19:10,001 INFO L495 AbstractCegarLoop]: Abstraction has 5440 states and 7083 transitions. [2022-07-21 05:19:10,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 27.75) internal successors, (111), 5 states have internal predecessors, (111), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2022-07-21 05:19:10,002 INFO L276 IsEmpty]: Start isEmpty. Operand 5440 states and 7083 transitions. [2022-07-21 05:19:10,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2022-07-21 05:19:10,010 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:19:10,010 INFO L195 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:19:10,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-21 05:19:10,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:19:10,227 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:19:10,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:19:10,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1119904118, now seen corresponding path program 1 times [2022-07-21 05:19:10,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:19:10,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789161353] [2022-07-21 05:19:10,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:19:10,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:19:10,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:10,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 05:19:10,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:10,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 05:19:10,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:10,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 05:19:10,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:10,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 05:19:10,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:10,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 05:19:10,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:10,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-21 05:19:10,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:10,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 05:19:10,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:10,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-21 05:19:10,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:10,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 05:19:10,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:10,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-21 05:19:10,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:10,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-21 05:19:10,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:10,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-21 05:19:10,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:10,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-21 05:19:10,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:10,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-21 05:19:10,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:10,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-21 05:19:10,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:10,381 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 24 proven. 9 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-07-21 05:19:10,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:19:10,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789161353] [2022-07-21 05:19:10,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789161353] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:19:10,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1276001650] [2022-07-21 05:19:10,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:19:10,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:19:10,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:19:10,384 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) [2022-07-21 05:19:10,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-21 05:19:10,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:10,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-21 05:19:10,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:19:10,660 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 51 proven. 4 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-21 05:19:10,660 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 05:19:10,761 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 28 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-07-21 05:19:10,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1276001650] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 05:19:10,762 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 05:19:10,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 17 [2022-07-21 05:19:10,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106625885] [2022-07-21 05:19:10,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 05:19:10,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-21 05:19:10,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:19:10,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-21 05:19:10,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2022-07-21 05:19:10,764 INFO L87 Difference]: Start difference. First operand 5440 states and 7083 transitions. Second operand has 17 states, 17 states have (on average 14.352941176470589) internal successors, (244), 16 states have internal predecessors, (244), 6 states have call successors, (37), 4 states have call predecessors, (37), 6 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) [2022-07-21 05:19:14,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:19:14,943 INFO L93 Difference]: Finished difference Result 15340 states and 20999 transitions. [2022-07-21 05:19:14,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-07-21 05:19:14,944 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 14.352941176470589) internal successors, (244), 16 states have internal predecessors, (244), 6 states have call successors, (37), 4 states have call predecessors, (37), 6 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) Word has length 195 [2022-07-21 05:19:14,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:19:14,968 INFO L225 Difference]: With dead ends: 15340 [2022-07-21 05:19:14,968 INFO L226 Difference]: Without dead ends: 10105 [2022-07-21 05:19:14,976 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 489 GetRequests, 421 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1413 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=662, Invalid=4168, Unknown=0, NotChecked=0, Total=4830 [2022-07-21 05:19:14,977 INFO L413 NwaCegarLoop]: 562 mSDtfsCounter, 3192 mSDsluCounter, 5425 mSDsCounter, 0 mSdLazyCounter, 3848 mSolverCounterSat, 1184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3192 SdHoareTripleChecker+Valid, 5987 SdHoareTripleChecker+Invalid, 5032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1184 IncrementalHoareTripleChecker+Valid, 3848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-21 05:19:14,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3192 Valid, 5987 Invalid, 5032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1184 Valid, 3848 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-07-21 05:19:14,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10105 states. [2022-07-21 05:19:15,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10105 to 6038. [2022-07-21 05:19:15,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6038 states, 4502 states have (on average 1.2972012438916036) internal successors, (5840), 4540 states have internal predecessors, (5840), 998 states have call successors, (998), 537 states have call predecessors, (998), 537 states have return successors, (998), 960 states have call predecessors, (998), 998 states have call successors, (998) [2022-07-21 05:19:15,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6038 states to 6038 states and 7836 transitions. [2022-07-21 05:19:15,762 INFO L78 Accepts]: Start accepts. Automaton has 6038 states and 7836 transitions. Word has length 195 [2022-07-21 05:19:15,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:19:15,762 INFO L495 AbstractCegarLoop]: Abstraction has 6038 states and 7836 transitions. [2022-07-21 05:19:15,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 14.352941176470589) internal successors, (244), 16 states have internal predecessors, (244), 6 states have call successors, (37), 4 states have call predecessors, (37), 6 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) [2022-07-21 05:19:15,762 INFO L276 IsEmpty]: Start isEmpty. Operand 6038 states and 7836 transitions. [2022-07-21 05:19:15,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2022-07-21 05:19:15,770 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:19:15,771 INFO L195 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, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:19:15,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-21 05:19:15,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:19:15,989 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:19:15,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:19:15,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1845710140, now seen corresponding path program 1 times [2022-07-21 05:19:15,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:19:15,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989552029] [2022-07-21 05:19:15,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:19:15,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:19:16,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:16,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 05:19:16,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:16,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 05:19:16,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:16,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 05:19:16,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:16,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 05:19:16,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:16,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 05:19:16,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:16,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-21 05:19:16,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:16,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 05:19:16,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:16,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-21 05:19:16,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:16,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-21 05:19:16,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:16,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-21 05:19:16,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:16,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-21 05:19:16,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:16,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-21 05:19:16,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:16,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-21 05:19:16,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:16,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-21 05:19:16,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:16,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-21 05:19:16,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:16,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-21 05:19:16,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:16,077 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2022-07-21 05:19:16,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:19:16,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989552029] [2022-07-21 05:19:16,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989552029] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:19:16,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 05:19:16,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 05:19:16,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957240114] [2022-07-21 05:19:16,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:19:16,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 05:19:16,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:19:16,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 05:19:16,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-21 05:19:16,079 INFO L87 Difference]: Start difference. First operand 6038 states and 7836 transitions. Second operand has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-21 05:19:16,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:19:16,789 INFO L93 Difference]: Finished difference Result 11521 states and 15006 transitions. [2022-07-21 05:19:16,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 05:19:16,790 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 203 [2022-07-21 05:19:16,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:19:16,802 INFO L225 Difference]: With dead ends: 11521 [2022-07-21 05:19:16,802 INFO L226 Difference]: Without dead ends: 5677 [2022-07-21 05:19:16,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-21 05:19:16,812 INFO L413 NwaCegarLoop]: 253 mSDtfsCounter, 449 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 05:19:16,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 438 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 05:19:16,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5677 states. [2022-07-21 05:19:17,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5677 to 5677. [2022-07-21 05:19:17,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5677 states, 4235 states have (on average 1.298229043683589) internal successors, (5498), 4271 states have internal predecessors, (5498), 938 states have call successors, (938), 503 states have call predecessors, (938), 503 states have return successors, (938), 902 states have call predecessors, (938), 938 states have call successors, (938) [2022-07-21 05:19:17,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5677 states to 5677 states and 7374 transitions. [2022-07-21 05:19:17,443 INFO L78 Accepts]: Start accepts. Automaton has 5677 states and 7374 transitions. Word has length 203 [2022-07-21 05:19:17,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:19:17,444 INFO L495 AbstractCegarLoop]: Abstraction has 5677 states and 7374 transitions. [2022-07-21 05:19:17,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-21 05:19:17,444 INFO L276 IsEmpty]: Start isEmpty. Operand 5677 states and 7374 transitions. [2022-07-21 05:19:17,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2022-07-21 05:19:17,450 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:19:17,450 INFO L195 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, 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] [2022-07-21 05:19:17,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-21 05:19:17,450 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:19:17,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:19:17,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1739070418, now seen corresponding path program 1 times [2022-07-21 05:19:17,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:19:17,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169094026] [2022-07-21 05:19:17,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:19:17,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:19:17,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:17,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 05:19:17,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:17,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 05:19:17,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:17,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 05:19:17,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:17,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 05:19:17,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:17,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 05:19:17,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:17,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-21 05:19:17,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:17,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 05:19:17,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:17,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-21 05:19:17,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:17,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-21 05:19:17,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:17,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-21 05:19:17,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:17,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-21 05:19:17,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:17,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-21 05:19:17,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:17,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-07-21 05:19:17,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:17,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-21 05:19:17,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:17,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-07-21 05:19:17,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:17,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-07-21 05:19:17,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:17,594 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 28 proven. 19 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-07-21 05:19:17,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:19:17,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169094026] [2022-07-21 05:19:17,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169094026] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 05:19:17,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [414328271] [2022-07-21 05:19:17,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:19:17,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 05:19:17,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 05:19:17,596 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) [2022-07-21 05:19:17,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-21 05:19:17,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:17,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 837 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-21 05:19:17,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 05:19:17,882 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 80 proven. 4 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-21 05:19:17,883 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 05:19:18,025 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 42 proven. 6 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-07-21 05:19:18,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [414328271] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 05:19:18,025 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 05:19:18,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 17 [2022-07-21 05:19:18,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308976376] [2022-07-21 05:19:18,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 05:19:18,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-21 05:19:18,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:19:18,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-21 05:19:18,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2022-07-21 05:19:18,027 INFO L87 Difference]: Start difference. First operand 5677 states and 7374 transitions. Second operand has 17 states, 17 states have (on average 15.411764705882353) internal successors, (262), 16 states have internal predecessors, (262), 6 states have call successors, (40), 4 states have call predecessors, (40), 6 states have return successors, (40), 7 states have call predecessors, (40), 6 states have call successors, (40) [2022-07-21 05:19:23,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:19:23,569 INFO L93 Difference]: Finished difference Result 16844 states and 23130 transitions. [2022-07-21 05:19:23,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-07-21 05:19:23,570 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 15.411764705882353) internal successors, (262), 16 states have internal predecessors, (262), 6 states have call successors, (40), 4 states have call predecessors, (40), 6 states have return successors, (40), 7 states have call predecessors, (40), 6 states have call successors, (40) Word has length 204 [2022-07-21 05:19:23,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:19:23,597 INFO L225 Difference]: With dead ends: 16844 [2022-07-21 05:19:23,597 INFO L226 Difference]: Without dead ends: 11372 [2022-07-21 05:19:23,606 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 521 GetRequests, 441 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2055 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=886, Invalid=5594, Unknown=0, NotChecked=0, Total=6480 [2022-07-21 05:19:23,607 INFO L413 NwaCegarLoop]: 631 mSDtfsCounter, 2973 mSDsluCounter, 6247 mSDsCounter, 0 mSdLazyCounter, 5201 mSolverCounterSat, 1461 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2973 SdHoareTripleChecker+Valid, 6878 SdHoareTripleChecker+Invalid, 6662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1461 IncrementalHoareTripleChecker+Valid, 5201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-07-21 05:19:23,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2973 Valid, 6878 Invalid, 6662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1461 Valid, 5201 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-07-21 05:19:23,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11372 states. [2022-07-21 05:19:24,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11372 to 6321. [2022-07-21 05:19:24,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6321 states, 4723 states have (on average 1.2945161973322041) internal successors, (6114), 4763 states have internal predecessors, (6114), 1036 states have call successors, (1036), 561 states have call predecessors, (1036), 561 states have return successors, (1036), 996 states have call predecessors, (1036), 1036 states have call successors, (1036) [2022-07-21 05:19:24,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6321 states to 6321 states and 8186 transitions. [2022-07-21 05:19:24,530 INFO L78 Accepts]: Start accepts. Automaton has 6321 states and 8186 transitions. Word has length 204 [2022-07-21 05:19:24,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:19:24,531 INFO L495 AbstractCegarLoop]: Abstraction has 6321 states and 8186 transitions. [2022-07-21 05:19:24,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 15.411764705882353) internal successors, (262), 16 states have internal predecessors, (262), 6 states have call successors, (40), 4 states have call predecessors, (40), 6 states have return successors, (40), 7 states have call predecessors, (40), 6 states have call successors, (40) [2022-07-21 05:19:24,531 INFO L276 IsEmpty]: Start isEmpty. Operand 6321 states and 8186 transitions. [2022-07-21 05:19:24,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2022-07-21 05:19:24,540 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:19:24,540 INFO L195 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, 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] [2022-07-21 05:19:24,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-21 05:19:24,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-07-21 05:19:24,758 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:19:24,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:19:24,759 INFO L85 PathProgramCache]: Analyzing trace with hash 2074523146, now seen corresponding path program 1 times [2022-07-21 05:19:24,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:19:24,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089700344] [2022-07-21 05:19:24,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:19:24,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:19:24,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:24,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 05:19:24,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:24,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 05:19:24,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:24,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 05:19:24,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:24,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 05:19:24,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:24,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 05:19:24,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:24,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-21 05:19:24,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:24,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-21 05:19:24,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:24,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-21 05:19:24,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:24,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-21 05:19:24,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:24,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-21 05:19:24,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:24,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-21 05:19:24,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:24,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-21 05:19:24,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:24,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-21 05:19:24,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:24,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-21 05:19:24,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:24,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-21 05:19:24,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:24,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-21 05:19:24,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:24,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-07-21 05:19:24,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 05:19:24,812 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-07-21 05:19:24,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 05:19:24,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089700344] [2022-07-21 05:19:24,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089700344] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 05:19:24,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 05:19:24,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 05:19:24,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314664529] [2022-07-21 05:19:24,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 05:19:24,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 05:19:24,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 05:19:24,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 05:19:24,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-21 05:19:24,815 INFO L87 Difference]: Start difference. First operand 6321 states and 8186 transitions. Second operand has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-21 05:19:25,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 05:19:25,573 INFO L93 Difference]: Finished difference Result 11879 states and 15447 transitions. [2022-07-21 05:19:25,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 05:19:25,575 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 211 [2022-07-21 05:19:25,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 05:19:25,587 INFO L225 Difference]: With dead ends: 11879 [2022-07-21 05:19:25,588 INFO L226 Difference]: Without dead ends: 5754 [2022-07-21 05:19:25,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-21 05:19:25,603 INFO L413 NwaCegarLoop]: 261 mSDtfsCounter, 233 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 05:19:25,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 484 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 05:19:25,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5754 states. [2022-07-21 05:19:26,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5754 to 5746. [2022-07-21 05:19:26,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5746 states, 4302 states have (on average 1.294746629474663) internal successors, (5570), 4338 states have internal predecessors, (5570), 939 states have call successors, (939), 504 states have call predecessors, (939), 504 states have return successors, (939), 903 states have call predecessors, (939), 939 states have call successors, (939) [2022-07-21 05:19:26,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5746 states to 5746 states and 7448 transitions. [2022-07-21 05:19:26,350 INFO L78 Accepts]: Start accepts. Automaton has 5746 states and 7448 transitions. Word has length 211 [2022-07-21 05:19:26,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 05:19:26,351 INFO L495 AbstractCegarLoop]: Abstraction has 5746 states and 7448 transitions. [2022-07-21 05:19:26,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-21 05:19:26,351 INFO L276 IsEmpty]: Start isEmpty. Operand 5746 states and 7448 transitions. [2022-07-21 05:19:26,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2022-07-21 05:19:26,358 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 05:19:26,359 INFO L195 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 05:19:26,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-07-21 05:19:26,359 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 05:19:26,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 05:19:26,359 INFO L85 PathProgramCache]: Analyzing trace with hash 13361221, now seen corresponding path program 1 times [2022-07-21 05:19:26,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 05:19:26,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978156635] [2022-07-21 05:19:26,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 05:19:26,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 05:19:26,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 05:19:26,409 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-21 05:19:26,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 05:19:26,521 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-21 05:19:26,521 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-21 05:19:26,522 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-21 05:19:26,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-07-21 05:19:26,526 INFO L356 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] [2022-07-21 05:19:26,530 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-21 05:19:26,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 05:19:26 BoogieIcfgContainer [2022-07-21 05:19:26,699 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-21 05:19:26,700 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-21 05:19:26,700 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-21 05:19:26,700 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-21 05:19:26,701 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:18:38" (3/4) ... [2022-07-21 05:19:26,702 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-21 05:19:26,852 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-21 05:19:26,853 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-21 05:19:26,853 INFO L158 Benchmark]: Toolchain (without parser) took 48950.64ms. Allocated memory was 54.5MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 32.2MB in the beginning and 1.2GB in the end (delta: -1.2GB). Peak memory consumption was 845.6MB. Max. memory is 16.1GB. [2022-07-21 05:19:26,853 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 54.5MB. Free memory was 36.1MB in the beginning and 36.0MB in the end (delta: 44.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 05:19:26,855 INFO L158 Benchmark]: CACSL2BoogieTranslator took 373.86ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 32.0MB in the beginning and 43.7MB in the end (delta: -11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-21 05:19:26,860 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.42ms. Allocated memory is still 67.1MB. Free memory was 43.5MB in the beginning and 40.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-21 05:19:26,861 INFO L158 Benchmark]: Boogie Preprocessor took 54.90ms. Allocated memory is still 67.1MB. Free memory was 40.2MB in the beginning and 37.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 05:19:26,862 INFO L158 Benchmark]: RCFGBuilder took 581.87ms. Allocated memory is still 67.1MB. Free memory was 37.9MB in the beginning and 44.0MB in the end (delta: -6.1MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. [2022-07-21 05:19:26,862 INFO L158 Benchmark]: TraceAbstraction took 47708.80ms. Allocated memory was 67.1MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 43.4MB in the beginning and 1.2GB in the end (delta: -1.2GB). Peak memory consumption was 807.2MB. Max. memory is 16.1GB. [2022-07-21 05:19:26,863 INFO L158 Benchmark]: Witness Printer took 152.66ms. Allocated memory is still 2.1GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 34.6MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2022-07-21 05:19:26,864 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.40ms. Allocated memory is still 54.5MB. Free memory was 36.1MB in the beginning and 36.0MB in the end (delta: 44.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 373.86ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 32.0MB in the beginning and 43.7MB in the end (delta: -11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.42ms. Allocated memory is still 67.1MB. Free memory was 43.5MB in the beginning and 40.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.90ms. Allocated memory is still 67.1MB. Free memory was 40.2MB in the beginning and 37.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 581.87ms. Allocated memory is still 67.1MB. Free memory was 37.9MB in the beginning and 44.0MB in the end (delta: -6.1MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. * TraceAbstraction took 47708.80ms. Allocated memory was 67.1MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 43.4MB in the beginning and 1.2GB in the end (delta: -1.2GB). Peak memory consumption was 807.2MB. Max. memory is 16.1GB. * Witness Printer took 152.66ms. Allocated memory is still 2.1GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 34.6MB). Peak memory consumption was 35.7MB. 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: 611]: 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 ; VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=0, 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, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [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, side1_written=0, side1Failed_History_0=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, side1_written=0, side1Failed_History_0=0, side2_written=0, side2Failed_History_0=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, side1_written=0, side1Failed_History_0=0, side2_written=0, side2Failed_History_0=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, side1_written=0, side1Failed_History_0=0, side2_written=0, side2Failed_History_0=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, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side2_written=0, side2Failed_History_0=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, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=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, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=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, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=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, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=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, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=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, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=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, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=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, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L58] COND FALSE !(!cond) VAL [\old(cond)=1, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cond=1, 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, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L556] RET assume_abort_if_not(i2) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, c1=0, 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, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=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, c1=0, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, i2=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L574] COND TRUE i2 < 10 [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 VAL [\old(val)=-128, 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=-128, 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_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=-128] [L257] RET write_manual_selection_history(manual_selection) [L258] EXPR manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new 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=-128, manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new=-128, manual_selection_History_0=-128, 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_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-128] [L258] cs1_new = manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [L259] EXPR manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-128, manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new=-128, manual_selection_History_0=-128, 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_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-128] [L259] cs2_new = manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L260] manual_selection = (msg_t )0 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=0, manual_selection_History_0=-128, 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_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-128] [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 VAL [\old(val)=-255, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, 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_written=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=-255] [L276] RET write_side1_failed_history(side1Failed) [L277] COND TRUE \read(side1Failed) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=0, manual_selection_History_0=-128, 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, side1_written=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L278] EXPR nomsg != nomsg && s1s1_new == nomsg ? nomsg : s1s1_new VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=0, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, nomsg != nomsg && s1s1_new == nomsg ? nomsg : s1s1_new=-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, side1_written=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L278] s1s1_new = nomsg != nomsg && s1s1_new == nomsg ? nomsg : s1s1_new [L279] EXPR nomsg != nomsg && s1s2_new == nomsg ? nomsg : s1s2_new VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=0, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, nomsg != nomsg && s1s2_new == nomsg ? nomsg : s1s2_new=-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, side1_written=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L279] s1s2_new = nomsg != nomsg && s1s2_new == nomsg ? nomsg : s1s2_new [L280] EXPR nomsg != nomsg && s1p_new == nomsg ? nomsg : s1p_new VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=0, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, nomsg != nomsg && s1p_new == nomsg ? nomsg : s1p_new=-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, side1_written=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=0, manual_selection_History_0=-128, 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, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=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 VAL [\old(val)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, 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_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=0] [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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-128, 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, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-128, 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, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L371] EXPR next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, next_state=0, next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new=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, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L371] s2s1_new = next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new [L372] EXPR next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, next_state=0, next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new=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=0, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L372] s2s2_new = next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new [L373] EXPR next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, next_state=0, next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new=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=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-128, 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=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, 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_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, 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_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, index=0, manual_selection_History_0=-128, 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_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_active_side_history((unsigned char)0)=-2, 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_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=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=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, 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, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L394] COND FALSE !((int )side1 == 1) VAL [active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, 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, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L397] COND FALSE !((int )side2 == 1) VAL [active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, 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, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, 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, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [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 VAL [\old(val)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, 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_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=0] [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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L58] COND FALSE !(!cond) VAL [\old(cond)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cond=1, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=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=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, 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, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=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=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, 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, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_manual_selection_history((unsigned char)1)=0, 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, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0] [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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=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=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, 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, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=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=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, 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, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side1_failed_history((unsigned char)1)=0, 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, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0] [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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0] [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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L88] COND TRUE (int )index == 0 [L89] return (side1Failed_History_0); VAL [\old(index)=0, \result=-255, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=0, manual_selection_History_0=-128, 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, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side1_failed_history((unsigned char)0)=-255, 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, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0] [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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=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=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, 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, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=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=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, 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, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side1_failed_history((unsigned char)1)=0, 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, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=1, tmp___7=0] [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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=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=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, 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, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=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=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, 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, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side1_failed_history((unsigned char)1)=0, 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, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=1, tmp___7=0] [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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___2=1, tmp___7=0] [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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=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=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, 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, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=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=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, 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, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side2_failed_history((unsigned char)1)=0, 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, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___2=1, tmp___7=0] [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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___12=0, tmp___2=1, tmp___7=0] [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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=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=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=2, manual_selection_History_0=-128, 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, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=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=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=2, manual_selection_History_0=-128, 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, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=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=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=2, manual_selection_History_0=-128, 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, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_active_side_history((unsigned char)2)=-2, 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, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___12=0, tmp___2=1, tmp___7=0] [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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___12=0, tmp___2=1, tmp___20=-2, tmp___7=0] [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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___12=0, tmp___2=1, tmp___20=-2, tmp___7=0] [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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L609] COND FALSE !(! arg) VAL [\old(arg)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, arg=1, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=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=-128, cs2=0, cs2_new=-1, cs2_old=-128, i2=0, manual_selection_History_0=-128, 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, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L598] i2 ++ 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, i2=1, manual_selection_History_0=-128, 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, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L574] COND TRUE i2 < 10 [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 VAL [\old(val)=-128, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, 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, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=-128] [L257] RET write_manual_selection_history(manual_selection) [L258] EXPR manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection=-128, manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, 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, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-128] [L258] cs1_new = manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [L259] EXPR manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection=-128, manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, 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, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-128] [L259] cs2_new = manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L260] manual_selection = (msg_t )0 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-128, cs2=0, cs2_new=-128, cs2_old=-128, manual_selection=0, manual_selection_History_0=-128, manual_selection_History_1=-128, 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, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-128] [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 VAL [\old(val)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-128, cs2=0, cs2_new=-128, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, 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, side1_written=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=0] [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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-128, manual_selection=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, 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, side1_written=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-128, manual_selection=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, 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, side1_written=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-128, manual_selection=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, 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, side1_written=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-128, manual_selection=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, 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, side1_written=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L314] EXPR next_state != nomsg && s1s1_new == nomsg ? next_state : s1s1_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-128, manual_selection=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, next_state=0, next_state != nomsg && s1s1_new == nomsg ? next_state : s1s1_new=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, side1_written=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L314] s1s1_new = next_state != nomsg && s1s1_new == nomsg ? next_state : s1s1_new [L315] EXPR next_state != nomsg && s1s2_new == nomsg ? next_state : s1s2_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-128, manual_selection=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, next_state=0, next_state != nomsg && s1s2_new == nomsg ? next_state : s1s2_new=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=0, 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, side1_written=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L315] s1s2_new = next_state != nomsg && s1s2_new == nomsg ? next_state : s1s2_new [L316] EXPR next_state != nomsg && s1p_new == nomsg ? next_state : s1p_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-128, manual_selection=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, next_state=0, next_state != nomsg && s1p_new == nomsg ? next_state : s1p_new=0, nomsg=-1, s1p=0, s1p_new=-1, 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, side1_written=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-128, manual_selection=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, next_state=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, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=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 VAL [\old(val)=257, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, 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_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, val=257] [L333] RET write_side2_failed_history(side2Failed) [L334] COND TRUE \read(side2Failed) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-128, manual_selection=0, manual_selection_History_0=-128, manual_selection_History_1=-128, 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, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L335] EXPR nomsg != nomsg && s2s1_new == nomsg ? nomsg : s2s1_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-128, manual_selection=0, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, nomsg != nomsg && s2s1_new == nomsg ? nomsg : s2s1_new=-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, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L335] s2s1_new = nomsg != nomsg && s2s1_new == nomsg ? nomsg : s2s1_new [L336] EXPR nomsg != nomsg && s2s2_new == nomsg ? nomsg : s2s2_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-128, manual_selection=0, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, nomsg != nomsg && s2s2_new == nomsg ? nomsg : s2s2_new=-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, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L336] s2s2_new = nomsg != nomsg && s2s2_new == nomsg ? nomsg : s2s2_new [L337] EXPR nomsg != nomsg && s2p_new == nomsg ? nomsg : s2p_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-128, manual_selection=0, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, nomsg != nomsg && s2p_new == nomsg ? nomsg : s2p_new=-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, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-128, manual_selection=0, manual_selection_History_0=-128, manual_selection_History_1=-128, 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, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=-1, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=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=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, 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_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, 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_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-128, index=0, manual_selection_History_0=-128, manual_selection_History_1=-128, 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_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, read_active_side_history((unsigned char)0)=0, 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_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=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=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, 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, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=0] [L394] COND FALSE !((int )side1 == 1) VAL [active_side=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, 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, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=0] [L397] COND FALSE !((int )side2 == 1) VAL [active_side=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, 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, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=0] [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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, 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, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=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 VAL [\old(val)=0, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, 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_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, val=0] [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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, 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, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, 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, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, 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, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L58] COND FALSE !(!cond) VAL [\old(cond)=1, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cond=1, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, 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, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, 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, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=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=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, 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, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [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=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=-128, 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, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L181] COND TRUE (int )index == 1 [L182] return (manual_selection_History_1); VAL [\old(index)=1, \result=-128, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=-128, 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, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, read_manual_selection_history((unsigned char)1)=-128, 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, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, 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, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=-128] [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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, 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, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [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=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=-128, 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, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [\old(index)=1, \result=-255, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=-128, 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, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, read_side1_failed_history((unsigned char)1)=-255, 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, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=-128] [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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, 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, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=-128, tmp___7=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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, 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, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [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=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=-128, 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, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=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=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=-128, 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, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, read_side2_failed_history((unsigned char)1)=0, 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, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=-128, tmp___7=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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, 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, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=-128, tmp___7=1, tmp___8=0] [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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, 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, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [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=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=0, manual_selection_History_0=-128, manual_selection_History_1=-128, 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, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, read_active_side_history((unsigned char)0)=0, 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, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=-128, tmp___7=1, tmp___8=0] [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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, 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, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=-128, tmp___5=0, tmp___7=1, tmp___8=0] [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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, 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, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L609] COND TRUE ! arg VAL [\old(arg)=0, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, arg=0, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, 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, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L611] reach_error() VAL [\old(arg)=0, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, arg=0, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, 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, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 205 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 47.5s, OverallIterations: 35, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 31.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 25866 SdHoareTripleChecker+Valid, 12.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 25651 mSDsluCounter, 67482 SdHoareTripleChecker+Invalid, 10.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 52911 mSDsCounter, 8497 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 19463 IncrementalHoareTripleChecker+Invalid, 27960 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8497 mSolverCounterUnsat, 14571 mSDtfsCounter, 19463 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3100 GetRequests, 2625 SyntacticMatches, 8 SemanticMatches, 467 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9937 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8084occurred in iteration=29, InterpolantAutomatonStates: 450, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.8s AutomataMinimizationTime, 34 MinimizatonAttempts, 38497 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 5170 NumberOfCodeBlocks, 5170 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 5884 ConstructedInterpolants, 0 QuantifiedInterpolants, 14152 SizeOfPredicates, 12 NumberOfNonLiveVariables, 3982 ConjunctsInSsa, 59 ConjunctsInUnsatCore, 44 InterpolantComputations, 30 PerfectInterpolantSequences, 1923/2111 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! [2022-07-21 05:19:26,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE