./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 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_2.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 cdd691469d2e12c2dd1871c48be4dd2db0b9d27541ac5dee5ff25a04db0d98eb --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 18:18:12,524 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 18:18:12,539 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 18:18:12,578 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 18:18:12,579 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 18:18:12,580 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 18:18:12,584 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 18:18:12,590 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 18:18:12,592 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 18:18:12,598 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 18:18:12,599 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 18:18:12,600 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 18:18:12,601 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 18:18:12,603 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 18:18:12,604 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 18:18:12,605 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 18:18:12,608 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 18:18:12,608 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 18:18:12,610 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 18:18:12,613 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 18:18:12,615 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 18:18:12,625 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 18:18:12,626 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 18:18:12,627 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 18:18:12,629 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 18:18:12,633 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 18:18:12,634 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 18:18:12,634 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 18:18:12,636 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 18:18:12,636 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 18:18:12,637 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 18:18:12,638 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 18:18:12,639 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 18:18:12,640 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 18:18:12,640 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 18:18:12,641 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 18:18:12,642 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 18:18:12,642 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 18:18:12,642 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 18:18:12,648 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 18:18:12,649 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 18:18:12,653 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 18:18:12,653 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 18:18:12,684 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 18:18:12,690 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 18:18:12,691 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 18:18:12,691 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 18:18:12,692 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 18:18:12,692 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 18:18:12,693 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 18:18:12,693 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 18:18:12,693 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 18:18:12,694 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 18:18:12,694 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 18:18:12,695 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 18:18:12,695 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 18:18:12,695 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 18:18:12,695 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 18:18:12,695 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 18:18:12,696 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 18:18:12,696 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 18:18:12,696 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 18:18:12,696 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 18:18:12,696 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 18:18:12,697 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 18:18:12,697 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 18:18:12,697 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 18:18:12,698 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 18:18:12,698 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 18:18:12,698 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 18:18:12,698 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 18:18:12,698 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 18:18:12,699 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 18:18:12,699 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 18:18:12,699 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 18:18:12,699 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 18:18:12,700 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 -> cdd691469d2e12c2dd1871c48be4dd2db0b9d27541ac5dee5ff25a04db0d98eb [2022-07-13 18:18:13,143 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 18:18:13,182 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 18:18:13,184 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 18:18:13,200 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 18:18:13,201 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 18:18:13,203 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_2.ufo.BOUNDED-10.pals.c [2022-07-13 18:18:13,313 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6e41c41c/f4606a89c20041ed8b2c82cde553fcfe/FLAG4578be7bb [2022-07-13 18:18:13,928 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 18:18:13,929 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c [2022-07-13 18:18:13,940 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6e41c41c/f4606a89c20041ed8b2c82cde553fcfe/FLAG4578be7bb [2022-07-13 18:18:14,228 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6e41c41c/f4606a89c20041ed8b2c82cde553fcfe [2022-07-13 18:18:14,231 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 18:18:14,233 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 18:18:14,234 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 18:18:14,235 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 18:18:14,237 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 18:18:14,238 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 06:18:14" (1/1) ... [2022-07-13 18:18:14,245 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7918128b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:18:14, skipping insertion in model container [2022-07-13 18:18:14,245 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 06:18:14" (1/1) ... [2022-07-13 18:18:14,258 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 18:18:14,319 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 18:18:14,673 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_2.ufo.BOUNDED-10.pals.c[14702,14715] [2022-07-13 18:18:14,685 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 18:18:14,697 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 18:18:14,790 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_2.ufo.BOUNDED-10.pals.c[14702,14715] [2022-07-13 18:18:14,828 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 18:18:14,849 INFO L208 MainTranslator]: Completed translation [2022-07-13 18:18:14,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:18:14 WrapperNode [2022-07-13 18:18:14,850 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 18:18:14,851 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 18:18:14,852 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 18:18:14,852 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 18:18:14,860 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:18:14" (1/1) ... [2022-07-13 18:18:14,876 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:18:14" (1/1) ... [2022-07-13 18:18:14,941 INFO L137 Inliner]: procedures = 32, calls = 48, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 538 [2022-07-13 18:18:14,947 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 18:18:14,954 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 18:18:14,954 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 18:18:14,954 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 18:18:14,983 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:18:14" (1/1) ... [2022-07-13 18:18:14,987 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:18:14" (1/1) ... [2022-07-13 18:18:14,992 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:18:14" (1/1) ... [2022-07-13 18:18:14,992 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:18:14" (1/1) ... [2022-07-13 18:18:15,029 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:18:14" (1/1) ... [2022-07-13 18:18:15,037 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:18:14" (1/1) ... [2022-07-13 18:18:15,043 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:18:14" (1/1) ... [2022-07-13 18:18:15,069 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 18:18:15,070 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 18:18:15,070 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 18:18:15,070 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 18:18:15,076 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:18:14" (1/1) ... [2022-07-13 18:18:15,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 18:18:15,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:18:15,129 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-13 18:18:15,155 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-13 18:18:15,193 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2022-07-13 18:18:15,207 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2022-07-13 18:18:15,207 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 18:18:15,208 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2022-07-13 18:18:15,208 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2022-07-13 18:18:15,208 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2022-07-13 18:18:15,208 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2022-07-13 18:18:15,208 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2022-07-13 18:18:15,209 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2022-07-13 18:18:15,209 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-13 18:18:15,209 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-13 18:18:15,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 18:18:15,210 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2022-07-13 18:18:15,210 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2022-07-13 18:18:15,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 18:18:15,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 18:18:15,210 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2022-07-13 18:18:15,211 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2022-07-13 18:18:15,396 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 18:18:15,398 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 18:18:16,065 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 18:18:16,086 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 18:18:16,086 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-13 18:18:16,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 06:18:16 BoogieIcfgContainer [2022-07-13 18:18:16,093 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 18:18:16,099 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 18:18:16,100 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 18:18:16,118 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 18:18:16,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 06:18:14" (1/3) ... [2022-07-13 18:18:16,120 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41121cec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 06:18:16, skipping insertion in model container [2022-07-13 18:18:16,120 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:18:14" (2/3) ... [2022-07-13 18:18:16,120 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41121cec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 06:18:16, skipping insertion in model container [2022-07-13 18:18:16,120 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 06:18:16" (3/3) ... [2022-07-13 18:18:16,121 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c [2022-07-13 18:18:16,134 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 18:18:16,134 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 18:18:16,214 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 18:18:16,227 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@24af5e3b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6f04a0b3 [2022-07-13 18:18:16,227 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 18:18:16,247 INFO L276 IsEmpty]: Start isEmpty. Operand has 207 states, 167 states have (on average 1.5508982035928143) internal successors, (259), 168 states have internal predecessors, (259), 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-13 18:18:16,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-13 18:18:16,263 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:18:16,264 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-13 18:18:16,265 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:18:16,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:18:16,280 INFO L85 PathProgramCache]: Analyzing trace with hash -518679476, now seen corresponding path program 1 times [2022-07-13 18:18:16,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:18:16,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22756156] [2022-07-13 18:18:16,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:18:16,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:18:16,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:16,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 18:18:16,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:16,635 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-13 18:18:16,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:18:16,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22756156] [2022-07-13 18:18:16,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22756156] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:18:16,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:18:16,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 18:18:16,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384996556] [2022-07-13 18:18:16,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:18:16,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 18:18:16,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:18:16,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 18:18:16,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 18:18:16,677 INFO L87 Difference]: Start difference. First operand has 207 states, 167 states have (on average 1.5508982035928143) internal successors, (259), 168 states have internal predecessors, (259), 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-13 18:18:16,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:18:16,764 INFO L93 Difference]: Finished difference Result 398 states and 642 transitions. [2022-07-13 18:18:16,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 18:18:16,767 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-13 18:18:16,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:18:16,783 INFO L225 Difference]: With dead ends: 398 [2022-07-13 18:18:16,783 INFO L226 Difference]: Without dead ends: 203 [2022-07-13 18:18:16,790 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-13 18:18:16,795 INFO L413 NwaCegarLoop]: 312 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, 312 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-13 18:18:16,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:18:16,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-07-13 18:18:16,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2022-07-13 18:18:16,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 164 states have (on average 1.5) internal successors, (246), 164 states have internal predecessors, (246), 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-13 18:18:16,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 308 transitions. [2022-07-13 18:18:16,924 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 308 transitions. Word has length 44 [2022-07-13 18:18:16,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:18:16,924 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 308 transitions. [2022-07-13 18:18:16,925 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-13 18:18:16,925 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 308 transitions. [2022-07-13 18:18:16,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-13 18:18:16,929 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:18:16,929 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-13 18:18:16,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 18:18:16,930 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:18:16,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:18:16,931 INFO L85 PathProgramCache]: Analyzing trace with hash -527444980, now seen corresponding path program 1 times [2022-07-13 18:18:16,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:18:16,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827730786] [2022-07-13 18:18:16,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:18:16,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:18:17,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:17,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 18:18:17,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:17,121 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-13 18:18:17,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:18:17,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827730786] [2022-07-13 18:18:17,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827730786] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:18:17,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:18:17,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 18:18:17,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712560986] [2022-07-13 18:18:17,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:18:17,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 18:18:17,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:18:17,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 18:18:17,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 18:18:17,126 INFO L87 Difference]: Start difference. First operand 203 states and 308 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-13 18:18:17,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:18:17,293 INFO L93 Difference]: Finished difference Result 531 states and 811 transitions. [2022-07-13 18:18:17,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 18:18:17,293 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-13 18:18:17,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:18:17,297 INFO L225 Difference]: With dead ends: 531 [2022-07-13 18:18:17,297 INFO L226 Difference]: Without dead ends: 342 [2022-07-13 18:18:17,298 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-13 18:18:17,299 INFO L413 NwaCegarLoop]: 327 mSDtfsCounter, 171 mSDsluCounter, 1257 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 1584 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-13 18:18:17,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 1584 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 18:18:17,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2022-07-13 18:18:17,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 203. [2022-07-13 18:18:17,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 164 states have (on average 1.4268292682926829) internal successors, (234), 164 states have internal predecessors, (234), 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-13 18:18:17,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 296 transitions. [2022-07-13 18:18:17,332 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 296 transitions. Word has length 44 [2022-07-13 18:18:17,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:18:17,332 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 296 transitions. [2022-07-13 18:18:17,332 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-13 18:18:17,333 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 296 transitions. [2022-07-13 18:18:17,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-13 18:18:17,334 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:18:17,334 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-13 18:18:17,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 18:18:17,335 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:18:17,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:18:17,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1202945359, now seen corresponding path program 1 times [2022-07-13 18:18:17,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:18:17,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131218493] [2022-07-13 18:18:17,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:18:17,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:18:17,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:17,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 18:18:17,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:17,618 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-13 18:18:17,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:18:17,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131218493] [2022-07-13 18:18:17,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131218493] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:18:17,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:18:17,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 18:18:17,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602857688] [2022-07-13 18:18:17,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:18:17,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 18:18:17,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:18:17,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 18:18:17,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 18:18:17,639 INFO L87 Difference]: Start difference. First operand 203 states and 296 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-13 18:18:17,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:18:17,761 INFO L93 Difference]: Finished difference Result 393 states and 582 transitions. [2022-07-13 18:18:17,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 18:18:17,762 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-13 18:18:17,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:18:17,764 INFO L225 Difference]: With dead ends: 393 [2022-07-13 18:18:17,765 INFO L226 Difference]: Without dead ends: 207 [2022-07-13 18:18:17,766 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-13 18:18:17,769 INFO L413 NwaCegarLoop]: 290 mSDtfsCounter, 5 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 860 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-13 18:18:17,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 860 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:18:17,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-07-13 18:18:17,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2022-07-13 18:18:17,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 167 states have (on average 1.4191616766467066) internal successors, (237), 167 states have internal predecessors, (237), 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-13 18:18:17,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 299 transitions. [2022-07-13 18:18:17,794 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 299 transitions. Word has length 55 [2022-07-13 18:18:17,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:18:17,794 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 299 transitions. [2022-07-13 18:18:17,794 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-13 18:18:17,795 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 299 transitions. [2022-07-13 18:18:17,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-13 18:18:17,803 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:18:17,804 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-13 18:18:17,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 18:18:17,804 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:18:17,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:18:17,805 INFO L85 PathProgramCache]: Analyzing trace with hash -915994749, now seen corresponding path program 1 times [2022-07-13 18:18:17,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:18:17,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199924641] [2022-07-13 18:18:17,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:18:17,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:18:17,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:17,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 18:18:17,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:17,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 18:18:17,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:17,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-13 18:18:17,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:17,961 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-13 18:18:17,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:18:17,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199924641] [2022-07-13 18:18:17,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199924641] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:18:17,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:18:17,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 18:18:17,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676992802] [2022-07-13 18:18:17,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:18:17,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 18:18:17,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:18:17,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 18:18:17,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 18:18:17,979 INFO L87 Difference]: Start difference. First operand 207 states and 299 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-13 18:18:18,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:18:18,045 INFO L93 Difference]: Finished difference Result 564 states and 826 transitions. [2022-07-13 18:18:18,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 18:18:18,051 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-13 18:18:18,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:18:18,054 INFO L225 Difference]: With dead ends: 564 [2022-07-13 18:18:18,055 INFO L226 Difference]: Without dead ends: 374 [2022-07-13 18:18:18,056 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-13 18:18:18,057 INFO L413 NwaCegarLoop]: 341 mSDtfsCounter, 227 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 622 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-13 18:18:18,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 622 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:18:18,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2022-07-13 18:18:18,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 364. [2022-07-13 18:18:18,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 287 states have (on average 1.4390243902439024) internal successors, (413), 288 states have internal predecessors, (413), 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-13 18:18:18,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 533 transitions. [2022-07-13 18:18:18,089 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 533 transitions. Word has length 71 [2022-07-13 18:18:18,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:18:18,089 INFO L495 AbstractCegarLoop]: Abstraction has 364 states and 533 transitions. [2022-07-13 18:18:18,090 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-13 18:18:18,090 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 533 transitions. [2022-07-13 18:18:18,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-13 18:18:18,091 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:18:18,091 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-13 18:18:18,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 18:18:18,092 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:18:18,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:18:18,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1756914315, now seen corresponding path program 1 times [2022-07-13 18:18:18,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:18:18,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107636675] [2022-07-13 18:18:18,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:18:18,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:18:18,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:18,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 18:18:18,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:18,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 18:18:18,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:18,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-13 18:18:18,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:18,153 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-13 18:18:18,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:18:18,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107636675] [2022-07-13 18:18:18,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107636675] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:18:18,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:18:18,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 18:18:18,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045049553] [2022-07-13 18:18:18,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:18:18,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 18:18:18,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:18:18,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 18:18:18,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 18:18:18,157 INFO L87 Difference]: Start difference. First operand 364 states and 533 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-13 18:18:18,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:18:18,231 INFO L93 Difference]: Finished difference Result 1009 states and 1492 transitions. [2022-07-13 18:18:18,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 18:18:18,251 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-13 18:18:18,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:18:18,256 INFO L225 Difference]: With dead ends: 1009 [2022-07-13 18:18:18,256 INFO L226 Difference]: Without dead ends: 662 [2022-07-13 18:18:18,258 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-13 18:18:18,258 INFO L413 NwaCegarLoop]: 374 mSDtfsCounter, 235 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 657 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-13 18:18:18,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 657 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:18:18,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2022-07-13 18:18:18,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 645. [2022-07-13 18:18:18,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 496 states have (on average 1.4576612903225807) internal successors, (723), 499 states have internal predecessors, (723), 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-13 18:18:18,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 957 transitions. [2022-07-13 18:18:18,328 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 957 transitions. Word has length 72 [2022-07-13 18:18:18,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:18:18,328 INFO L495 AbstractCegarLoop]: Abstraction has 645 states and 957 transitions. [2022-07-13 18:18:18,329 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-13 18:18:18,329 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 957 transitions. [2022-07-13 18:18:18,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-13 18:18:18,330 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:18:18,331 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-13 18:18:18,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 18:18:18,332 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:18:18,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:18:18,332 INFO L85 PathProgramCache]: Analyzing trace with hash 477050637, now seen corresponding path program 1 times [2022-07-13 18:18:18,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:18:18,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461362532] [2022-07-13 18:18:18,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:18:18,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:18:18,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:18,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 18:18:18,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:18,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 18:18:18,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:18,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-13 18:18:18,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:18,747 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-13 18:18:18,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:18:18,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461362532] [2022-07-13 18:18:18,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461362532] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:18:18,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:18:18,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 18:18:18,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061871457] [2022-07-13 18:18:18,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:18:18,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 18:18:18,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:18:18,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 18:18:18,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 18:18:18,753 INFO L87 Difference]: Start difference. First operand 645 states and 957 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-13 18:18:19,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:18:19,174 INFO L93 Difference]: Finished difference Result 1805 states and 2723 transitions. [2022-07-13 18:18:19,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 18:18:19,175 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-13 18:18:19,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:18:19,184 INFO L225 Difference]: With dead ends: 1805 [2022-07-13 18:18:19,185 INFO L226 Difference]: Without dead ends: 1177 [2022-07-13 18:18:19,187 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-13 18:18:19,189 INFO L413 NwaCegarLoop]: 289 mSDtfsCounter, 786 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 786 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 18:18:19,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [786 Valid, 778 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 18:18:19,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2022-07-13 18:18:19,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 770. [2022-07-13 18:18:19,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 770 states, 608 states have (on average 1.4358552631578947) internal successors, (873), 611 states have internal predecessors, (873), 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-13 18:18:19,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1121 transitions. [2022-07-13 18:18:19,266 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1121 transitions. Word has length 72 [2022-07-13 18:18:19,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:18:19,267 INFO L495 AbstractCegarLoop]: Abstraction has 770 states and 1121 transitions. [2022-07-13 18:18:19,267 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-13 18:18:19,268 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1121 transitions. [2022-07-13 18:18:19,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-07-13 18:18:19,269 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:18:19,269 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-13 18:18:19,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 18:18:19,270 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:18:19,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:18:19,271 INFO L85 PathProgramCache]: Analyzing trace with hash -221882142, now seen corresponding path program 1 times [2022-07-13 18:18:19,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:18:19,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583813212] [2022-07-13 18:18:19,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:18:19,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:18:19,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:19,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 18:18:19,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:19,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 18:18:19,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:19,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 18:18:19,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:19,337 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-13 18:18:19,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:18:19,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583813212] [2022-07-13 18:18:19,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583813212] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:18:19,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:18:19,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 18:18:19,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523849675] [2022-07-13 18:18:19,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:18:19,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 18:18:19,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:18:19,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 18:18:19,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 18:18:19,341 INFO L87 Difference]: Start difference. First operand 770 states and 1121 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-13 18:18:19,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:18:19,655 INFO L93 Difference]: Finished difference Result 1809 states and 2723 transitions. [2022-07-13 18:18:19,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 18:18:19,656 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-13 18:18:19,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:18:19,662 INFO L225 Difference]: With dead ends: 1809 [2022-07-13 18:18:19,662 INFO L226 Difference]: Without dead ends: 1181 [2022-07-13 18:18:19,665 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-13 18:18:19,665 INFO L413 NwaCegarLoop]: 289 mSDtfsCounter, 783 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 783 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 18:18:19,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [783 Valid, 780 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 18:18:19,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2022-07-13 18:18:19,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 778. [2022-07-13 18:18:19,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 778 states, 616 states have (on average 1.4301948051948052) internal successors, (881), 619 states have internal predecessors, (881), 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-13 18:18:19,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1129 transitions. [2022-07-13 18:18:19,740 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1129 transitions. Word has length 73 [2022-07-13 18:18:19,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:18:19,740 INFO L495 AbstractCegarLoop]: Abstraction has 778 states and 1129 transitions. [2022-07-13 18:18:19,741 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-13 18:18:19,741 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1129 transitions. [2022-07-13 18:18:19,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-07-13 18:18:19,742 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:18:19,742 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] [2022-07-13 18:18:19,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-13 18:18:19,742 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:18:19,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:18:19,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1379275244, now seen corresponding path program 1 times [2022-07-13 18:18:19,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:18:19,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429700707] [2022-07-13 18:18:19,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:18:19,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:18:19,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:19,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 18:18:19,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:19,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 18:18:19,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:19,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-13 18:18:19,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:19,837 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-13 18:18:19,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:18:19,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429700707] [2022-07-13 18:18:19,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429700707] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:18:19,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:18:19,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 18:18:19,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670275799] [2022-07-13 18:18:19,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:18:19,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 18:18:19,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:18:19,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 18:18:19,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 18:18:19,840 INFO L87 Difference]: Start difference. First operand 778 states and 1129 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 3 states have call successors, (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-13 18:18:20,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:18:20,190 INFO L93 Difference]: Finished difference Result 1809 states and 2715 transitions. [2022-07-13 18:18:20,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 18:18:20,191 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 3 states have call successors, (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 75 [2022-07-13 18:18:20,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:18:20,197 INFO L225 Difference]: With dead ends: 1809 [2022-07-13 18:18:20,198 INFO L226 Difference]: Without dead ends: 1181 [2022-07-13 18:18:20,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 18:18:20,201 INFO L413 NwaCegarLoop]: 315 mSDtfsCounter, 238 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 18:18:20,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 747 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 18:18:20,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2022-07-13 18:18:20,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 778. [2022-07-13 18:18:20,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 778 states, 616 states have (on average 1.4237012987012987) internal successors, (877), 619 states have internal predecessors, (877), 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-13 18:18:20,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1125 transitions. [2022-07-13 18:18:20,283 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1125 transitions. Word has length 75 [2022-07-13 18:18:20,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:18:20,284 INFO L495 AbstractCegarLoop]: Abstraction has 778 states and 1125 transitions. [2022-07-13 18:18:20,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 3 states have call successors, (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-13 18:18:20,284 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1125 transitions. [2022-07-13 18:18:20,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-13 18:18:20,286 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:18:20,286 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] [2022-07-13 18:18:20,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-13 18:18:20,286 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:18:20,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:18:20,287 INFO L85 PathProgramCache]: Analyzing trace with hash -156149797, now seen corresponding path program 1 times [2022-07-13 18:18:20,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:18:20,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697513471] [2022-07-13 18:18:20,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:18:20,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:18:20,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:20,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 18:18:20,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:20,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 18:18:20,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:20,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-13 18:18:20,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:20,397 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-13 18:18:20,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:18:20,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697513471] [2022-07-13 18:18:20,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697513471] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:18:20,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:18:20,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 18:18:20,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732480938] [2022-07-13 18:18:20,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:18:20,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 18:18:20,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:18:20,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 18:18:20,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 18:18:20,400 INFO L87 Difference]: Start difference. First operand 778 states and 1125 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 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-13 18:18:20,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:18:20,523 INFO L93 Difference]: Finished difference Result 1426 states and 2092 transitions. [2022-07-13 18:18:20,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 18:18:20,524 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 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 76 [2022-07-13 18:18:20,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:18:20,529 INFO L225 Difference]: With dead ends: 1426 [2022-07-13 18:18:20,543 INFO L226 Difference]: Without dead ends: 798 [2022-07-13 18:18:20,547 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-13 18:18:20,550 INFO L413 NwaCegarLoop]: 292 mSDtfsCounter, 6 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 872 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-13 18:18:20,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 872 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:18:20,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2022-07-13 18:18:20,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 798. [2022-07-13 18:18:20,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 632 states have (on average 1.4129746835443038) internal successors, (893), 635 states have internal predecessors, (893), 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-13 18:18:20,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1141 transitions. [2022-07-13 18:18:20,661 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 1141 transitions. Word has length 76 [2022-07-13 18:18:20,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:18:20,661 INFO L495 AbstractCegarLoop]: Abstraction has 798 states and 1141 transitions. [2022-07-13 18:18:20,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 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-13 18:18:20,662 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1141 transitions. [2022-07-13 18:18:20,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-13 18:18:20,663 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:18:20,663 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] [2022-07-13 18:18:20,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-13 18:18:20,664 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:18:20,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:18:20,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1992242591, now seen corresponding path program 1 times [2022-07-13 18:18:20,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:18:20,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803998558] [2022-07-13 18:18:20,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:18:20,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:18:20,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:20,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 18:18:20,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:20,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 18:18:20,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:20,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-13 18:18:20,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:20,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-13 18:18:20,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:20,883 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-13 18:18:20,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:18:20,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803998558] [2022-07-13 18:18:20,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803998558] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:18:20,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:18:20,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 18:18:20,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931176583] [2022-07-13 18:18:20,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:18:20,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 18:18:20,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:18:20,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 18:18:20,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 18:18:20,909 INFO L87 Difference]: Start difference. First operand 798 states and 1141 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 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-13 18:18:20,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:18:20,995 INFO L93 Difference]: Finished difference Result 1466 states and 2136 transitions. [2022-07-13 18:18:20,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 18:18:20,996 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 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 84 [2022-07-13 18:18:20,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:18:21,000 INFO L225 Difference]: With dead ends: 1466 [2022-07-13 18:18:21,002 INFO L226 Difference]: Without dead ends: 818 [2022-07-13 18:18:21,004 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 18:18:21,004 INFO L413 NwaCegarLoop]: 289 mSDtfsCounter, 6 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 858 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-13 18:18:21,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 858 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:18:21,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2022-07-13 18:18:21,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 818. [2022-07-13 18:18:21,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 648 states have (on average 1.4027777777777777) internal successors, (909), 651 states have internal predecessors, (909), 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-13 18:18:21,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1157 transitions. [2022-07-13 18:18:21,106 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1157 transitions. Word has length 84 [2022-07-13 18:18:21,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:18:21,107 INFO L495 AbstractCegarLoop]: Abstraction has 818 states and 1157 transitions. [2022-07-13 18:18:21,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 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-13 18:18:21,108 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1157 transitions. [2022-07-13 18:18:21,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-07-13 18:18:21,109 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:18:21,110 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, 1, 1] [2022-07-13 18:18:21,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-13 18:18:21,110 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:18:21,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:18:21,111 INFO L85 PathProgramCache]: Analyzing trace with hash -115565173, now seen corresponding path program 1 times [2022-07-13 18:18:21,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:18:21,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43640488] [2022-07-13 18:18:21,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:18:21,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:18:21,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:21,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 18:18:21,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:21,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 18:18:21,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:21,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-13 18:18:21,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:21,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-13 18:18:21,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:21,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-13 18:18:21,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:21,231 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-13 18:18:21,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:18:21,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43640488] [2022-07-13 18:18:21,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43640488] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:18:21,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:18:21,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 18:18:21,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86484669] [2022-07-13 18:18:21,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:18:21,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 18:18:21,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:18:21,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 18:18:21,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 18:18:21,234 INFO L87 Difference]: Start difference. First operand 818 states and 1157 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, (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-13 18:18:21,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:18:21,304 INFO L93 Difference]: Finished difference Result 1502 states and 2152 transitions. [2022-07-13 18:18:21,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 18:18:21,305 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, (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 92 [2022-07-13 18:18:21,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:18:21,310 INFO L225 Difference]: With dead ends: 1502 [2022-07-13 18:18:21,310 INFO L226 Difference]: Without dead ends: 834 [2022-07-13 18:18:21,312 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-13 18:18:21,313 INFO L413 NwaCegarLoop]: 294 mSDtfsCounter, 5 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 867 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-13 18:18:21,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 867 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:18:21,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2022-07-13 18:18:21,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 834. [2022-07-13 18:18:21,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 834 states, 660 states have (on average 1.3954545454545455) internal successors, (921), 663 states have internal predecessors, (921), 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-13 18:18:21,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1169 transitions. [2022-07-13 18:18:21,366 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1169 transitions. Word has length 92 [2022-07-13 18:18:21,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:18:21,366 INFO L495 AbstractCegarLoop]: Abstraction has 834 states and 1169 transitions. [2022-07-13 18:18:21,367 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, (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-13 18:18:21,367 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1169 transitions. [2022-07-13 18:18:21,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-07-13 18:18:21,369 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:18:21,370 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, 1, 1] [2022-07-13 18:18:21,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-13 18:18:21,370 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:18:21,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:18:21,371 INFO L85 PathProgramCache]: Analyzing trace with hash -2014073166, now seen corresponding path program 1 times [2022-07-13 18:18:21,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:18:21,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590712346] [2022-07-13 18:18:21,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:18:21,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:18:21,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:21,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 18:18:21,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:21,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 18:18:21,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:21,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-13 18:18:21,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:21,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-13 18:18:21,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:21,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-13 18:18:21,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:21,470 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-13 18:18:21,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:18:21,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590712346] [2022-07-13 18:18:21,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590712346] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:18:21,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:18:21,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 18:18:21,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801568304] [2022-07-13 18:18:21,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:18:21,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 18:18:21,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:18:21,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 18:18:21,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 18:18:21,473 INFO L87 Difference]: Start difference. First operand 834 states and 1169 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, (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-13 18:18:21,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:18:21,568 INFO L93 Difference]: Finished difference Result 1538 states and 2192 transitions. [2022-07-13 18:18:21,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 18:18:21,569 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, (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 92 [2022-07-13 18:18:21,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:18:21,573 INFO L225 Difference]: With dead ends: 1538 [2022-07-13 18:18:21,573 INFO L226 Difference]: Without dead ends: 854 [2022-07-13 18:18:21,575 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-13 18:18:21,576 INFO L413 NwaCegarLoop]: 289 mSDtfsCounter, 6 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 858 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-13 18:18:21,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 858 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:18:21,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2022-07-13 18:18:21,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 854. [2022-07-13 18:18:21,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 854 states, 676 states have (on average 1.386094674556213) internal successors, (937), 679 states have internal predecessors, (937), 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-13 18:18:21,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 1185 transitions. [2022-07-13 18:18:21,632 INFO L78 Accepts]: Start accepts. Automaton has 854 states and 1185 transitions. Word has length 92 [2022-07-13 18:18:21,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:18:21,633 INFO L495 AbstractCegarLoop]: Abstraction has 854 states and 1185 transitions. [2022-07-13 18:18:21,633 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, (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-13 18:18:21,633 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1185 transitions. [2022-07-13 18:18:21,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-13 18:18:21,635 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:18:21,635 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, 1, 1] [2022-07-13 18:18:21,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-13 18:18:21,636 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:18:21,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:18:21,636 INFO L85 PathProgramCache]: Analyzing trace with hash -794519374, now seen corresponding path program 1 times [2022-07-13 18:18:21,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:18:21,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429953314] [2022-07-13 18:18:21,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:18:21,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:18:21,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:21,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 18:18:21,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:21,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 18:18:21,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:21,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-13 18:18:21,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:21,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-13 18:18:21,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:21,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-13 18:18:21,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:21,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-13 18:18:21,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:21,735 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-13 18:18:21,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:18:21,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429953314] [2022-07-13 18:18:21,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429953314] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:18:21,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:18:21,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 18:18:21,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185590044] [2022-07-13 18:18:21,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:18:21,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 18:18:21,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:18:21,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 18:18:21,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 18:18:21,737 INFO L87 Difference]: Start difference. First operand 854 states and 1185 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 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-13 18:18:21,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:18:21,872 INFO L93 Difference]: Finished difference Result 1582 states and 2220 transitions. [2022-07-13 18:18:21,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 18:18:21,873 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 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 100 [2022-07-13 18:18:21,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:18:21,878 INFO L225 Difference]: With dead ends: 1582 [2022-07-13 18:18:21,878 INFO L226 Difference]: Without dead ends: 878 [2022-07-13 18:18:21,880 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-13 18:18:21,881 INFO L413 NwaCegarLoop]: 293 mSDtfsCounter, 7 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 869 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.1s IncrementalHoareTripleChecker+Time [2022-07-13 18:18:21,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 869 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 18:18:21,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2022-07-13 18:18:21,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 878. [2022-07-13 18:18:21,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 878 states, 696 states have (on average 1.375) internal successors, (957), 699 states have internal predecessors, (957), 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-13 18:18:21,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1205 transitions. [2022-07-13 18:18:21,991 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1205 transitions. Word has length 100 [2022-07-13 18:18:21,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:18:21,991 INFO L495 AbstractCegarLoop]: Abstraction has 878 states and 1205 transitions. [2022-07-13 18:18:21,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 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-13 18:18:21,992 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1205 transitions. [2022-07-13 18:18:21,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-07-13 18:18:21,998 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:18:21,998 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, 1, 1] [2022-07-13 18:18:21,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-13 18:18:21,999 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:18:21,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:18:21,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1401758325, now seen corresponding path program 1 times [2022-07-13 18:18:21,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:18:22,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765333420] [2022-07-13 18:18:22,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:18:22,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:18:22,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:22,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 18:18:22,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:22,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 18:18:22,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:22,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-13 18:18:22,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:22,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-13 18:18:22,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:22,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-13 18:18:22,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:22,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-13 18:18:22,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:22,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-13 18:18:22,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:22,136 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-13 18:18:22,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:18:22,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765333420] [2022-07-13 18:18:22,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765333420] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:18:22,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:18:22,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 18:18:22,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592129020] [2022-07-13 18:18:22,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:18:22,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 18:18:22,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:18:22,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 18:18:22,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 18:18:22,138 INFO L87 Difference]: Start difference. First operand 878 states and 1205 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, (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-13 18:18:22,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:18:22,446 INFO L93 Difference]: Finished difference Result 2499 states and 3487 transitions. [2022-07-13 18:18:22,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 18:18:22,447 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, (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 103 [2022-07-13 18:18:22,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:18:22,455 INFO L225 Difference]: With dead ends: 2499 [2022-07-13 18:18:22,455 INFO L226 Difference]: Without dead ends: 1771 [2022-07-13 18:18:22,457 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-13 18:18:22,457 INFO L413 NwaCegarLoop]: 419 mSDtfsCounter, 395 mSDsluCounter, 1893 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 2312 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.2s IncrementalHoareTripleChecker+Time [2022-07-13 18:18:22,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 2312 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 18:18:22,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1771 states. [2022-07-13 18:18:22,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1771 to 1162. [2022-07-13 18:18:22,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1162 states, 907 states have (on average 1.3660418963616316) internal successors, (1239), 912 states have internal predecessors, (1239), 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-13 18:18:22,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 1162 states and 1583 transitions. [2022-07-13 18:18:22,546 INFO L78 Accepts]: Start accepts. Automaton has 1162 states and 1583 transitions. Word has length 103 [2022-07-13 18:18:22,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:18:22,546 INFO L495 AbstractCegarLoop]: Abstraction has 1162 states and 1583 transitions. [2022-07-13 18:18:22,546 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, (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-13 18:18:22,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 1583 transitions. [2022-07-13 18:18:22,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-13 18:18:22,548 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:18:22,548 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] [2022-07-13 18:18:22,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-13 18:18:22,548 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:18:22,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:18:22,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1324741963, now seen corresponding path program 1 times [2022-07-13 18:18:22,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:18:22,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145462963] [2022-07-13 18:18:22,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:18:22,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:18:22,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:22,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 18:18:22,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:22,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 18:18:22,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:22,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-13 18:18:22,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:22,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-13 18:18:22,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:22,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-13 18:18:22,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:22,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-13 18:18:22,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:22,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-13 18:18:22,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:22,611 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-13 18:18:22,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:18:22,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145462963] [2022-07-13 18:18:22,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145462963] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:18:22,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:18:22,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 18:18:22,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174010856] [2022-07-13 18:18:22,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:18:22,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 18:18:22,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:18:22,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 18:18:22,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 18:18:22,613 INFO L87 Difference]: Start difference. First operand 1162 states and 1583 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 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-13 18:18:22,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:18:22,736 INFO L93 Difference]: Finished difference Result 2130 states and 2928 transitions. [2022-07-13 18:18:22,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 18:18:22,737 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 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 107 [2022-07-13 18:18:22,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:18:22,743 INFO L225 Difference]: With dead ends: 2130 [2022-07-13 18:18:22,744 INFO L226 Difference]: Without dead ends: 1186 [2022-07-13 18:18:22,747 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-13 18:18:22,747 INFO L413 NwaCegarLoop]: 294 mSDtfsCounter, 5 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 867 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-13 18:18:22,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 867 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:18:22,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2022-07-13 18:18:22,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 1186. [2022-07-13 18:18:22,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1186 states, 925 states have (on average 1.358918918918919) internal successors, (1257), 930 states have internal predecessors, (1257), 172 states have call successors, (172), 88 states have call predecessors, (172), 88 states have return successors, (172), 167 states have call predecessors, (172), 172 states have call successors, (172) [2022-07-13 18:18:22,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 1601 transitions. [2022-07-13 18:18:22,835 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 1601 transitions. Word has length 107 [2022-07-13 18:18:22,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:18:22,836 INFO L495 AbstractCegarLoop]: Abstraction has 1186 states and 1601 transitions. [2022-07-13 18:18:22,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 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-13 18:18:22,836 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 1601 transitions. [2022-07-13 18:18:22,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-13 18:18:22,838 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:18:22,838 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, 1, 1] [2022-07-13 18:18:22,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-13 18:18:22,838 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:18:22,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:18:22,839 INFO L85 PathProgramCache]: Analyzing trace with hash 682815691, now seen corresponding path program 1 times [2022-07-13 18:18:22,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:18:22,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071828034] [2022-07-13 18:18:22,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:18:22,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:18:22,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:22,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 18:18:22,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:22,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 18:18:22,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:22,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-13 18:18:22,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:22,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-13 18:18:22,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:22,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-13 18:18:22,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:22,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-13 18:18:22,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:22,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-13 18:18:22,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:22,925 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-13 18:18:22,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:18:22,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071828034] [2022-07-13 18:18:22,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071828034] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:18:22,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:18:22,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 18:18:22,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853947797] [2022-07-13 18:18:22,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:18:22,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 18:18:22,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:18:22,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 18:18:22,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 18:18:22,927 INFO L87 Difference]: Start difference. First operand 1186 states and 1601 transitions. Second operand has 6 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 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-13 18:18:23,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:18:23,115 INFO L93 Difference]: Finished difference Result 1659 states and 2347 transitions. [2022-07-13 18:18:23,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 18:18:23,116 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 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 106 [2022-07-13 18:18:23,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:18:23,124 INFO L225 Difference]: With dead ends: 1659 [2022-07-13 18:18:23,124 INFO L226 Difference]: Without dead ends: 1657 [2022-07-13 18:18:23,125 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-13 18:18:23,126 INFO L413 NwaCegarLoop]: 517 mSDtfsCounter, 263 mSDsluCounter, 1742 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 2259 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-13 18:18:23,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 2259 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:18:23,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1657 states. [2022-07-13 18:18:23,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1657 to 1194. [2022-07-13 18:18:23,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1194 states, 929 states have (on average 1.3573735199138859) internal successors, (1261), 936 states have internal predecessors, (1261), 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-13 18:18:23,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1194 states to 1194 states and 1609 transitions. [2022-07-13 18:18:23,231 INFO L78 Accepts]: Start accepts. Automaton has 1194 states and 1609 transitions. Word has length 106 [2022-07-13 18:18:23,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:18:23,232 INFO L495 AbstractCegarLoop]: Abstraction has 1194 states and 1609 transitions. [2022-07-13 18:18:23,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 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-13 18:18:23,232 INFO L276 IsEmpty]: Start isEmpty. Operand 1194 states and 1609 transitions. [2022-07-13 18:18:23,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-07-13 18:18:23,234 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:18:23,234 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, 1, 1] [2022-07-13 18:18:23,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-13 18:18:23,234 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:18:23,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:18:23,235 INFO L85 PathProgramCache]: Analyzing trace with hash -614162587, now seen corresponding path program 1 times [2022-07-13 18:18:23,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:18:23,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248665569] [2022-07-13 18:18:23,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:18:23,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:18:23,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:23,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 18:18:23,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:23,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 18:18:23,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:23,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-13 18:18:23,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:23,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-13 18:18:23,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:23,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-13 18:18:23,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:23,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-13 18:18:23,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:23,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-13 18:18:23,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:23,325 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-13 18:18:23,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:18:23,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248665569] [2022-07-13 18:18:23,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248665569] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:18:23,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:18:23,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 18:18:23,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225597053] [2022-07-13 18:18:23,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:18:23,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 18:18:23,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:18:23,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 18:18:23,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 18:18:23,329 INFO L87 Difference]: Start difference. First operand 1194 states and 1609 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 6 states have internal predecessors, (85), 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-13 18:18:24,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:18:24,470 INFO L93 Difference]: Finished difference Result 2456 states and 3370 transitions. [2022-07-13 18:18:24,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 18:18:24,471 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 6 states have internal predecessors, (85), 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 109 [2022-07-13 18:18:24,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:18:24,478 INFO L225 Difference]: With dead ends: 2456 [2022-07-13 18:18:24,479 INFO L226 Difference]: Without dead ends: 1562 [2022-07-13 18:18:24,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-07-13 18:18:24,482 INFO L413 NwaCegarLoop]: 412 mSDtfsCounter, 527 mSDsluCounter, 1863 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 2275 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.7s IncrementalHoareTripleChecker+Time [2022-07-13 18:18:24,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [532 Valid, 2275 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-13 18:18:24,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1562 states. [2022-07-13 18:18:24,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1562 to 1240. [2022-07-13 18:18:24,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1240 states, 986 states have (on average 1.3468559837728196) internal successors, (1328), 998 states have internal predecessors, (1328), 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-13 18:18:24,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1240 states to 1240 states and 1652 transitions. [2022-07-13 18:18:24,588 INFO L78 Accepts]: Start accepts. Automaton has 1240 states and 1652 transitions. Word has length 109 [2022-07-13 18:18:24,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:18:24,589 INFO L495 AbstractCegarLoop]: Abstraction has 1240 states and 1652 transitions. [2022-07-13 18:18:24,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 6 states have internal predecessors, (85), 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-13 18:18:24,589 INFO L276 IsEmpty]: Start isEmpty. Operand 1240 states and 1652 transitions. [2022-07-13 18:18:24,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-07-13 18:18:24,591 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:18:24,591 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, 1, 1] [2022-07-13 18:18:24,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-13 18:18:24,591 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:18:24,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:18:24,592 INFO L85 PathProgramCache]: Analyzing trace with hash 326540891, now seen corresponding path program 1 times [2022-07-13 18:18:24,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:18:24,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091141222] [2022-07-13 18:18:24,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:18:24,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:18:24,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:24,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 18:18:24,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:24,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 18:18:24,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:24,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-13 18:18:24,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:24,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-13 18:18:24,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:24,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-13 18:18:24,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:24,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-13 18:18:24,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:24,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-13 18:18:24,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:24,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-13 18:18:24,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:24,782 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-13 18:18:24,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:18:24,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091141222] [2022-07-13 18:18:24,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091141222] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:18:24,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:18:24,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 18:18:24,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371833146] [2022-07-13 18:18:24,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:18:24,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 18:18:24,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:18:24,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 18:18:24,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 18:18:24,785 INFO L87 Difference]: Start difference. First operand 1240 states and 1652 transitions. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 6 states have internal predecessors, (84), 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-13 18:18:25,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:18:25,121 INFO L93 Difference]: Finished difference Result 2550 states and 3481 transitions. [2022-07-13 18:18:25,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 18:18:25,122 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 6 states have internal predecessors, (84), 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 111 [2022-07-13 18:18:25,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:18:25,131 INFO L225 Difference]: With dead ends: 2550 [2022-07-13 18:18:25,131 INFO L226 Difference]: Without dead ends: 1590 [2022-07-13 18:18:25,134 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-13 18:18:25,136 INFO L413 NwaCegarLoop]: 442 mSDtfsCounter, 399 mSDsluCounter, 1983 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 2425 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.2s IncrementalHoareTripleChecker+Time [2022-07-13 18:18:25,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 2425 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 18:18:25,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1590 states. [2022-07-13 18:18:25,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1590 to 1126. [2022-07-13 18:18:25,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1126 states, 899 states have (on average 1.3481646273637375) internal successors, (1212), 909 states have internal predecessors, (1212), 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-13 18:18:25,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 1126 states and 1502 transitions. [2022-07-13 18:18:25,381 INFO L78 Accepts]: Start accepts. Automaton has 1126 states and 1502 transitions. Word has length 111 [2022-07-13 18:18:25,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:18:25,382 INFO L495 AbstractCegarLoop]: Abstraction has 1126 states and 1502 transitions. [2022-07-13 18:18:25,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 6 states have internal predecessors, (84), 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-13 18:18:25,383 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 1502 transitions. [2022-07-13 18:18:25,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-07-13 18:18:25,384 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:18:25,384 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-13 18:18:25,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-13 18:18:25,385 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:18:25,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:18:25,385 INFO L85 PathProgramCache]: Analyzing trace with hash 2059853897, now seen corresponding path program 1 times [2022-07-13 18:18:25,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:18:25,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160136957] [2022-07-13 18:18:25,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:18:25,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:18:25,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:25,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 18:18:25,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:25,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 18:18:25,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:25,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-13 18:18:25,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:25,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-13 18:18:25,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:25,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-13 18:18:25,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:25,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-13 18:18:25,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:25,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-13 18:18:25,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:25,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-13 18:18:25,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:25,576 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-13 18:18:25,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:18:25,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160136957] [2022-07-13 18:18:25,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160136957] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:18:25,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:18:25,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 18:18:25,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111942755] [2022-07-13 18:18:25,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:18:25,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 18:18:25,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:18:25,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 18:18:25,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-13 18:18:25,580 INFO L87 Difference]: Start difference. First operand 1126 states and 1502 transitions. Second operand has 8 states, 8 states have (on average 11.125) internal successors, (89), 7 states have internal predecessors, (89), 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-13 18:18:26,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:18:26,260 INFO L93 Difference]: Finished difference Result 2621 states and 3588 transitions. [2022-07-13 18:18:26,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 18:18:26,261 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 7 states have internal predecessors, (89), 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 112 [2022-07-13 18:18:26,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:18:26,270 INFO L225 Difference]: With dead ends: 2621 [2022-07-13 18:18:26,270 INFO L226 Difference]: Without dead ends: 1695 [2022-07-13 18:18:26,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-07-13 18:18:26,273 INFO L413 NwaCegarLoop]: 509 mSDtfsCounter, 930 mSDsluCounter, 1656 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 936 SdHoareTripleChecker+Valid, 2165 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 18:18:26,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [936 Valid, 2165 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 18:18:26,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1695 states. [2022-07-13 18:18:26,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1695 to 1142. [2022-07-13 18:18:26,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1142 states, 907 states have (on average 1.328555678059537) internal successors, (1205), 918 states have internal predecessors, (1205), 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-13 18:18:26,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 1501 transitions. [2022-07-13 18:18:26,400 INFO L78 Accepts]: Start accepts. Automaton has 1142 states and 1501 transitions. Word has length 112 [2022-07-13 18:18:26,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:18:26,401 INFO L495 AbstractCegarLoop]: Abstraction has 1142 states and 1501 transitions. [2022-07-13 18:18:26,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 7 states have internal predecessors, (89), 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-13 18:18:26,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 1501 transitions. [2022-07-13 18:18:26,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-07-13 18:18:26,403 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:18:26,403 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-13 18:18:26,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-13 18:18:26,403 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:18:26,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:18:26,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1941201166, now seen corresponding path program 1 times [2022-07-13 18:18:26,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:18:26,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361071613] [2022-07-13 18:18:26,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:18:26,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:18:26,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:26,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 18:18:26,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:26,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 18:18:26,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:26,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-13 18:18:26,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:26,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-13 18:18:26,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:26,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-13 18:18:26,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:26,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-13 18:18:26,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:26,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-13 18:18:26,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:26,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-13 18:18:26,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:26,471 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-13 18:18:26,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:18:26,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361071613] [2022-07-13 18:18:26,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361071613] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:18:26,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:18:26,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 18:18:26,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836842540] [2022-07-13 18:18:26,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:18:26,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 18:18:26,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:18:26,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 18:18:26,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 18:18:26,474 INFO L87 Difference]: Start difference. First operand 1142 states and 1501 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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-13 18:18:26,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:18:26,826 INFO L93 Difference]: Finished difference Result 3187 states and 4275 transitions. [2022-07-13 18:18:26,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 18:18:26,827 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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 112 [2022-07-13 18:18:26,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:18:26,838 INFO L225 Difference]: With dead ends: 3187 [2022-07-13 18:18:26,838 INFO L226 Difference]: Without dead ends: 2296 [2022-07-13 18:18:26,841 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-13 18:18:26,841 INFO L413 NwaCegarLoop]: 511 mSDtfsCounter, 440 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 1227 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-13 18:18:26,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 1227 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 18:18:26,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2296 states. [2022-07-13 18:18:27,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2296 to 1939. [2022-07-13 18:18:27,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1939 states, 1514 states have (on average 1.3262879788639366) internal successors, (2008), 1533 states have internal predecessors, (2008), 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-13 18:18:27,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1939 states to 1939 states and 2552 transitions. [2022-07-13 18:18:27,114 INFO L78 Accepts]: Start accepts. Automaton has 1939 states and 2552 transitions. Word has length 112 [2022-07-13 18:18:27,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:18:27,115 INFO L495 AbstractCegarLoop]: Abstraction has 1939 states and 2552 transitions. [2022-07-13 18:18:27,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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-13 18:18:27,115 INFO L276 IsEmpty]: Start isEmpty. Operand 1939 states and 2552 transitions. [2022-07-13 18:18:27,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-13 18:18:27,117 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:18:27,117 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-13 18:18:27,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-13 18:18:27,118 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:18:27,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:18:27,118 INFO L85 PathProgramCache]: Analyzing trace with hash -2103041469, now seen corresponding path program 1 times [2022-07-13 18:18:27,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:18:27,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594521465] [2022-07-13 18:18:27,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:18:27,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:18:27,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:27,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 18:18:27,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:27,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 18:18:27,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:27,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-13 18:18:27,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:27,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-13 18:18:27,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:27,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-13 18:18:27,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:27,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-13 18:18:27,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:27,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-13 18:18:27,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:27,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-13 18:18:27,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:27,262 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-13 18:18:27,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:18:27,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594521465] [2022-07-13 18:18:27,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594521465] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:18:27,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:18:27,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 18:18:27,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721766] [2022-07-13 18:18:27,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:18:27,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 18:18:27,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:18:27,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 18:18:27,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 18:18:27,266 INFO L87 Difference]: Start difference. First operand 1939 states and 2552 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 6 states have internal predecessors, (91), 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-13 18:18:28,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:18:28,100 INFO L93 Difference]: Finished difference Result 4400 states and 5932 transitions. [2022-07-13 18:18:28,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 18:18:28,101 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 6 states have internal predecessors, (91), 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 114 [2022-07-13 18:18:28,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:18:28,114 INFO L225 Difference]: With dead ends: 4400 [2022-07-13 18:18:28,114 INFO L226 Difference]: Without dead ends: 2810 [2022-07-13 18:18:28,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-07-13 18:18:28,120 INFO L413 NwaCegarLoop]: 578 mSDtfsCounter, 806 mSDsluCounter, 1940 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 809 SdHoareTripleChecker+Valid, 2518 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.4s IncrementalHoareTripleChecker+Time [2022-07-13 18:18:28,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [809 Valid, 2518 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 18:18:28,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2810 states. [2022-07-13 18:18:28,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2810 to 1958. [2022-07-13 18:18:28,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1958 states, 1520 states have (on average 1.3223684210526316) internal successors, (2010), 1540 states have internal predecessors, (2010), 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-13 18:18:28,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1958 states to 1958 states and 2570 transitions. [2022-07-13 18:18:28,431 INFO L78 Accepts]: Start accepts. Automaton has 1958 states and 2570 transitions. Word has length 114 [2022-07-13 18:18:28,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:18:28,432 INFO L495 AbstractCegarLoop]: Abstraction has 1958 states and 2570 transitions. [2022-07-13 18:18:28,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 6 states have internal predecessors, (91), 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-13 18:18:28,433 INFO L276 IsEmpty]: Start isEmpty. Operand 1958 states and 2570 transitions. [2022-07-13 18:18:28,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-07-13 18:18:28,435 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:18:28,435 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-13 18:18:28,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-13 18:18:28,436 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:18:28,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:18:28,436 INFO L85 PathProgramCache]: Analyzing trace with hash 985009634, now seen corresponding path program 1 times [2022-07-13 18:18:28,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:18:28,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268371545] [2022-07-13 18:18:28,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:18:28,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:18:28,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:28,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 18:18:28,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:28,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-13 18:18:28,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:28,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 18:18:28,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:28,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-13 18:18:28,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:28,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-13 18:18:28,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:28,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-13 18:18:28,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:28,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-13 18:18:28,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:28,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-13 18:18:28,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:28,524 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-13 18:18:28,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:18:28,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268371545] [2022-07-13 18:18:28,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268371545] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:18:28,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:18:28,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 18:18:28,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432063478] [2022-07-13 18:18:28,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:18:28,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 18:18:28,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:18:28,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 18:18:28,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 18:18:28,527 INFO L87 Difference]: Start difference. First operand 1958 states and 2570 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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-13 18:18:29,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:18:29,002 INFO L93 Difference]: Finished difference Result 5168 states and 6863 transitions. [2022-07-13 18:18:29,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 18:18:29,003 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), 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 115 [2022-07-13 18:18:29,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:18:29,039 INFO L225 Difference]: With dead ends: 5168 [2022-07-13 18:18:29,039 INFO L226 Difference]: Without dead ends: 3594 [2022-07-13 18:18:29,046 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-13 18:18:29,047 INFO L413 NwaCegarLoop]: 527 mSDtfsCounter, 487 mSDsluCounter, 764 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 1291 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-13 18:18:29,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 1291 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 18:18:29,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3594 states. [2022-07-13 18:18:29,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3594 to 3019. [2022-07-13 18:18:29,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3019 states, 2306 states have (on average 1.318733738074588) internal successors, (3041), 2337 states have internal predecessors, (3041), 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-13 18:18:29,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3019 states to 3019 states and 3961 transitions. [2022-07-13 18:18:29,385 INFO L78 Accepts]: Start accepts. Automaton has 3019 states and 3961 transitions. Word has length 115 [2022-07-13 18:18:29,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:18:29,385 INFO L495 AbstractCegarLoop]: Abstraction has 3019 states and 3961 transitions. [2022-07-13 18:18:29,385 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), 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-13 18:18:29,386 INFO L276 IsEmpty]: Start isEmpty. Operand 3019 states and 3961 transitions. [2022-07-13 18:18:29,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-07-13 18:18:29,389 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:18:29,389 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-13 18:18:29,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-13 18:18:29,389 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:18:29,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:18:29,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1237817774, now seen corresponding path program 1 times [2022-07-13 18:18:29,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:18:29,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285756689] [2022-07-13 18:18:29,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:18:29,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:18:29,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:29,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 18:18:29,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:29,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-13 18:18:29,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:29,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 18:18:29,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:29,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-13 18:18:29,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:29,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-13 18:18:29,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:29,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-13 18:18:29,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:29,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-13 18:18:29,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:29,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-13 18:18:29,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:29,456 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-13 18:18:29,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:18:29,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285756689] [2022-07-13 18:18:29,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285756689] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:18:29,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:18:29,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 18:18:29,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433155541] [2022-07-13 18:18:29,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:18:29,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 18:18:29,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:18:29,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 18:18:29,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 18:18:29,460 INFO L87 Difference]: Start difference. First operand 3019 states and 3961 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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-13 18:18:30,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:18:30,025 INFO L93 Difference]: Finished difference Result 7140 states and 9437 transitions. [2022-07-13 18:18:30,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 18:18:30,026 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), 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 115 [2022-07-13 18:18:30,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:18:30,048 INFO L225 Difference]: With dead ends: 7140 [2022-07-13 18:18:30,048 INFO L226 Difference]: Without dead ends: 4635 [2022-07-13 18:18:30,059 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-13 18:18:30,060 INFO L413 NwaCegarLoop]: 551 mSDtfsCounter, 434 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 1288 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-13 18:18:30,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 1288 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 18:18:30,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4635 states. [2022-07-13 18:18:30,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4635 to 4297. [2022-07-13 18:18:30,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4297 states, 3260 states have (on average 1.316564417177914) internal successors, (4292), 3304 states have internal predecessors, (4292), 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-13 18:18:30,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4297 states to 4297 states and 5636 transitions. [2022-07-13 18:18:30,592 INFO L78 Accepts]: Start accepts. Automaton has 4297 states and 5636 transitions. Word has length 115 [2022-07-13 18:18:30,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:18:30,592 INFO L495 AbstractCegarLoop]: Abstraction has 4297 states and 5636 transitions. [2022-07-13 18:18:30,593 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), 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-13 18:18:30,593 INFO L276 IsEmpty]: Start isEmpty. Operand 4297 states and 5636 transitions. [2022-07-13 18:18:30,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-07-13 18:18:30,596 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:18:30,596 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-13 18:18:30,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-13 18:18:30,596 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:18:30,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:18:30,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1950956728, now seen corresponding path program 1 times [2022-07-13 18:18:30,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:18:30,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834688199] [2022-07-13 18:18:30,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:18:30,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:18:30,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:30,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 18:18:30,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:30,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 18:18:30,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:30,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-13 18:18:30,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:30,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 18:18:30,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:30,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-13 18:18:30,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:30,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-13 18:18:30,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:30,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-13 18:18:30,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:30,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-13 18:18:30,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:30,672 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-13 18:18:30,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:18:30,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834688199] [2022-07-13 18:18:30,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834688199] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:18:30,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:18:30,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 18:18:30,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150462681] [2022-07-13 18:18:30,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:18:30,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 18:18:30,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:18:30,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 18:18:30,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 18:18:30,675 INFO L87 Difference]: Start difference. First operand 4297 states and 5636 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-13 18:18:31,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:18:31,472 INFO L93 Difference]: Finished difference Result 9720 states and 13194 transitions. [2022-07-13 18:18:31,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 18:18:31,472 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-13 18:18:31,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:18:31,500 INFO L225 Difference]: With dead ends: 9720 [2022-07-13 18:18:31,500 INFO L226 Difference]: Without dead ends: 5828 [2022-07-13 18:18:31,514 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-13 18:18:31,516 INFO L413 NwaCegarLoop]: 458 mSDtfsCounter, 152 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 18:18:31,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 704 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 18:18:31,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5828 states. [2022-07-13 18:18:32,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5828 to 4303. [2022-07-13 18:18:32,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4303 states, 3266 states have (on average 1.3159828536436007) internal successors, (4298), 3310 states have internal predecessors, (4298), 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-13 18:18:32,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4303 states to 4303 states and 5642 transitions. [2022-07-13 18:18:32,050 INFO L78 Accepts]: Start accepts. Automaton has 4303 states and 5642 transitions. Word has length 116 [2022-07-13 18:18:32,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:18:32,051 INFO L495 AbstractCegarLoop]: Abstraction has 4303 states and 5642 transitions. [2022-07-13 18:18:32,051 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-13 18:18:32,052 INFO L276 IsEmpty]: Start isEmpty. Operand 4303 states and 5642 transitions. [2022-07-13 18:18:32,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-13 18:18:32,055 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:18:32,055 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, 1] [2022-07-13 18:18:32,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-13 18:18:32,056 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:18:32,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:18:32,056 INFO L85 PathProgramCache]: Analyzing trace with hash -2025473139, now seen corresponding path program 1 times [2022-07-13 18:18:32,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:18:32,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887689486] [2022-07-13 18:18:32,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:18:32,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:18:32,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:32,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 18:18:32,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:32,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-13 18:18:32,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:32,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 18:18:32,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:32,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-13 18:18:32,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:32,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-13 18:18:32,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:32,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-13 18:18:32,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:32,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-13 18:18:32,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:32,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-13 18:18:32,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:32,165 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-13 18:18:32,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:18:32,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887689486] [2022-07-13 18:18:32,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887689486] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:18:32,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:18:32,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 18:18:32,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92874538] [2022-07-13 18:18:32,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:18:32,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 18:18:32,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:18:32,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 18:18:32,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 18:18:32,168 INFO L87 Difference]: Start difference. First operand 4303 states and 5642 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 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-13 18:18:32,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:18:32,805 INFO L93 Difference]: Finished difference Result 9016 states and 12080 transitions. [2022-07-13 18:18:32,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 18:18:32,806 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 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 117 [2022-07-13 18:18:32,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:18:32,831 INFO L225 Difference]: With dead ends: 9016 [2022-07-13 18:18:32,832 INFO L226 Difference]: Without dead ends: 4810 [2022-07-13 18:18:32,843 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-13 18:18:32,844 INFO L413 NwaCegarLoop]: 335 mSDtfsCounter, 370 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 884 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-13 18:18:32,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 884 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:18:32,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4810 states. [2022-07-13 18:18:33,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4810 to 3870. [2022-07-13 18:18:33,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3870 states, 2916 states have (on average 1.3223593964334706) internal successors, (3856), 2950 states have internal predecessors, (3856), 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-13 18:18:33,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3870 states to 3870 states and 5096 transitions. [2022-07-13 18:18:33,376 INFO L78 Accepts]: Start accepts. Automaton has 3870 states and 5096 transitions. Word has length 117 [2022-07-13 18:18:33,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:18:33,376 INFO L495 AbstractCegarLoop]: Abstraction has 3870 states and 5096 transitions. [2022-07-13 18:18:33,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 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-13 18:18:33,377 INFO L276 IsEmpty]: Start isEmpty. Operand 3870 states and 5096 transitions. [2022-07-13 18:18:33,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-07-13 18:18:33,379 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:18:33,379 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, 1, 1] [2022-07-13 18:18:33,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-13 18:18:33,379 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:18:33,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:18:33,380 INFO L85 PathProgramCache]: Analyzing trace with hash 183157843, now seen corresponding path program 1 times [2022-07-13 18:18:33,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:18:33,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222171159] [2022-07-13 18:18:33,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:18:33,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:18:33,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:33,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 18:18:33,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:33,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 18:18:33,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:33,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-13 18:18:33,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:33,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 18:18:33,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:33,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-13 18:18:33,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:33,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-13 18:18:33,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:33,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-13 18:18:33,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:33,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-13 18:18:33,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:33,437 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-13 18:18:33,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:18:33,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222171159] [2022-07-13 18:18:33,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222171159] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:18:33,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:18:33,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 18:18:33,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673200139] [2022-07-13 18:18:33,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:18:33,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 18:18:33,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:18:33,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 18:18:33,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 18:18:33,443 INFO L87 Difference]: Start difference. First operand 3870 states and 5096 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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-13 18:18:34,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:18:34,257 INFO L93 Difference]: Finished difference Result 8518 states and 11512 transitions. [2022-07-13 18:18:34,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 18:18:34,258 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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 118 [2022-07-13 18:18:34,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:18:34,278 INFO L225 Difference]: With dead ends: 8518 [2022-07-13 18:18:34,278 INFO L226 Difference]: Without dead ends: 4861 [2022-07-13 18:18:34,288 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-13 18:18:34,289 INFO L413 NwaCegarLoop]: 438 mSDtfsCounter, 152 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 18:18:34,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 683 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 18:18:34,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4861 states. [2022-07-13 18:18:34,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4861 to 3880. [2022-07-13 18:18:34,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3880 states, 2926 states have (on average 1.3212576896787422) internal successors, (3866), 2960 states have internal predecessors, (3866), 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-13 18:18:34,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3880 states to 3880 states and 5106 transitions. [2022-07-13 18:18:34,684 INFO L78 Accepts]: Start accepts. Automaton has 3880 states and 5106 transitions. Word has length 118 [2022-07-13 18:18:34,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:18:34,685 INFO L495 AbstractCegarLoop]: Abstraction has 3880 states and 5106 transitions. [2022-07-13 18:18:34,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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-13 18:18:34,685 INFO L276 IsEmpty]: Start isEmpty. Operand 3880 states and 5106 transitions. [2022-07-13 18:18:34,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-07-13 18:18:34,687 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:18:34,688 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, 1, 1] [2022-07-13 18:18:34,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-13 18:18:34,688 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:18:34,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:18:34,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1515793806, now seen corresponding path program 1 times [2022-07-13 18:18:34,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:18:34,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177009467] [2022-07-13 18:18:34,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:18:34,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:18:34,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:34,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 18:18:34,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:34,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 18:18:34,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:34,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-13 18:18:34,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:34,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 18:18:34,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:34,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-13 18:18:34,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:34,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-13 18:18:34,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:34,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-13 18:18:34,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:34,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-13 18:18:34,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:34,768 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-13 18:18:34,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:18:34,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177009467] [2022-07-13 18:18:34,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177009467] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:18:34,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:18:34,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 18:18:34,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143457725] [2022-07-13 18:18:34,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:18:34,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 18:18:34,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:18:34,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 18:18:34,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 18:18:34,771 INFO L87 Difference]: Start difference. First operand 3880 states and 5106 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 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-13 18:18:35,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:18:35,316 INFO L93 Difference]: Finished difference Result 8465 states and 11428 transitions. [2022-07-13 18:18:35,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 18:18:35,317 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 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 118 [2022-07-13 18:18:35,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:18:35,335 INFO L225 Difference]: With dead ends: 8465 [2022-07-13 18:18:35,336 INFO L226 Difference]: Without dead ends: 4731 [2022-07-13 18:18:35,346 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-13 18:18:35,347 INFO L413 NwaCegarLoop]: 360 mSDtfsCounter, 285 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 915 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-13 18:18:35,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 915 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:18:35,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4731 states. [2022-07-13 18:18:35,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4731 to 2927. [2022-07-13 18:18:35,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2927 states, 2207 states have (on average 1.313094698685999) internal successors, (2898), 2226 states have internal predecessors, (2898), 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-13 18:18:35,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2927 states to 2927 states and 3836 transitions. [2022-07-13 18:18:35,721 INFO L78 Accepts]: Start accepts. Automaton has 2927 states and 3836 transitions. Word has length 118 [2022-07-13 18:18:35,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:18:35,722 INFO L495 AbstractCegarLoop]: Abstraction has 2927 states and 3836 transitions. [2022-07-13 18:18:35,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 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-13 18:18:35,722 INFO L276 IsEmpty]: Start isEmpty. Operand 2927 states and 3836 transitions. [2022-07-13 18:18:35,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-07-13 18:18:35,728 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:18:35,729 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, 1, 1] [2022-07-13 18:18:35,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-13 18:18:35,729 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:18:35,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:18:35,730 INFO L85 PathProgramCache]: Analyzing trace with hash -402462666, now seen corresponding path program 1 times [2022-07-13 18:18:35,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:18:35,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151875554] [2022-07-13 18:18:35,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:18:35,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:18:35,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:35,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 18:18:35,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:35,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 18:18:35,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:35,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-13 18:18:35,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:35,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-13 18:18:35,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:35,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-13 18:18:35,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:35,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-13 18:18:35,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:35,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-13 18:18:35,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:35,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-13 18:18:35,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:35,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-13 18:18:35,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:35,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-13 18:18:35,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:35,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-13 18:18:35,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:35,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-13 18:18:35,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:35,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-13 18:18:35,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:35,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-13 18:18:35,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:35,927 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-13 18:18:35,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:18:35,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151875554] [2022-07-13 18:18:35,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151875554] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:18:35,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2142756858] [2022-07-13 18:18:35,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:18:35,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:18:35,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:18:35,930 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-13 18:18:35,934 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-13 18:18:36,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:36,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 748 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 18:18:36,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:18:36,401 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-13 18:18:36,402 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:18:36,557 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-13 18:18:36,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2142756858] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 18:18:36,558 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 18:18:36,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-07-13 18:18:36,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105470542] [2022-07-13 18:18:36,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 18:18:36,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 18:18:36,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:18:36,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 18:18:36,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-07-13 18:18:36,560 INFO L87 Difference]: Start difference. First operand 2927 states and 3836 transitions. Second operand has 14 states, 14 states have (on average 18.857142857142858) internal successors, (264), 13 states have internal predecessors, (264), 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-13 18:18:41,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:18:41,776 INFO L93 Difference]: Finished difference Result 10002 states and 14000 transitions. [2022-07-13 18:18:41,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-07-13 18:18:41,777 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 18.857142857142858) internal successors, (264), 13 states have internal predecessors, (264), 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 186 [2022-07-13 18:18:41,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:18:41,847 INFO L225 Difference]: With dead ends: 10002 [2022-07-13 18:18:41,848 INFO L226 Difference]: Without dead ends: 7362 [2022-07-13 18:18:41,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 404 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1358 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=749, Invalid=3411, Unknown=0, NotChecked=0, Total=4160 [2022-07-13 18:18:41,859 INFO L413 NwaCegarLoop]: 337 mSDtfsCounter, 4481 mSDsluCounter, 2949 mSDsCounter, 0 mSdLazyCounter, 2038 mSolverCounterSat, 1308 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4481 SdHoareTripleChecker+Valid, 3286 SdHoareTripleChecker+Invalid, 3346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1308 IncrementalHoareTripleChecker+Valid, 2038 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-07-13 18:18:41,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4481 Valid, 3286 Invalid, 3346 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1308 Valid, 2038 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-07-13 18:18:41,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7362 states. [2022-07-13 18:18:42,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7362 to 3451. [2022-07-13 18:18:42,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3451 states, 2624 states have (on average 1.3090701219512195) internal successors, (3435), 2644 states have internal predecessors, (3435), 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-13 18:18:42,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3451 states to 3451 states and 4497 transitions. [2022-07-13 18:18:42,471 INFO L78 Accepts]: Start accepts. Automaton has 3451 states and 4497 transitions. Word has length 186 [2022-07-13 18:18:42,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:18:42,471 INFO L495 AbstractCegarLoop]: Abstraction has 3451 states and 4497 transitions. [2022-07-13 18:18:42,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 18.857142857142858) internal successors, (264), 13 states have internal predecessors, (264), 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-13 18:18:42,471 INFO L276 IsEmpty]: Start isEmpty. Operand 3451 states and 4497 transitions. [2022-07-13 18:18:42,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-07-13 18:18:42,478 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:18:42,479 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, 1, 1] [2022-07-13 18:18:42,511 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-13 18:18:42,703 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,SelfDestructingSolverStorable27 [2022-07-13 18:18:42,703 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:18:42,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:18:42,704 INFO L85 PathProgramCache]: Analyzing trace with hash 141381451, now seen corresponding path program 1 times [2022-07-13 18:18:42,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:18:42,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165442575] [2022-07-13 18:18:42,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:18:42,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:18:42,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:42,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 18:18:42,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:42,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 18:18:42,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:42,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-13 18:18:42,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:42,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-13 18:18:42,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:42,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-13 18:18:42,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:42,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-13 18:18:42,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:42,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-13 18:18:42,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:42,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-13 18:18:42,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:42,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-13 18:18:42,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:42,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-13 18:18:42,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:42,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-13 18:18:42,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:42,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-13 18:18:42,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:42,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-13 18:18:42,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:42,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-13 18:18:42,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:42,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-13 18:18:42,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:42,895 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-13 18:18:42,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:18:42,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165442575] [2022-07-13 18:18:42,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165442575] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:18:42,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086963938] [2022-07-13 18:18:42,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:18:42,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:18:42,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:18:42,897 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-13 18:18:42,899 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-13 18:18:43,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:43,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 793 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-13 18:18:43,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:18:43,437 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-13 18:18:43,438 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:18:43,649 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-13 18:18:43,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2086963938] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 18:18:43,649 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 18:18:43,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2022-07-13 18:18:43,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720323891] [2022-07-13 18:18:43,649 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 18:18:43,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-13 18:18:43,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:18:43,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-13 18:18:43,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2022-07-13 18:18:43,651 INFO L87 Difference]: Start difference. First operand 3451 states and 4497 transitions. Second operand has 16 states, 16 states have (on average 16.625) internal successors, (266), 14 states have internal predecessors, (266), 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-13 18:18:52,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:18:52,576 INFO L93 Difference]: Finished difference Result 17532 states and 23957 transitions. [2022-07-13 18:18:52,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2022-07-13 18:18:52,577 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 16.625) internal successors, (266), 14 states have internal predecessors, (266), 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 194 [2022-07-13 18:18:52,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:18:52,624 INFO L225 Difference]: With dead ends: 17532 [2022-07-13 18:18:52,624 INFO L226 Difference]: Without dead ends: 14377 [2022-07-13 18:18:52,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 594 GetRequests, 476 SyntacticMatches, 1 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5045 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1835, Invalid=12207, Unknown=0, NotChecked=0, Total=14042 [2022-07-13 18:18:52,638 INFO L413 NwaCegarLoop]: 1832 mSDtfsCounter, 5889 mSDsluCounter, 13834 mSDsCounter, 0 mSdLazyCounter, 5456 mSolverCounterSat, 3535 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5889 SdHoareTripleChecker+Valid, 15666 SdHoareTripleChecker+Invalid, 8991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3535 IncrementalHoareTripleChecker+Valid, 5456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-07-13 18:18:52,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5889 Valid, 15666 Invalid, 8991 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3535 Valid, 5456 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-07-13 18:18:52,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14377 states. [2022-07-13 18:18:53,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14377 to 6318. [2022-07-13 18:18:53,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6318 states, 4774 states have (on average 1.3112693757855047) internal successors, (6260), 4812 states have internal predecessors, (6260), 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-13 18:18:53,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6318 states to 6318 states and 8244 transitions. [2022-07-13 18:18:53,531 INFO L78 Accepts]: Start accepts. Automaton has 6318 states and 8244 transitions. Word has length 194 [2022-07-13 18:18:53,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:18:53,532 INFO L495 AbstractCegarLoop]: Abstraction has 6318 states and 8244 transitions. [2022-07-13 18:18:53,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 16.625) internal successors, (266), 14 states have internal predecessors, (266), 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-13 18:18:53,532 INFO L276 IsEmpty]: Start isEmpty. Operand 6318 states and 8244 transitions. [2022-07-13 18:18:53,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-07-13 18:18:53,543 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:18:53,544 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, 1, 1] [2022-07-13 18:18:53,571 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-13 18:18:53,769 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,SelfDestructingSolverStorable28 [2022-07-13 18:18:53,769 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:18:53,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:18:53,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1389154626, now seen corresponding path program 1 times [2022-07-13 18:18:53,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:18:53,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207690924] [2022-07-13 18:18:53,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:18:53,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:18:53,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:53,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 18:18:53,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:53,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 18:18:53,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:53,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 18:18:53,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:53,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-13 18:18:53,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:53,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-13 18:18:53,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:53,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-13 18:18:53,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:53,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-13 18:18:53,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:53,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-13 18:18:53,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:53,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-13 18:18:53,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:53,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-13 18:18:53,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:53,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-13 18:18:53,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:53,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-13 18:18:53,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:53,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-07-13 18:18:53,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:53,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-13 18:18:53,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:53,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-07-13 18:18:53,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:53,880 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-13 18:18:53,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:18:53,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207690924] [2022-07-13 18:18:53,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207690924] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:18:53,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:18:53,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 18:18:53,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778732973] [2022-07-13 18:18:53,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:18:53,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 18:18:53,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:18:53,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 18:18:53,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 18:18:53,884 INFO L87 Difference]: Start difference. First operand 6318 states and 8244 transitions. Second operand has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 6 states have internal predecessors, (117), 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-13 18:18:56,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:18:56,019 INFO L93 Difference]: Finished difference Result 21338 states and 28586 transitions. [2022-07-13 18:18:56,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 18:18:56,020 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 6 states have internal predecessors, (117), 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 196 [2022-07-13 18:18:56,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:18:56,071 INFO L225 Difference]: With dead ends: 21338 [2022-07-13 18:18:56,072 INFO L226 Difference]: Without dead ends: 15378 [2022-07-13 18:18:56,086 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-13 18:18:56,087 INFO L413 NwaCegarLoop]: 574 mSDtfsCounter, 817 mSDsluCounter, 2520 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 836 SdHoareTripleChecker+Valid, 3094 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 18:18:56,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [836 Valid, 3094 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 18:18:56,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15378 states. [2022-07-13 18:18:57,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15378 to 8160. [2022-07-13 18:18:57,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8160 states, 6104 states have (on average 1.3086500655307995) internal successors, (7988), 6155 states have internal predecessors, (7988), 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-13 18:18:57,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8160 states to 8160 states and 10658 transitions. [2022-07-13 18:18:57,111 INFO L78 Accepts]: Start accepts. Automaton has 8160 states and 10658 transitions. Word has length 196 [2022-07-13 18:18:57,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:18:57,113 INFO L495 AbstractCegarLoop]: Abstraction has 8160 states and 10658 transitions. [2022-07-13 18:18:57,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 6 states have internal predecessors, (117), 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-13 18:18:57,113 INFO L276 IsEmpty]: Start isEmpty. Operand 8160 states and 10658 transitions. [2022-07-13 18:18:57,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2022-07-13 18:18:57,127 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:18:57,127 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 18:18:57,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-13 18:18:57,127 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:18:57,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:18:57,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1333769863, now seen corresponding path program 1 times [2022-07-13 18:18:57,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:18:57,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143731568] [2022-07-13 18:18:57,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:18:57,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:18:57,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:57,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 18:18:57,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:57,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 18:18:57,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:57,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 18:18:57,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:57,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-13 18:18:57,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:57,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-13 18:18:57,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:57,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-13 18:18:57,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:57,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-13 18:18:57,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:57,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-13 18:18:57,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:57,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-13 18:18:57,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:57,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-13 18:18:57,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:57,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-13 18:18:57,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:57,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-13 18:18:57,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:57,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-13 18:18:57,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:57,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-07-13 18:18:57,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:57,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-13 18:18:57,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:57,275 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 16 proven. 24 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-07-13 18:18:57,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:18:57,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143731568] [2022-07-13 18:18:57,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143731568] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:18:57,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022558604] [2022-07-13 18:18:57,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:18:57,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:18:57,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:18:57,278 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-13 18:18:57,279 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-13 18:18:57,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:57,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 798 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-13 18:18:57,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:18:57,513 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-13 18:18:57,513 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:18:57,611 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-13 18:18:57,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1022558604] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-13 18:18:57,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-13 18:18:57,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8, 7] total 14 [2022-07-13 18:18:57,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852851221] [2022-07-13 18:18:57,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:18:57,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 18:18:57,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:18:57,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 18:18:57,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-07-13 18:18:57,614 INFO L87 Difference]: Start difference. First operand 8160 states and 10658 transitions. Second operand has 5 states, 4 states have (on average 28.75) internal successors, (115), 5 states have internal predecessors, (115), 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-13 18:18:58,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:18:58,244 INFO L93 Difference]: Finished difference Result 13442 states and 17611 transitions. [2022-07-13 18:18:58,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 18:18:58,245 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 28.75) internal successors, (115), 5 states have internal predecessors, (115), 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 198 [2022-07-13 18:18:58,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:18:58,265 INFO L225 Difference]: With dead ends: 13442 [2022-07-13 18:18:58,265 INFO L226 Difference]: Without dead ends: 5488 [2022-07-13 18:18:58,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 419 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-07-13 18:18:58,281 INFO L413 NwaCegarLoop]: 293 mSDtfsCounter, 2 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 870 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-13 18:18:58,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 870 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 18:18:58,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5488 states. [2022-07-13 18:18:59,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5488 to 5488. [2022-07-13 18:18:59,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5488 states, 4106 states have (on average 1.3080857282026304) internal successors, (5371), 4140 states have internal predecessors, (5371), 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-13 18:18:59,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5488 states to 5488 states and 7173 transitions. [2022-07-13 18:18:59,098 INFO L78 Accepts]: Start accepts. Automaton has 5488 states and 7173 transitions. Word has length 198 [2022-07-13 18:18:59,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:18:59,098 INFO L495 AbstractCegarLoop]: Abstraction has 5488 states and 7173 transitions. [2022-07-13 18:18:59,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 28.75) internal successors, (115), 5 states have internal predecessors, (115), 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-13 18:18:59,098 INFO L276 IsEmpty]: Start isEmpty. Operand 5488 states and 7173 transitions. [2022-07-13 18:18:59,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2022-07-13 18:18:59,108 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:18:59,108 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 18:18:59,137 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-13 18:18:59,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:18:59,324 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:18:59,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:18:59,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1056461284, now seen corresponding path program 1 times [2022-07-13 18:18:59,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:18:59,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797447715] [2022-07-13 18:18:59,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:18:59,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:18:59,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:59,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 18:18:59,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:59,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 18:18:59,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:59,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 18:18:59,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:59,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-13 18:18:59,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:59,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-13 18:18:59,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:59,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-13 18:18:59,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:59,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-13 18:18:59,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:59,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-13 18:18:59,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:59,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-13 18:18:59,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:59,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-13 18:18:59,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:59,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-13 18:18:59,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:59,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-13 18:18:59,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:59,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-13 18:18:59,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:59,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-07-13 18:18:59,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:59,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-13 18:18:59,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:59,519 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-13 18:18:59,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:18:59,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797447715] [2022-07-13 18:18:59,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797447715] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:18:59,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616303235] [2022-07-13 18:18:59,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:18:59,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:18:59,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:18:59,521 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-13 18:18:59,523 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-13 18:18:59,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:18:59,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 824 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-13 18:18:59,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:19:00,195 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 71 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-13 18:19:00,200 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:19:00,494 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 15 proven. 18 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-07-13 18:19:00,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [616303235] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 18:19:00,495 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 18:19:00,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 8] total 24 [2022-07-13 18:19:00,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686819831] [2022-07-13 18:19:00,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 18:19:00,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-13 18:19:00,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:19:00,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-13 18:19:00,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=488, Unknown=0, NotChecked=0, Total=552 [2022-07-13 18:19:00,499 INFO L87 Difference]: Start difference. First operand 5488 states and 7173 transitions. Second operand has 24 states, 24 states have (on average 14.375) internal successors, (345), 24 states have internal predecessors, (345), 9 states have call successors, (41), 5 states have call predecessors, (41), 5 states have return successors, (40), 9 states have call predecessors, (40), 9 states have call successors, (40) [2022-07-13 18:19:15,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:19:15,948 INFO L93 Difference]: Finished difference Result 27311 states and 38275 transitions. [2022-07-13 18:19:15,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 203 states. [2022-07-13 18:19:15,950 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 14.375) internal successors, (345), 24 states have internal predecessors, (345), 9 states have call successors, (41), 5 states have call predecessors, (41), 5 states have return successors, (40), 9 states have call predecessors, (40), 9 states have call successors, (40) Word has length 198 [2022-07-13 18:19:15,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:19:16,018 INFO L225 Difference]: With dead ends: 27311 [2022-07-13 18:19:16,019 INFO L226 Difference]: Without dead ends: 22107 [2022-07-13 18:19:16,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 640 GetRequests, 417 SyntacticMatches, 1 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20333 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=5256, Invalid=44696, Unknown=0, NotChecked=0, Total=49952 [2022-07-13 18:19:16,045 INFO L413 NwaCegarLoop]: 698 mSDtfsCounter, 10125 mSDsluCounter, 8131 mSDsCounter, 0 mSdLazyCounter, 12316 mSolverCounterSat, 4950 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10125 SdHoareTripleChecker+Valid, 8829 SdHoareTripleChecker+Invalid, 17266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4950 IncrementalHoareTripleChecker+Valid, 12316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2022-07-13 18:19:16,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10125 Valid, 8829 Invalid, 17266 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4950 Valid, 12316 Invalid, 0 Unknown, 0 Unchecked, 7.3s Time] [2022-07-13 18:19:16,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22107 states. [2022-07-13 18:19:17,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22107 to 11273. [2022-07-13 18:19:17,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11273 states, 8504 states have (on average 1.3065616180620885) internal successors, (11111), 8570 states have internal predecessors, (11111), 1785 states have call successors, (1785), 983 states have call predecessors, (1785), 983 states have return successors, (1785), 1719 states have call predecessors, (1785), 1785 states have call successors, (1785) [2022-07-13 18:19:17,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11273 states to 11273 states and 14681 transitions. [2022-07-13 18:19:17,755 INFO L78 Accepts]: Start accepts. Automaton has 11273 states and 14681 transitions. Word has length 198 [2022-07-13 18:19:17,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:19:17,756 INFO L495 AbstractCegarLoop]: Abstraction has 11273 states and 14681 transitions. [2022-07-13 18:19:17,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 14.375) internal successors, (345), 24 states have internal predecessors, (345), 9 states have call successors, (41), 5 states have call predecessors, (41), 5 states have return successors, (40), 9 states have call predecessors, (40), 9 states have call successors, (40) [2022-07-13 18:19:17,756 INFO L276 IsEmpty]: Start isEmpty. Operand 11273 states and 14681 transitions. [2022-07-13 18:19:17,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2022-07-13 18:19:17,772 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:19:17,772 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, 1, 1, 1] [2022-07-13 18:19:17,798 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-13 18:19:17,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:19:17,987 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:19:17,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:19:17,988 INFO L85 PathProgramCache]: Analyzing trace with hash 988856049, now seen corresponding path program 1 times [2022-07-13 18:19:17,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:19:17,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417361468] [2022-07-13 18:19:17,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:19:17,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:19:18,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:18,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 18:19:18,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:18,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 18:19:18,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:18,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 18:19:18,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:18,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-13 18:19:18,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:18,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-13 18:19:18,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:18,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-13 18:19:18,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:18,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-13 18:19:18,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:18,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-13 18:19:18,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:18,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-13 18:19:18,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:18,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-13 18:19:18,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:18,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-13 18:19:18,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:18,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-13 18:19:18,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:18,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-13 18:19:18,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:18,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-07-13 18:19:18,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:18,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-13 18:19:18,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:18,099 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-07-13 18:19:18,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:19:18,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417361468] [2022-07-13 18:19:18,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417361468] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:19:18,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:19:18,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 18:19:18,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310538174] [2022-07-13 18:19:18,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:19:18,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 18:19:18,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:19:18,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 18:19:18,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-13 18:19:18,102 INFO L87 Difference]: Start difference. First operand 11273 states and 14681 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-13 18:19:19,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:19:19,456 INFO L93 Difference]: Finished difference Result 21529 states and 28129 transitions. [2022-07-13 18:19:19,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 18:19:19,456 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 198 [2022-07-13 18:19:19,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:19:19,485 INFO L225 Difference]: With dead ends: 21529 [2022-07-13 18:19:19,486 INFO L226 Difference]: Without dead ends: 10523 [2022-07-13 18:19:19,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 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-13 18:19:19,504 INFO L413 NwaCegarLoop]: 255 mSDtfsCounter, 287 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 18:19:19,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 442 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 18:19:19,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10523 states. [2022-07-13 18:19:20,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10523 to 10523. [2022-07-13 18:19:20,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10523 states, 7946 states have (on average 1.30845708532595) internal successors, (10397), 8008 states have internal predecessors, (10397), 1663 states have call successors, (1663), 913 states have call predecessors, (1663), 913 states have return successors, (1663), 1601 states have call predecessors, (1663), 1663 states have call successors, (1663) [2022-07-13 18:19:20,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10523 states to 10523 states and 13723 transitions. [2022-07-13 18:19:20,832 INFO L78 Accepts]: Start accepts. Automaton has 10523 states and 13723 transitions. Word has length 198 [2022-07-13 18:19:20,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:19:20,833 INFO L495 AbstractCegarLoop]: Abstraction has 10523 states and 13723 transitions. [2022-07-13 18:19:20,833 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, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-13 18:19:20,833 INFO L276 IsEmpty]: Start isEmpty. Operand 10523 states and 13723 transitions. [2022-07-13 18:19:20,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-07-13 18:19:20,844 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:19:20,845 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, 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] [2022-07-13 18:19:20,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-07-13 18:19:20,845 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:19:20,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:19:20,845 INFO L85 PathProgramCache]: Analyzing trace with hash 2041661109, now seen corresponding path program 1 times [2022-07-13 18:19:20,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:19:20,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552464573] [2022-07-13 18:19:20,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:19:20,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:19:20,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:21,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 18:19:21,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:21,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 18:19:21,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:21,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 18:19:21,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:21,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-13 18:19:21,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:21,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-13 18:19:21,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:21,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-13 18:19:21,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:21,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-13 18:19:21,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:21,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-13 18:19:21,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:21,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-13 18:19:21,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:21,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-13 18:19:21,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:21,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-13 18:19:21,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:21,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-13 18:19:21,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:21,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-13 18:19:21,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:21,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-13 18:19:21,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:21,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-13 18:19:21,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:21,034 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 29 proven. 19 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-07-13 18:19:21,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:19:21,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552464573] [2022-07-13 18:19:21,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552464573] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:19:21,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1866729274] [2022-07-13 18:19:21,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:19:21,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:19:21,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:19:21,036 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-13 18:19:21,087 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-13 18:19:21,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:21,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 823 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-13 18:19:21,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:19:21,373 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 66 proven. 4 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-13 18:19:21,373 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:19:21,498 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 43 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-07-13 18:19:21,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1866729274] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 18:19:21,499 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 18:19:21,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 17 [2022-07-13 18:19:21,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535798356] [2022-07-13 18:19:21,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 18:19:21,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-13 18:19:21,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:19:21,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-13 18:19:21,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2022-07-13 18:19:21,501 INFO L87 Difference]: Start difference. First operand 10523 states and 13723 transitions. Second operand has 17 states, 17 states have (on average 15.235294117647058) internal successors, (259), 16 states have internal predecessors, (259), 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-13 18:19:28,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:19:28,547 INFO L93 Difference]: Finished difference Result 32522 states and 44939 transitions. [2022-07-13 18:19:28,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-07-13 18:19:28,548 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 15.235294117647058) internal successors, (259), 16 states have internal predecessors, (259), 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 199 [2022-07-13 18:19:28,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:19:28,613 INFO L225 Difference]: With dead ends: 32522 [2022-07-13 18:19:28,614 INFO L226 Difference]: Without dead ends: 22305 [2022-07-13 18:19:28,632 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 430 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2052 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=886, Invalid=5594, Unknown=0, NotChecked=0, Total=6480 [2022-07-13 18:19:28,633 INFO L413 NwaCegarLoop]: 644 mSDtfsCounter, 3052 mSDsluCounter, 6315 mSDsCounter, 0 mSdLazyCounter, 5308 mSolverCounterSat, 1476 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3052 SdHoareTripleChecker+Valid, 6959 SdHoareTripleChecker+Invalid, 6784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1476 IncrementalHoareTripleChecker+Valid, 5308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-07-13 18:19:28,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3052 Valid, 6959 Invalid, 6784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1476 Valid, 5308 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-07-13 18:19:28,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22305 states. [2022-07-13 18:19:30,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22305 to 11869. [2022-07-13 18:19:30,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11869 states, 8972 states have (on average 1.3039456085599643) internal successors, (11699), 9042 states have internal predecessors, (11699), 1863 states have call successors, (1863), 1033 states have call predecessors, (1863), 1033 states have return successors, (1863), 1793 states have call predecessors, (1863), 1863 states have call successors, (1863) [2022-07-13 18:19:30,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11869 states to 11869 states and 15425 transitions. [2022-07-13 18:19:30,354 INFO L78 Accepts]: Start accepts. Automaton has 11869 states and 15425 transitions. Word has length 199 [2022-07-13 18:19:30,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:19:30,354 INFO L495 AbstractCegarLoop]: Abstraction has 11869 states and 15425 transitions. [2022-07-13 18:19:30,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 15.235294117647058) internal successors, (259), 16 states have internal predecessors, (259), 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-13 18:19:30,355 INFO L276 IsEmpty]: Start isEmpty. Operand 11869 states and 15425 transitions. [2022-07-13 18:19:30,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-07-13 18:19:30,367 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:19:30,367 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 18:19:30,385 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-13 18:19:30,568 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,SelfDestructingSolverStorable33 [2022-07-13 18:19:30,568 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:19:30,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:19:30,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1117795559, now seen corresponding path program 1 times [2022-07-13 18:19:30,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:19:30,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437483898] [2022-07-13 18:19:30,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:19:30,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:19:30,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:30,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 18:19:30,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:30,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 18:19:30,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:30,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 18:19:30,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:30,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-13 18:19:30,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:30,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-13 18:19:30,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:30,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-13 18:19:30,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:30,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-13 18:19:30,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:30,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-13 18:19:30,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:30,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-13 18:19:30,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:30,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-13 18:19:30,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:30,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-13 18:19:30,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:30,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-13 18:19:30,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:30,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-13 18:19:30,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:30,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-13 18:19:30,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:30,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-13 18:19:30,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:30,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-13 18:19:30,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:30,629 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-07-13 18:19:30,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:19:30,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437483898] [2022-07-13 18:19:30,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437483898] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:19:30,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:19:30,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 18:19:30,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253994338] [2022-07-13 18:19:30,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:19:30,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 18:19:30,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:19:30,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 18:19:30,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 18:19:30,631 INFO L87 Difference]: Start difference. First operand 11869 states and 15425 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, (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-13 18:19:32,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:19:32,021 INFO L93 Difference]: Finished difference Result 22325 states and 29122 transitions. [2022-07-13 18:19:32,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 18:19:32,021 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, (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 207 [2022-07-13 18:19:32,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:19:32,051 INFO L225 Difference]: With dead ends: 22325 [2022-07-13 18:19:32,051 INFO L226 Difference]: Without dead ends: 10725 [2022-07-13 18:19:32,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 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-13 18:19:32,069 INFO L413 NwaCegarLoop]: 265 mSDtfsCounter, 233 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 18:19:32,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 492 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 18:19:32,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10725 states. [2022-07-13 18:19:33,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10725 to 10693. [2022-07-13 18:19:33,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10693 states, 8112 states have (on average 1.3037475345167653) internal successors, (10576), 8174 states have internal predecessors, (10576), 1665 states have call successors, (1665), 915 states have call predecessors, (1665), 915 states have return successors, (1665), 1603 states have call predecessors, (1665), 1665 states have call successors, (1665) [2022-07-13 18:19:33,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10693 states to 10693 states and 13906 transitions. [2022-07-13 18:19:33,408 INFO L78 Accepts]: Start accepts. Automaton has 10693 states and 13906 transitions. Word has length 207 [2022-07-13 18:19:33,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:19:33,408 INFO L495 AbstractCegarLoop]: Abstraction has 10693 states and 13906 transitions. [2022-07-13 18:19:33,409 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, (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-13 18:19:33,409 INFO L276 IsEmpty]: Start isEmpty. Operand 10693 states and 13906 transitions. [2022-07-13 18:19:33,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-07-13 18:19:33,419 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:19:33,419 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-13 18:19:33,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-07-13 18:19:33,419 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:19:33,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:19:33,420 INFO L85 PathProgramCache]: Analyzing trace with hash 147970794, now seen corresponding path program 1 times [2022-07-13 18:19:33,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:19:33,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024584174] [2022-07-13 18:19:33,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:19:33,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:19:33,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:33,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 18:19:33,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:33,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 18:19:33,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:33,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-13 18:19:33,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:33,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-13 18:19:33,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:33,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-13 18:19:33,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:33,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-13 18:19:33,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:33,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-13 18:19:33,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:33,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-13 18:19:33,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:33,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-13 18:19:33,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:33,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-13 18:19:33,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:33,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-13 18:19:33,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:33,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-13 18:19:33,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:33,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-13 18:19:33,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:33,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-13 18:19:33,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:33,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-13 18:19:33,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:33,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-07-13 18:19:33,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:33,520 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 14 proven. 46 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2022-07-13 18:19:33,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:19:33,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024584174] [2022-07-13 18:19:33,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024584174] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:19:33,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331803029] [2022-07-13 18:19:33,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:19:33,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:19:33,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:19:33,524 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 18:19:33,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-13 18:19:33,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:33,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 842 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 18:19:33,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:19:33,958 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 8 proven. 115 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-13 18:19:33,958 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:19:34,132 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 14 proven. 46 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2022-07-13 18:19:34,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1331803029] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 18:19:34,133 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 18:19:34,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 10 [2022-07-13 18:19:34,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053312012] [2022-07-13 18:19:34,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 18:19:34,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 18:19:34,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:19:34,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 18:19:34,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-13 18:19:34,134 INFO L87 Difference]: Start difference. First operand 10693 states and 13906 transitions. Second operand has 10 states, 10 states have (on average 18.8) internal successors, (188), 9 states have internal predecessors, (188), 4 states have call successors, (34), 5 states have call predecessors, (34), 7 states have return successors, (33), 4 states have call predecessors, (33), 3 states have call successors, (33) [2022-07-13 18:19:37,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:19:37,373 INFO L93 Difference]: Finished difference Result 33530 states and 43784 transitions. [2022-07-13 18:19:37,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-13 18:19:37,373 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 18.8) internal successors, (188), 9 states have internal predecessors, (188), 4 states have call successors, (34), 5 states have call predecessors, (34), 7 states have return successors, (33), 4 states have call predecessors, (33), 3 states have call successors, (33) Word has length 208 [2022-07-13 18:19:37,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:19:37,417 INFO L225 Difference]: With dead ends: 33530 [2022-07-13 18:19:37,418 INFO L226 Difference]: Without dead ends: 23272 [2022-07-13 18:19:37,437 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 466 GetRequests, 447 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2022-07-13 18:19:37,438 INFO L413 NwaCegarLoop]: 403 mSDtfsCounter, 784 mSDsluCounter, 2226 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 789 SdHoareTripleChecker+Valid, 2629 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 18:19:37,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [789 Valid, 2629 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 18:19:37,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23272 states. [2022-07-13 18:19:39,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23272 to 16703. [2022-07-13 18:19:39,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16703 states, 12786 states have (on average 1.288596902862506) internal successors, (16476), 12901 states have internal predecessors, (16476), 2494 states have call successors, (2494), 1422 states have call predecessors, (2494), 1422 states have return successors, (2494), 2379 states have call predecessors, (2494), 2494 states have call successors, (2494) [2022-07-13 18:19:39,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16703 states to 16703 states and 21464 transitions. [2022-07-13 18:19:39,697 INFO L78 Accepts]: Start accepts. Automaton has 16703 states and 21464 transitions. Word has length 208 [2022-07-13 18:19:39,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:19:39,698 INFO L495 AbstractCegarLoop]: Abstraction has 16703 states and 21464 transitions. [2022-07-13 18:19:39,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.8) internal successors, (188), 9 states have internal predecessors, (188), 4 states have call successors, (34), 5 states have call predecessors, (34), 7 states have return successors, (33), 4 states have call predecessors, (33), 3 states have call successors, (33) [2022-07-13 18:19:39,698 INFO L276 IsEmpty]: Start isEmpty. Operand 16703 states and 21464 transitions. [2022-07-13 18:19:39,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-07-13 18:19:39,707 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:19:39,707 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, 1, 1, 1, 1, 1] [2022-07-13 18:19:39,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-13 18:19:39,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:19:39,917 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:19:39,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:19:39,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1640642370, now seen corresponding path program 1 times [2022-07-13 18:19:39,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:19:39,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792959611] [2022-07-13 18:19:39,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:19:39,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:19:39,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:40,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 18:19:40,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:40,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 18:19:40,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:40,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 18:19:40,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:40,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-13 18:19:40,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:40,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-13 18:19:40,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:40,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-13 18:19:40,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:40,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-13 18:19:40,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:40,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-13 18:19:40,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:40,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-13 18:19:40,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:40,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-13 18:19:40,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:40,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-13 18:19:40,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:40,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-13 18:19:40,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:40,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-13 18:19:40,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:40,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-13 18:19:40,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:40,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-13 18:19:40,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:40,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-13 18:19:40,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:40,038 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 29 proven. 6 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-07-13 18:19:40,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:19:40,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792959611] [2022-07-13 18:19:40,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792959611] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:19:40,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642707098] [2022-07-13 18:19:40,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:19:40,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:19:40,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:19:40,044 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 18:19:40,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-13 18:19:40,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:40,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 842 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 18:19:40,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:19:40,367 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 67 proven. 4 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-13 18:19:40,368 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:19:40,525 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 29 proven. 6 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-07-13 18:19:40,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [642707098] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 18:19:40,526 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 18:19:40,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2022-07-13 18:19:40,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273038397] [2022-07-13 18:19:40,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 18:19:40,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 18:19:40,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:19:40,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 18:19:40,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-13 18:19:40,529 INFO L87 Difference]: Start difference. First operand 16703 states and 21464 transitions. Second operand has 9 states, 9 states have (on average 20.333333333333332) internal successors, (183), 8 states have internal predecessors, (183), 3 states have call successors, (30), 4 states have call predecessors, (30), 7 states have return successors, (31), 4 states have call predecessors, (31), 3 states have call successors, (31) [2022-07-13 18:19:44,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:19:44,421 INFO L93 Difference]: Finished difference Result 38927 states and 51697 transitions. [2022-07-13 18:19:44,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 18:19:44,422 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 20.333333333333332) internal successors, (183), 8 states have internal predecessors, (183), 3 states have call successors, (30), 4 states have call predecessors, (30), 7 states have return successors, (31), 4 states have call predecessors, (31), 3 states have call successors, (31) Word has length 208 [2022-07-13 18:19:44,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:19:44,617 INFO L225 Difference]: With dead ends: 38927 [2022-07-13 18:19:44,618 INFO L226 Difference]: Without dead ends: 22530 [2022-07-13 18:19:44,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 445 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-07-13 18:19:44,642 INFO L413 NwaCegarLoop]: 425 mSDtfsCounter, 284 mSDsluCounter, 1865 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 2290 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 18:19:44,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 2290 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 18:19:44,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22530 states. [2022-07-13 18:19:47,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22530 to 16703. [2022-07-13 18:19:47,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16703 states, 12786 states have (on average 1.2882058501486) internal successors, (16471), 12901 states have internal predecessors, (16471), 2494 states have call successors, (2494), 1422 states have call predecessors, (2494), 1422 states have return successors, (2494), 2379 states have call predecessors, (2494), 2494 states have call successors, (2494) [2022-07-13 18:19:47,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16703 states to 16703 states and 21459 transitions. [2022-07-13 18:19:48,015 INFO L78 Accepts]: Start accepts. Automaton has 16703 states and 21459 transitions. Word has length 208 [2022-07-13 18:19:48,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:19:48,016 INFO L495 AbstractCegarLoop]: Abstraction has 16703 states and 21459 transitions. [2022-07-13 18:19:48,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 20.333333333333332) internal successors, (183), 8 states have internal predecessors, (183), 3 states have call successors, (30), 4 states have call predecessors, (30), 7 states have return successors, (31), 4 states have call predecessors, (31), 3 states have call successors, (31) [2022-07-13 18:19:48,016 INFO L276 IsEmpty]: Start isEmpty. Operand 16703 states and 21459 transitions. [2022-07-13 18:19:48,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2022-07-13 18:19:48,026 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:19:48,026 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, 1, 1, 1] [2022-07-13 18:19:48,053 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-13 18:19:48,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:19:48,248 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:19:48,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:19:48,248 INFO L85 PathProgramCache]: Analyzing trace with hash 2029022934, now seen corresponding path program 1 times [2022-07-13 18:19:48,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:19:48,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028947262] [2022-07-13 18:19:48,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:19:48,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:19:48,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:48,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 18:19:48,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:48,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 18:19:48,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:48,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 18:19:48,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:48,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-13 18:19:48,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:48,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-13 18:19:48,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:48,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-13 18:19:48,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:48,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-13 18:19:48,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:48,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-13 18:19:48,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:48,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-13 18:19:48,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:48,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-13 18:19:48,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:48,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-13 18:19:48,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:48,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-13 18:19:48,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:48,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-13 18:19:48,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:48,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-13 18:19:48,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:48,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-13 18:19:48,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:48,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-13 18:19:48,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:48,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-07-13 18:19:48,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:48,689 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 15 proven. 19 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2022-07-13 18:19:48,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:19:48,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028947262] [2022-07-13 18:19:48,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028947262] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:19:48,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202604029] [2022-07-13 18:19:48,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:19:48,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:19:48,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:19:48,703 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 18:19:48,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-13 18:19:48,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:19:48,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 859 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-13 18:19:48,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:19:50,003 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 68 proven. 27 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-13 18:19:50,003 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:19:51,081 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 15 proven. 19 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2022-07-13 18:19:51,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [202604029] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 18:19:51,082 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 18:19:51,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 10] total 22 [2022-07-13 18:19:51,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325871825] [2022-07-13 18:19:51,082 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 18:19:51,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-13 18:19:51,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:19:51,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-13 18:19:51,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2022-07-13 18:19:51,083 INFO L87 Difference]: Start difference. First operand 16703 states and 21459 transitions. Second operand has 22 states, 22 states have (on average 16.954545454545453) internal successors, (373), 22 states have internal predecessors, (373), 10 states have call successors, (47), 5 states have call predecessors, (47), 5 states have return successors, (46), 10 states have call predecessors, (46), 10 states have call successors, (46) [2022-07-13 18:19:57,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:19:57,899 INFO L93 Difference]: Finished difference Result 39985 states and 53432 transitions. [2022-07-13 18:19:57,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-07-13 18:19:57,900 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 16.954545454545453) internal successors, (373), 22 states have internal predecessors, (373), 10 states have call successors, (47), 5 states have call predecessors, (47), 5 states have return successors, (46), 10 states have call predecessors, (46), 10 states have call successors, (46) Word has length 215 [2022-07-13 18:19:57,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:19:57,981 INFO L225 Difference]: With dead ends: 39985 [2022-07-13 18:19:57,982 INFO L226 Difference]: Without dead ends: 26697 [2022-07-13 18:19:58,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 504 GetRequests, 452 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 603 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=643, Invalid=1907, Unknown=0, NotChecked=0, Total=2550 [2022-07-13 18:19:58,007 INFO L413 NwaCegarLoop]: 452 mSDtfsCounter, 3590 mSDsluCounter, 2589 mSDsCounter, 0 mSdLazyCounter, 2703 mSolverCounterSat, 785 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3591 SdHoareTripleChecker+Valid, 3041 SdHoareTripleChecker+Invalid, 3488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 785 IncrementalHoareTripleChecker+Valid, 2703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-13 18:19:58,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3591 Valid, 3041 Invalid, 3488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [785 Valid, 2703 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-07-13 18:19:58,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26697 states. [2022-07-13 18:20:00,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26697 to 14070. [2022-07-13 18:20:00,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14070 states, 10675 states have (on average 1.2816861826697892) internal successors, (13682), 10776 states have internal predecessors, (13682), 2181 states have call successors, (2181), 1213 states have call predecessors, (2181), 1213 states have return successors, (2181), 2080 states have call predecessors, (2181), 2181 states have call successors, (2181) [2022-07-13 18:20:00,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14070 states to 14070 states and 18044 transitions. [2022-07-13 18:20:00,772 INFO L78 Accepts]: Start accepts. Automaton has 14070 states and 18044 transitions. Word has length 215 [2022-07-13 18:20:00,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:20:00,772 INFO L495 AbstractCegarLoop]: Abstraction has 14070 states and 18044 transitions. [2022-07-13 18:20:00,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 16.954545454545453) internal successors, (373), 22 states have internal predecessors, (373), 10 states have call successors, (47), 5 states have call predecessors, (47), 5 states have return successors, (46), 10 states have call predecessors, (46), 10 states have call successors, (46) [2022-07-13 18:20:00,773 INFO L276 IsEmpty]: Start isEmpty. Operand 14070 states and 18044 transitions. [2022-07-13 18:20:00,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2022-07-13 18:20:00,781 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:20:00,781 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 18:20:00,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-13 18:20:01,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-07-13 18:20:01,006 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:20:01,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:20:01,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1439794329, now seen corresponding path program 1 times [2022-07-13 18:20:01,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:20:01,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357390932] [2022-07-13 18:20:01,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:20:01,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:20:01,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:01,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 18:20:01,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:01,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 18:20:01,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:01,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 18:20:01,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:01,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-13 18:20:01,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:01,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-13 18:20:01,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:01,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-13 18:20:01,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:01,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-13 18:20:01,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:01,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-13 18:20:01,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:01,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-13 18:20:01,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:01,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-13 18:20:01,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:01,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-13 18:20:01,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:01,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-13 18:20:01,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:01,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-13 18:20:01,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:01,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-13 18:20:01,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:01,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-13 18:20:01,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:01,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-13 18:20:01,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:01,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-07-13 18:20:01,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:01,253 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 27 proven. 8 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2022-07-13 18:20:01,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:20:01,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357390932] [2022-07-13 18:20:01,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357390932] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:20:01,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198979387] [2022-07-13 18:20:01,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:20:01,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:20:01,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:20:01,256 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 18:20:01,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-13 18:20:01,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:01,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 861 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-13 18:20:01,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:20:01,677 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 80 proven. 16 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-13 18:20:01,677 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:20:02,032 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 27 proven. 8 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2022-07-13 18:20:02,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1198979387] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 18:20:02,033 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 18:20:02,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 8] total 14 [2022-07-13 18:20:02,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468169236] [2022-07-13 18:20:02,033 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 18:20:02,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 18:20:02,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:20:02,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 18:20:02,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-07-13 18:20:02,035 INFO L87 Difference]: Start difference. First operand 14070 states and 18044 transitions. Second operand has 14 states, 14 states have (on average 18.428571428571427) internal successors, (258), 14 states have internal predecessors, (258), 6 states have call successors, (45), 4 states have call predecessors, (45), 4 states have return successors, (44), 6 states have call predecessors, (44), 6 states have call successors, (44) [2022-07-13 18:20:09,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:20:09,844 INFO L93 Difference]: Finished difference Result 43858 states and 59285 transitions. [2022-07-13 18:20:09,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-07-13 18:20:09,845 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 18.428571428571427) internal successors, (258), 14 states have internal predecessors, (258), 6 states have call successors, (45), 4 states have call predecessors, (45), 4 states have return successors, (44), 6 states have call predecessors, (44), 6 states have call successors, (44) Word has length 216 [2022-07-13 18:20:09,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:20:09,910 INFO L225 Difference]: With dead ends: 43858 [2022-07-13 18:20:09,911 INFO L226 Difference]: Without dead ends: 31438 [2022-07-13 18:20:09,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 549 GetRequests, 473 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2124 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=952, Invalid=5054, Unknown=0, NotChecked=0, Total=6006 [2022-07-13 18:20:09,930 INFO L413 NwaCegarLoop]: 982 mSDtfsCounter, 2474 mSDsluCounter, 6173 mSDsCounter, 0 mSdLazyCounter, 1554 mSolverCounterSat, 806 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2574 SdHoareTripleChecker+Valid, 7155 SdHoareTripleChecker+Invalid, 2360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 806 IncrementalHoareTripleChecker+Valid, 1554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-13 18:20:09,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2574 Valid, 7155 Invalid, 2360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [806 Valid, 1554 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-13 18:20:09,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31438 states. [2022-07-13 18:20:12,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31438 to 17971. [2022-07-13 18:20:12,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17971 states, 13831 states have (on average 1.2728653025811583) internal successors, (17605), 13950 states have internal predecessors, (17605), 2623 states have call successors, (2623), 1516 states have call predecessors, (2623), 1516 states have return successors, (2623), 2504 states have call predecessors, (2623), 2623 states have call successors, (2623) [2022-07-13 18:20:12,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17971 states to 17971 states and 22851 transitions. [2022-07-13 18:20:12,710 INFO L78 Accepts]: Start accepts. Automaton has 17971 states and 22851 transitions. Word has length 216 [2022-07-13 18:20:12,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:20:12,710 INFO L495 AbstractCegarLoop]: Abstraction has 17971 states and 22851 transitions. [2022-07-13 18:20:12,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 18.428571428571427) internal successors, (258), 14 states have internal predecessors, (258), 6 states have call successors, (45), 4 states have call predecessors, (45), 4 states have return successors, (44), 6 states have call predecessors, (44), 6 states have call successors, (44) [2022-07-13 18:20:12,711 INFO L276 IsEmpty]: Start isEmpty. Operand 17971 states and 22851 transitions. [2022-07-13 18:20:12,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2022-07-13 18:20:12,718 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:20:12,719 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 18:20:12,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-13 18:20:12,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-07-13 18:20:12,920 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:20:12,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:20:12,920 INFO L85 PathProgramCache]: Analyzing trace with hash 71333719, now seen corresponding path program 1 times [2022-07-13 18:20:12,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:20:12,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594933363] [2022-07-13 18:20:12,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:20:12,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:20:12,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:12,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 18:20:12,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:12,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 18:20:12,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:12,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 18:20:12,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:12,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-13 18:20:12,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:12,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-13 18:20:12,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:12,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-13 18:20:12,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:12,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-13 18:20:12,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:12,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-13 18:20:12,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:12,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-13 18:20:12,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:12,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-13 18:20:12,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:12,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-13 18:20:12,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:12,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-13 18:20:12,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:12,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-13 18:20:12,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:12,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-13 18:20:12,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:12,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-13 18:20:12,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:12,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-13 18:20:12,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:12,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-07-13 18:20:12,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:12,994 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2022-07-13 18:20:12,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:20:12,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594933363] [2022-07-13 18:20:12,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594933363] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:20:12,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:20:12,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 18:20:12,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852124699] [2022-07-13 18:20:12,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:20:12,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 18:20:12,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:20:12,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 18:20:12,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 18:20:12,997 INFO L87 Difference]: Start difference. First operand 17971 states and 22851 transitions. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 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-13 18:20:15,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:20:15,149 INFO L93 Difference]: Finished difference Result 30612 states and 39107 transitions. [2022-07-13 18:20:15,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 18:20:15,149 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 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 216 [2022-07-13 18:20:15,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:20:15,177 INFO L225 Difference]: With dead ends: 30612 [2022-07-13 18:20:15,177 INFO L226 Difference]: Without dead ends: 13650 [2022-07-13 18:20:15,197 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-13 18:20:15,198 INFO L413 NwaCegarLoop]: 261 mSDtfsCounter, 239 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 18:20:15,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 488 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 18:20:15,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13650 states. [2022-07-13 18:20:17,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13650 to 13607. [2022-07-13 18:20:17,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13607 states, 10554 states have (on average 1.2748720864127345) internal successors, (13455), 10636 states have internal predecessors, (13455), 1931 states have call successors, (1931), 1121 states have call predecessors, (1931), 1121 states have return successors, (1931), 1849 states have call predecessors, (1931), 1931 states have call successors, (1931) [2022-07-13 18:20:17,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13607 states to 13607 states and 17317 transitions. [2022-07-13 18:20:17,628 INFO L78 Accepts]: Start accepts. Automaton has 13607 states and 17317 transitions. Word has length 216 [2022-07-13 18:20:17,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:20:17,629 INFO L495 AbstractCegarLoop]: Abstraction has 13607 states and 17317 transitions. [2022-07-13 18:20:17,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 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-13 18:20:17,629 INFO L276 IsEmpty]: Start isEmpty. Operand 13607 states and 17317 transitions. [2022-07-13 18:20:17,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2022-07-13 18:20:17,636 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:20:17,636 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 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, 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] [2022-07-13 18:20:17,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-07-13 18:20:17,636 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:20:17,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:20:17,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1981403120, now seen corresponding path program 1 times [2022-07-13 18:20:17,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:20:17,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446038189] [2022-07-13 18:20:17,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:20:17,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:20:17,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:17,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 18:20:17,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:17,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 18:20:17,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:17,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-13 18:20:17,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:17,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-13 18:20:17,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:17,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-13 18:20:17,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:17,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-13 18:20:17,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:17,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-13 18:20:17,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:17,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-13 18:20:17,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:17,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-13 18:20:17,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:17,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-13 18:20:17,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:17,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-13 18:20:17,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:17,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-13 18:20:17,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:17,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-07-13 18:20:17,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:17,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-13 18:20:17,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:17,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-13 18:20:17,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:17,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-13 18:20:17,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:17,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-07-13 18:20:17,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:17,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-07-13 18:20:17,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:17,722 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2022-07-13 18:20:17,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:20:17,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446038189] [2022-07-13 18:20:17,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446038189] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:20:17,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:20:17,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 18:20:17,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801207162] [2022-07-13 18:20:17,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:20:17,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 18:20:17,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:20:17,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 18:20:17,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 18:20:17,724 INFO L87 Difference]: Start difference. First operand 13607 states and 17317 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-13 18:20:23,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:20:23,712 INFO L93 Difference]: Finished difference Result 35344 states and 45987 transitions. [2022-07-13 18:20:23,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 18:20:23,712 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) Word has length 217 [2022-07-13 18:20:23,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:20:23,785 INFO L225 Difference]: With dead ends: 35344 [2022-07-13 18:20:23,785 INFO L226 Difference]: Without dead ends: 25650 [2022-07-13 18:20:23,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 41 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-13 18:20:23,806 INFO L413 NwaCegarLoop]: 586 mSDtfsCounter, 615 mSDsluCounter, 2428 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 3014 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 18:20:23,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [630 Valid, 3014 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 18:20:23,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25650 states. [2022-07-13 18:20:27,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25650 to 16802. [2022-07-13 18:20:27,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16802 states, 12872 states have (on average 1.2675574891236794) internal successors, (16316), 12986 states have internal predecessors, (16316), 2488 states have call successors, (2488), 1441 states have call predecessors, (2488), 1441 states have return successors, (2488), 2374 states have call predecessors, (2488), 2488 states have call successors, (2488) [2022-07-13 18:20:27,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16802 states to 16802 states and 21292 transitions. [2022-07-13 18:20:27,350 INFO L78 Accepts]: Start accepts. Automaton has 16802 states and 21292 transitions. Word has length 217 [2022-07-13 18:20:27,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:20:27,350 INFO L495 AbstractCegarLoop]: Abstraction has 16802 states and 21292 transitions. [2022-07-13 18:20:27,350 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-13 18:20:27,350 INFO L276 IsEmpty]: Start isEmpty. Operand 16802 states and 21292 transitions. [2022-07-13 18:20:27,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2022-07-13 18:20:27,358 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:20:27,358 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 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, 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-13 18:20:27,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-07-13 18:20:27,358 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:20:27,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:20:27,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1125932149, now seen corresponding path program 1 times [2022-07-13 18:20:27,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:20:27,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566763635] [2022-07-13 18:20:27,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:20:27,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:20:27,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:27,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 18:20:27,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:27,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 18:20:27,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:27,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-13 18:20:27,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:27,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-13 18:20:27,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:27,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-13 18:20:27,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:27,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-13 18:20:27,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:27,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-13 18:20:27,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:27,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-13 18:20:27,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:27,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-13 18:20:27,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:27,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-13 18:20:27,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:27,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-13 18:20:27,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:27,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-13 18:20:27,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:27,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-13 18:20:27,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:27,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-13 18:20:27,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:27,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-13 18:20:27,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:27,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-07-13 18:20:27,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:27,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-07-13 18:20:27,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:27,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2022-07-13 18:20:27,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:27,525 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 41 proven. 10 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-07-13 18:20:27,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:20:27,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566763635] [2022-07-13 18:20:27,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566763635] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:20:27,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74959415] [2022-07-13 18:20:27,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:20:27,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:20:27,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:20:27,528 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 18:20:27,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-13 18:20:27,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:27,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 873 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-13 18:20:27,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:20:27,833 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-07-13 18:20:27,834 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 18:20:27,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74959415] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:20:27,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 18:20:27,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2022-07-13 18:20:27,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162977833] [2022-07-13 18:20:27,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:20:27,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 18:20:27,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:20:27,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 18:20:27,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2022-07-13 18:20:27,836 INFO L87 Difference]: Start difference. First operand 16802 states and 21292 transitions. Second operand has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 6 states have internal predecessors, (152), 3 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2022-07-13 18:20:31,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:20:31,585 INFO L93 Difference]: Finished difference Result 36219 states and 47080 transitions. [2022-07-13 18:20:31,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 18:20:31,586 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 6 states have internal predecessors, (152), 3 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) Word has length 218 [2022-07-13 18:20:31,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:20:31,628 INFO L225 Difference]: With dead ends: 36219 [2022-07-13 18:20:31,628 INFO L226 Difference]: Without dead ends: 20739 [2022-07-13 18:20:31,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2022-07-13 18:20:31,649 INFO L413 NwaCegarLoop]: 612 mSDtfsCounter, 674 mSDsluCounter, 1610 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 674 SdHoareTripleChecker+Valid, 2222 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 18:20:31,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [674 Valid, 2222 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 18:20:31,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20739 states. [2022-07-13 18:20:34,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20739 to 16802. [2022-07-13 18:20:34,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16802 states, 12872 states have (on average 1.2608763206960845) internal successors, (16230), 12986 states have internal predecessors, (16230), 2488 states have call successors, (2488), 1441 states have call predecessors, (2488), 1441 states have return successors, (2488), 2374 states have call predecessors, (2488), 2488 states have call successors, (2488) [2022-07-13 18:20:34,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16802 states to 16802 states and 21206 transitions. [2022-07-13 18:20:34,435 INFO L78 Accepts]: Start accepts. Automaton has 16802 states and 21206 transitions. Word has length 218 [2022-07-13 18:20:34,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:20:34,436 INFO L495 AbstractCegarLoop]: Abstraction has 16802 states and 21206 transitions. [2022-07-13 18:20:34,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 6 states have internal predecessors, (152), 3 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2022-07-13 18:20:34,438 INFO L276 IsEmpty]: Start isEmpty. Operand 16802 states and 21206 transitions. [2022-07-13 18:20:34,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2022-07-13 18:20:34,460 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:20:34,460 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 18:20:34,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-13 18:20:34,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2022-07-13 18:20:34,680 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:20:34,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:20:34,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1772199745, now seen corresponding path program 1 times [2022-07-13 18:20:34,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:20:34,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266148269] [2022-07-13 18:20:34,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:20:34,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:20:34,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:34,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 18:20:34,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:34,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 18:20:34,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:34,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 18:20:34,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:34,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-13 18:20:34,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:34,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-13 18:20:34,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:34,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-13 18:20:34,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:34,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-13 18:20:34,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:34,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-13 18:20:34,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:34,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-13 18:20:34,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:34,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-13 18:20:34,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:34,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-13 18:20:34,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:34,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-13 18:20:34,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:34,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-13 18:20:34,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:34,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-13 18:20:34,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:34,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-13 18:20:34,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:34,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-13 18:20:34,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:34,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-07-13 18:20:34,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:34,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-07-13 18:20:34,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:34,882 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 25 proven. 26 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2022-07-13 18:20:34,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:20:34,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266148269] [2022-07-13 18:20:34,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266148269] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 18:20:34,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735213102] [2022-07-13 18:20:34,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:20:34,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 18:20:34,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 18:20:34,884 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 18:20:34,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-13 18:20:35,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:35,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 880 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-13 18:20:35,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 18:20:35,291 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 66 proven. 60 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-13 18:20:35,292 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 18:20:35,543 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 25 proven. 26 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2022-07-13 18:20:35,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1735213102] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 18:20:35,544 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 18:20:35,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 12 [2022-07-13 18:20:35,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516171868] [2022-07-13 18:20:35,545 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 18:20:35,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-13 18:20:35,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:20:35,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-13 18:20:35,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-07-13 18:20:35,547 INFO L87 Difference]: Start difference. First operand 16802 states and 21206 transitions. Second operand has 12 states, 12 states have (on average 19.333333333333332) internal successors, (232), 11 states have internal predecessors, (232), 5 states have call successors, (37), 4 states have call predecessors, (37), 7 states have return successors, (37), 6 states have call predecessors, (37), 5 states have call successors, (37) [2022-07-13 18:20:40,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:20:40,250 INFO L93 Difference]: Finished difference Result 32039 states and 40782 transitions. [2022-07-13 18:20:40,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-13 18:20:40,251 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 19.333333333333332) internal successors, (232), 11 states have internal predecessors, (232), 5 states have call successors, (37), 4 states have call predecessors, (37), 7 states have return successors, (37), 6 states have call predecessors, (37), 5 states have call successors, (37) Word has length 224 [2022-07-13 18:20:40,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:20:40,302 INFO L225 Difference]: With dead ends: 32039 [2022-07-13 18:20:40,303 INFO L226 Difference]: Without dead ends: 19596 [2022-07-13 18:20:40,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 481 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2022-07-13 18:20:40,323 INFO L413 NwaCegarLoop]: 846 mSDtfsCounter, 1267 mSDsluCounter, 3101 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 337 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1279 SdHoareTripleChecker+Valid, 3947 SdHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 337 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 18:20:40,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1279 Valid, 3947 Invalid, 872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [337 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 18:20:40,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19596 states. [2022-07-13 18:20:44,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19596 to 16802. [2022-07-13 18:20:44,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16802 states, 12872 states have (on average 1.2569142324425109) internal successors, (16179), 12986 states have internal predecessors, (16179), 2488 states have call successors, (2488), 1441 states have call predecessors, (2488), 1441 states have return successors, (2488), 2374 states have call predecessors, (2488), 2488 states have call successors, (2488) [2022-07-13 18:20:44,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16802 states to 16802 states and 21155 transitions. [2022-07-13 18:20:44,110 INFO L78 Accepts]: Start accepts. Automaton has 16802 states and 21155 transitions. Word has length 224 [2022-07-13 18:20:44,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:20:44,113 INFO L495 AbstractCegarLoop]: Abstraction has 16802 states and 21155 transitions. [2022-07-13 18:20:44,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 19.333333333333332) internal successors, (232), 11 states have internal predecessors, (232), 5 states have call successors, (37), 4 states have call predecessors, (37), 7 states have return successors, (37), 6 states have call predecessors, (37), 5 states have call successors, (37) [2022-07-13 18:20:44,114 INFO L276 IsEmpty]: Start isEmpty. Operand 16802 states and 21155 transitions. [2022-07-13 18:20:44,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2022-07-13 18:20:44,123 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:20:44,123 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 18:20:44,149 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-07-13 18:20:44,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2022-07-13 18:20:44,340 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:20:44,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:20:44,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1176450, now seen corresponding path program 1 times [2022-07-13 18:20:44,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:20:44,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494905480] [2022-07-13 18:20:44,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:20:44,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:20:44,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:44,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-13 18:20:44,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:44,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 18:20:44,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:44,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-13 18:20:44,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:44,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-13 18:20:44,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:44,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-13 18:20:44,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:44,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-13 18:20:44,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:44,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-13 18:20:44,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:44,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-13 18:20:44,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:44,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-13 18:20:44,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:44,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-13 18:20:44,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:44,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-13 18:20:44,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:44,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-13 18:20:44,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:44,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-13 18:20:44,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:44,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-13 18:20:44,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:44,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-13 18:20:44,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:44,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-13 18:20:44,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:44,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-07-13 18:20:44,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:44,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2022-07-13 18:20:44,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 18:20:44,704 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2022-07-13 18:20:44,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 18:20:44,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494905480] [2022-07-13 18:20:44,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494905480] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 18:20:44,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 18:20:44,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 18:20:44,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973038675] [2022-07-13 18:20:44,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 18:20:44,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 18:20:44,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 18:20:44,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 18:20:44,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 18:20:44,705 INFO L87 Difference]: Start difference. First operand 16802 states and 21155 transitions. Second operand has 7 states, 7 states have (on average 20.285714285714285) internal successors, (142), 6 states have internal predecessors, (142), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-13 18:20:49,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 18:20:49,854 INFO L93 Difference]: Finished difference Result 32701 states and 42222 transitions. [2022-07-13 18:20:49,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 18:20:49,855 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.285714285714285) internal successors, (142), 6 states have internal predecessors, (142), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) Word has length 224 [2022-07-13 18:20:49,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 18:20:49,909 INFO L225 Difference]: With dead ends: 32701 [2022-07-13 18:20:49,909 INFO L226 Difference]: Without dead ends: 20749 [2022-07-13 18:20:49,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-07-13 18:20:49,932 INFO L413 NwaCegarLoop]: 616 mSDtfsCounter, 702 mSDsluCounter, 1996 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 2612 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 18:20:49,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [705 Valid, 2612 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 18:20:49,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20749 states. [2022-07-13 18:20:53,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20749 to 16793. [2022-07-13 18:20:53,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16793 states, 12863 states have (on average 1.2556946280027987) internal successors, (16152), 12977 states have internal predecessors, (16152), 2488 states have call successors, (2488), 1441 states have call predecessors, (2488), 1441 states have return successors, (2488), 2374 states have call predecessors, (2488), 2488 states have call successors, (2488) [2022-07-13 18:20:53,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16793 states to 16793 states and 21128 transitions. [2022-07-13 18:20:53,236 INFO L78 Accepts]: Start accepts. Automaton has 16793 states and 21128 transitions. Word has length 224 [2022-07-13 18:20:53,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 18:20:53,236 INFO L495 AbstractCegarLoop]: Abstraction has 16793 states and 21128 transitions. [2022-07-13 18:20:53,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.285714285714285) internal successors, (142), 6 states have internal predecessors, (142), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-13 18:20:53,237 INFO L276 IsEmpty]: Start isEmpty. Operand 16793 states and 21128 transitions. [2022-07-13 18:20:53,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2022-07-13 18:20:53,245 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 18:20:53,245 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 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, 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] [2022-07-13 18:20:53,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-07-13 18:20:53,245 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 18:20:53,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 18:20:53,246 INFO L85 PathProgramCache]: Analyzing trace with hash 442167154, now seen corresponding path program 1 times [2022-07-13 18:20:53,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 18:20:53,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67197503] [2022-07-13 18:20:53,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 18:20:53,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 18:20:53,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 18:20:53,289 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 18:20:53,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 18:20:53,414 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 18:20:53,415 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 18:20:53,416 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 18:20:53,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-07-13 18:20:53,420 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 18:20:53,423 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 18:20:53,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 06:20:53 BoogieIcfgContainer [2022-07-13 18:20:53,633 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 18:20:53,634 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 18:20:53,634 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 18:20:53,634 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 18:20:53,635 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 06:18:16" (3/4) ... [2022-07-13 18:20:53,636 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-13 18:20:53,828 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 18:20:53,829 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 18:20:53,830 INFO L158 Benchmark]: Toolchain (without parser) took 159596.06ms. Allocated memory was 98.6MB in the beginning and 4.8GB in the end (delta: 4.7GB). Free memory was 60.6MB in the beginning and 4.2GB in the end (delta: -4.2GB). Peak memory consumption was 514.6MB. Max. memory is 16.1GB. [2022-07-13 18:20:53,830 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 98.6MB. Free memory is still 77.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 18:20:53,830 INFO L158 Benchmark]: CACSL2BoogieTranslator took 616.22ms. Allocated memory is still 98.6MB. Free memory was 60.4MB in the beginning and 43.5MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-07-13 18:20:53,830 INFO L158 Benchmark]: Boogie Procedure Inliner took 96.23ms. Allocated memory is still 98.6MB. Free memory was 43.3MB in the beginning and 40.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 18:20:53,830 INFO L158 Benchmark]: Boogie Preprocessor took 115.88ms. Allocated memory was 98.6MB in the beginning and 123.7MB in the end (delta: 25.2MB). Free memory was 40.2MB in the beginning and 100.1MB in the end (delta: -59.9MB). Peak memory consumption was 8.2MB. Max. memory is 16.1GB. [2022-07-13 18:20:53,831 INFO L158 Benchmark]: RCFGBuilder took 1023.20ms. Allocated memory is still 123.7MB. Free memory was 100.1MB in the beginning and 72.0MB in the end (delta: 28.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-07-13 18:20:53,831 INFO L158 Benchmark]: TraceAbstraction took 157534.09ms. Allocated memory was 123.7MB in the beginning and 4.8GB in the end (delta: 4.7GB). Free memory was 71.5MB in the beginning and 4.3GB in the end (delta: -4.2GB). Peak memory consumption was 466.5MB. Max. memory is 16.1GB. [2022-07-13 18:20:53,831 INFO L158 Benchmark]: Witness Printer took 194.63ms. Allocated memory is still 4.8GB. Free memory was 4.3GB in the beginning and 4.2GB in the end (delta: 36.4MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2022-07-13 18:20:53,838 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.23ms. Allocated memory is still 98.6MB. Free memory is still 77.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 616.22ms. Allocated memory is still 98.6MB. Free memory was 60.4MB in the beginning and 43.5MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 96.23ms. Allocated memory is still 98.6MB. Free memory was 43.3MB in the beginning and 40.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 115.88ms. Allocated memory was 98.6MB in the beginning and 123.7MB in the end (delta: 25.2MB). Free memory was 40.2MB in the beginning and 100.1MB in the end (delta: -59.9MB). Peak memory consumption was 8.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1023.20ms. Allocated memory is still 123.7MB. Free memory was 100.1MB in the beginning and 72.0MB in the end (delta: 28.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 157534.09ms. Allocated memory was 123.7MB in the beginning and 4.8GB in the end (delta: 4.7GB). Free memory was 71.5MB in the beginning and 4.3GB in the end (delta: -4.2GB). Peak memory consumption was 466.5MB. Max. memory is 16.1GB. * Witness Printer took 194.63ms. Allocated memory is still 4.8GB. Free memory was 4.3GB in the beginning and 4.2GB in the end (delta: 36.4MB). 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: 619]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] msg_t nomsg = (msg_t )-1; [L25] port_t cs1 ; [L26] int8_t cs1_old ; [L27] int8_t cs1_new ; [L28] port_t cs2 ; [L29] int8_t cs2_old ; [L30] int8_t cs2_new ; [L31] port_t s1s2 ; [L32] int8_t s1s2_old ; [L33] int8_t s1s2_new ; [L34] port_t s1s1 ; [L35] int8_t s1s1_old ; [L36] int8_t s1s1_new ; [L37] port_t s2s1 ; [L38] int8_t s2s1_old ; [L39] int8_t s2s1_new ; [L40] port_t s2s2 ; [L41] int8_t s2s2_old ; [L42] int8_t s2s2_new ; [L43] port_t s1p ; [L44] int8_t s1p_old ; [L45] int8_t s1p_new ; [L46] port_t s2p ; [L47] int8_t s2p_old ; [L48] int8_t s2p_new ; [L51] _Bool side1Failed ; [L52] _Bool side2Failed ; [L53] msg_t side1_written ; [L54] msg_t side2_written ; [L60] static _Bool side1Failed_History_0 ; [L61] static _Bool side1Failed_History_1 ; [L62] static _Bool side1Failed_History_2 ; [L63] static _Bool side2Failed_History_0 ; [L64] static _Bool side2Failed_History_1 ; [L65] static _Bool side2Failed_History_2 ; [L66] static int8_t active_side_History_0 ; [L67] static int8_t active_side_History_1 ; [L68] static int8_t active_side_History_2 ; [L69] static msg_t manual_selection_History_0 ; [L70] static msg_t manual_selection_History_1 ; [L71] static msg_t manual_selection_History_2 ; 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] [L542] int c1 ; [L543] int i2 ; [L546] c1 = 0 [L547] side1Failed = __VERIFIER_nondet_bool() [L548] side2Failed = __VERIFIER_nondet_bool() [L549] side1_written = __VERIFIER_nondet_char() [L550] side2_written = __VERIFIER_nondet_char() [L551] side1Failed_History_0 = __VERIFIER_nondet_bool() [L552] side1Failed_History_1 = __VERIFIER_nondet_bool() [L553] side1Failed_History_2 = __VERIFIER_nondet_bool() [L554] side2Failed_History_0 = __VERIFIER_nondet_bool() [L555] side2Failed_History_1 = __VERIFIER_nondet_bool() [L556] side2Failed_History_2 = __VERIFIER_nondet_bool() [L557] active_side_History_0 = __VERIFIER_nondet_char() [L558] active_side_History_1 = __VERIFIER_nondet_char() [L559] active_side_History_2 = __VERIFIER_nondet_char() [L560] manual_selection_History_0 = __VERIFIER_nondet_char() [L561] manual_selection_History_1 = __VERIFIER_nondet_char() [L562] manual_selection_History_2 = __VERIFIER_nondet_char() [L563] CALL, EXPR init() [L197] COND FALSE !((int )side1Failed_History_0 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, 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] [L563] RET, EXPR init() [L563] i2 = init() [L564] CALL assume_abort_if_not(i2) VAL [\old(cond)=1, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, 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] [L564] 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] [L565] cs1_old = nomsg [L566] cs1_new = nomsg [L567] cs2_old = nomsg [L568] cs2_new = nomsg [L569] s1s2_old = nomsg [L570] s1s2_new = nomsg [L571] s1s1_old = nomsg [L572] s1s1_new = nomsg [L573] s2s1_old = nomsg [L574] s2s1_new = nomsg [L575] s2s2_old = nomsg [L576] s2s2_new = nomsg [L577] s1p_old = nomsg [L578] s1p_new = nomsg [L579] s2p_old = nomsg [L580] s2p_new = nomsg [L581] i2 = 0 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, 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] [L582] COND TRUE i2 < 10 [L584] CALL Console_task_each_pals_period() [L251] msg_t manual_selection ; [L252] char tmp ; [L255] tmp = __VERIFIER_nondet_char() [L256] manual_selection = tmp [L257] CALL write_manual_selection_history(manual_selection) [L167] manual_selection_History_2 = manual_selection_History_1 [L168] manual_selection_History_1 = manual_selection_History_0 [L169] manual_selection_History_0 = val 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] [L584] RET Console_task_each_pals_period() [L585] CALL Side1_activestandby_task_each_pals_period() [L266] int8_t side1 ; [L267] int8_t side2 ; [L268] msg_t manual_selection ; [L269] int8_t next_state ; [L272] side1 = nomsg [L273] side2 = nomsg [L274] manual_selection = (msg_t )0 [L275] side1Failed = __VERIFIER_nondet_bool() [L276] CALL write_side1_failed_history(side1Failed) [L77] side1Failed_History_2 = side1Failed_History_1 [L78] side1Failed_History_1 = side1Failed_History_0 [L79] side1Failed_History_0 = val 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] [L585] RET Side1_activestandby_task_each_pals_period() [L586] CALL Side2_activestandby_task_each_pals_period() [L323] int8_t side1 ; [L324] int8_t side2 ; [L325] msg_t manual_selection ; [L326] int8_t next_state ; [L329] side1 = nomsg [L330] side2 = nomsg [L331] manual_selection = (msg_t )0 [L332] side2Failed = __VERIFIER_nondet_bool() [L333] CALL write_side2_failed_history(side2Failed) [L107] side2Failed_History_2 = side2Failed_History_1 [L108] side2Failed_History_1 = side2Failed_History_0 [L109] side2Failed_History_0 = val 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] [L586] RET Side2_activestandby_task_each_pals_period() [L587] CALL Pendulum_prism_task_each_pals_period() [L380] int8_t active_side ; [L381] int8_t tmp ; [L382] int8_t side1 ; [L383] int8_t side2 ; VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-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) 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] [L408] COND TRUE (int )side1 == (int )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] [L409] COND FALSE !((int )side2 == 0) [L412] active_side = (int8_t )0 VAL [active_side=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-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] [L417] CALL write_active_side_history(active_side) [L137] active_side_History_2 = active_side_History_1 [L138] active_side_History_1 = active_side_History_0 [L139] active_side_History_0 = val 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] [L417] RET write_active_side_history(active_side) [L587] RET Pendulum_prism_task_each_pals_period() [L588] cs1_old = cs1_new [L589] cs1_new = nomsg [L590] cs2_old = cs2_new [L591] cs2_new = nomsg [L592] s1s2_old = s1s2_new [L593] s1s2_new = nomsg [L594] s1s1_old = s1s1_new [L595] s1s1_new = nomsg [L596] s2s1_old = s2s1_new [L597] s2s1_new = nomsg [L598] s2s2_old = s2s2_new [L599] s2s2_new = nomsg [L600] s1p_old = s1p_new [L601] s1p_new = nomsg [L602] s2p_old = s2p_new [L603] s2p_new = nomsg [L604] CALL, EXPR check() [L423] int tmp ; [L424] msg_t tmp___0 ; [L425] _Bool tmp___1 ; [L426] _Bool tmp___2 ; [L427] _Bool tmp___3 ; [L428] _Bool tmp___4 ; [L429] int8_t tmp___5 ; [L430] _Bool tmp___6 ; [L431] _Bool tmp___7 ; [L432] _Bool tmp___8 ; [L433] int8_t tmp___9 ; [L434] _Bool tmp___10 ; [L435] _Bool tmp___11 ; [L436] _Bool tmp___12 ; [L437] msg_t tmp___13 ; [L438] _Bool tmp___14 ; [L439] _Bool tmp___15 ; [L440] _Bool tmp___16 ; [L441] _Bool tmp___17 ; [L442] int8_t tmp___18 ; [L443] int8_t tmp___19 ; [L444] int8_t tmp___20 ; VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-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] 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] [L450] COND TRUE ! side2Failed [L451] 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] [L455] CALL assume_abort_if_not((_Bool )tmp) VAL [\old(cond)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-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] [L455] RET assume_abort_if_not((_Bool )tmp) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-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] [L456] CALL, EXPR read_manual_selection_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-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] [L456] RET, EXPR read_manual_selection_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-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] [L456] tmp___0 = read_manual_selection_history((unsigned char)1) [L457] COND TRUE ! tmp___0 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-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] [L458] CALL, EXPR read_side1_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-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] [L458] RET, EXPR read_side1_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-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] [L458] tmp___1 = read_side1_failed_history((unsigned char)1) [L459] COND TRUE ! tmp___1 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-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] [L460] CALL, EXPR read_side1_failed_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-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] [L460] RET, EXPR read_side1_failed_history((unsigned char)0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-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] [L460] tmp___2 = read_side1_failed_history((unsigned char)0) [L461] 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] [L486] 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] [L486] 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] [L486] tmp___7 = read_side1_failed_history((unsigned char)1) [L487] 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] [L502] 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] [L502] 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] [L502] tmp___11 = read_side1_failed_history((unsigned char)1) [L503] 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] [L504] 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] [L504] 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] [L504] tmp___12 = read_side2_failed_history((unsigned char)1) [L505] 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] [L518] 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] [L518] 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] [L518] tmp___20 = read_active_side_history((unsigned char)2) [L519] 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] [L537] 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] [L604] RET, EXPR check() [L604] c1 = check() [L605] 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] [L617] 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] [L605] 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] [L606] 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] [L582] COND TRUE i2 < 10 [L584] CALL Console_task_each_pals_period() [L251] msg_t manual_selection ; [L252] char tmp ; [L255] tmp = __VERIFIER_nondet_char() [L256] manual_selection = tmp [L257] CALL write_manual_selection_history(manual_selection) [L167] manual_selection_History_2 = manual_selection_History_1 [L168] manual_selection_History_1 = manual_selection_History_0 [L169] manual_selection_History_0 = val VAL [\old(val)=127, 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=127, 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=127] [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=127, manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new=127, manual_selection_History_0=127, 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=127] [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=127, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection=127, manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new=127, manual_selection_History_0=127, 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=127] [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=127, cs1_old=-128, cs2=0, cs2_new=127, cs2_old=-128, manual_selection=0, manual_selection_History_0=127, 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=127] [L584] RET Console_task_each_pals_period() [L585] CALL Side1_activestandby_task_each_pals_period() [L266] int8_t side1 ; [L267] int8_t side2 ; [L268] msg_t manual_selection ; [L269] int8_t next_state ; [L272] side1 = nomsg [L273] side2 = nomsg [L274] manual_selection = (msg_t )0 [L275] side1Failed = __VERIFIER_nondet_bool() [L276] CALL write_side1_failed_history(side1Failed) [L77] side1Failed_History_2 = side1Failed_History_1 [L78] side1Failed_History_1 = side1Failed_History_0 [L79] side1Failed_History_0 = val VAL [\old(val)=257, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-128, cs2=0, cs2_new=127, cs2_old=-128, manual_selection_History_0=127, 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=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=257] [L276] RET write_side1_failed_history(side1Failed) [L277] COND TRUE \read(side1Failed) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-128, cs2=0, cs2_new=127, cs2_old=-128, manual_selection=0, manual_selection_History_0=127, 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=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=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=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-128, cs2=0, cs2_new=127, cs2_old=-128, manual_selection=0, manual_selection_History_0=127, manual_selection_History_1=-128, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=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=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-128, cs2=0, cs2_new=127, cs2_old=-128, manual_selection=0, manual_selection_History_0=127, manual_selection_History_1=-128, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=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=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-128, cs2=0, cs2_new=127, cs2_old=-128, manual_selection=0, manual_selection_History_0=127, manual_selection_History_1=-128, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=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=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-128, cs2=0, cs2_new=127, cs2_old=-128, manual_selection=0, manual_selection_History_0=127, 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=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L585] RET Side1_activestandby_task_each_pals_period() [L586] CALL Side2_activestandby_task_each_pals_period() [L323] int8_t side1 ; [L324] int8_t side2 ; [L325] msg_t manual_selection ; [L326] int8_t next_state ; [L329] side1 = nomsg [L330] side2 = nomsg [L331] manual_selection = (msg_t )0 [L332] side2Failed = __VERIFIER_nondet_bool() [L333] CALL write_side2_failed_history(side2Failed) [L107] side2Failed_History_2 = side2Failed_History_1 [L108] side2Failed_History_1 = side2Failed_History_0 [L109] side2Failed_History_0 = val VAL [\old(val)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-128, cs2=0, cs2_new=127, cs2_old=-128, manual_selection_History_0=127, 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=1, 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=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-128, cs2=0, cs2_new=127, cs2_old=-1, manual_selection=-128, manual_selection_History_0=127, 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=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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] [L347] 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=127, cs1_old=-128, cs2=0, cs2_new=127, cs2_old=-1, manual_selection=-128, manual_selection_History_0=127, 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=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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] [L350] 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=127, cs1_old=-128, cs2=0, cs2_new=127, cs2_old=-1, manual_selection=-128, manual_selection_History_0=127, 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=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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] [L351] COND TRUE (int )side2 != (int )nomsg [L352] 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=127, cs1_old=-128, cs2=0, cs2_new=127, cs2_old=-1, manual_selection=-128, manual_selection_History_0=127, 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=0, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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] [L371] EXPR next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-128, cs2=0, cs2_new=127, cs2_old=-1, manual_selection=-128, manual_selection_History_0=127, manual_selection_History_1=-128, 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=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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] [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=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-128, cs2=0, cs2_new=127, cs2_old=-1, manual_selection=-128, manual_selection_History_0=127, manual_selection_History_1=-128, 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=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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] [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=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-128, cs2=0, cs2_new=127, cs2_old=-1, manual_selection=-128, manual_selection_History_0=127, manual_selection_History_1=-128, 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=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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] [L373] s2p_new = next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new [L374] side2_written = next_state VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-128, cs2=0, cs2_new=127, cs2_old=-1, manual_selection=-128, manual_selection_History_0=127, 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=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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] [L586] RET Side2_activestandby_task_each_pals_period() [L587] CALL Pendulum_prism_task_each_pals_period() [L380] int8_t active_side ; [L381] int8_t tmp ; [L382] int8_t side1 ; [L383] int8_t side2 ; VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-128, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, 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=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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] [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=127, cs1_old=-128, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, 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=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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] [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=127, cs1_old=-128, cs2=0, cs2_new=127, cs2_old=-1, index=0, manual_selection_History_0=127, 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=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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] [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=127, cs1_old=-128, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, 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=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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] [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=127, cs1_old=-128, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, 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=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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, 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=127, cs1_old=-128, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, 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=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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, 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=127, cs1_old=-128, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, 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=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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, tmp=0] [L400] COND FALSE !((int )side1 == 0) VAL [active_side=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-128, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, 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=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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, tmp=0] [L408] COND TRUE (int )side1 == (int )nomsg VAL [active_side=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-128, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, 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=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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, tmp=0] [L409] COND TRUE (int )side2 == 0 [L410] active_side = (int8_t )2 VAL [active_side=2, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-128, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, 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=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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, tmp=0] [L417] CALL write_active_side_history(active_side) [L137] active_side_History_2 = active_side_History_1 [L138] active_side_History_1 = active_side_History_0 [L139] active_side_History_0 = val VAL [\old(val)=2, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-128, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, 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=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, 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=2] [L417] RET write_active_side_history(active_side) [L587] RET Pendulum_prism_task_each_pals_period() [L588] cs1_old = cs1_new [L589] cs1_new = nomsg [L590] cs2_old = cs2_new [L591] cs2_new = nomsg [L592] s1s2_old = s1s2_new [L593] s1s2_new = nomsg [L594] s1s1_old = s1s1_new [L595] s1s1_new = nomsg [L596] s2s1_old = s2s1_new [L597] s2s1_new = nomsg [L598] s2s2_old = s2s2_new [L599] s2s2_new = nomsg [L600] s1p_old = s1p_new [L601] s1p_new = nomsg [L602] s2p_old = s2p_new [L603] s2p_new = nomsg [L604] CALL, EXPR check() [L423] int tmp ; [L424] msg_t tmp___0 ; [L425] _Bool tmp___1 ; [L426] _Bool tmp___2 ; [L427] _Bool tmp___3 ; [L428] _Bool tmp___4 ; [L429] int8_t tmp___5 ; [L430] _Bool tmp___6 ; [L431] _Bool tmp___7 ; [L432] _Bool tmp___8 ; [L433] int8_t tmp___9 ; [L434] _Bool tmp___10 ; [L435] _Bool tmp___11 ; [L436] _Bool tmp___12 ; [L437] msg_t tmp___13 ; [L438] _Bool tmp___14 ; [L439] _Bool tmp___15 ; [L440] _Bool tmp___16 ; [L441] _Bool tmp___17 ; [L442] int8_t tmp___18 ; [L443] int8_t tmp___19 ; [L444] int8_t tmp___20 ; VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L447] COND FALSE !(! side1Failed) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L450] COND TRUE ! side2Failed [L451] tmp = 1 VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L455] CALL assume_abort_if_not((_Bool )tmp) VAL [\old(cond)=1, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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=1, 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=2, active_side_History_1=0, active_side_History_2=-2, cond=1, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L455] RET assume_abort_if_not((_Bool )tmp) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L456] CALL, EXPR read_manual_selection_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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=1, 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=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, 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=1, 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=-128, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, 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=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L456] RET, EXPR read_manual_selection_history((unsigned char)1) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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=-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=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L456] tmp___0 = read_manual_selection_history((unsigned char)1) [L457] COND FALSE !(! tmp___0) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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=1, 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=-128] [L486] CALL, EXPR read_side1_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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=1, 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=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, 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=1, 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=-255, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, 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=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L486] RET, EXPR read_side1_failed_history((unsigned char)1) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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=-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=1, 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=-128] [L486] tmp___7 = read_side1_failed_history((unsigned char)1) [L487] COND TRUE \read(tmp___7) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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=1, 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=-128, tmp___7=1] [L488] CALL, EXPR read_side2_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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=1, 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=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, 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=1, 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=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, 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=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L488] RET, EXPR read_side2_failed_history((unsigned char)1) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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=-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=1, 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=-128, tmp___7=1] [L488] tmp___8 = read_side2_failed_history((unsigned char)1) [L489] COND TRUE ! tmp___8 VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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=1, 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=-128, tmp___7=1, tmp___8=0] [L490] CALL, EXPR read_active_side_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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=1, 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=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=0, manual_selection_History_0=127, 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=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L490] RET, EXPR read_active_side_history((unsigned char)0) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=-128, 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=-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=1, 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=-128, tmp___7=1, tmp___8=0] [L490] tmp___5 = read_active_side_history((unsigned char)0) [L491] COND FALSE !(! ((int )tmp___5 == 2)) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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=1, 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=-128, tmp___5=2, tmp___7=1, tmp___8=0] [L494] CALL, EXPR read_side2_failed_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L118] COND TRUE (int )index == 0 [L119] return (side2Failed_History_0); VAL [\old(index)=0, \result=0, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=0, manual_selection_History_0=127, 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=1, 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_side2_failed_history((unsigned char)0) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, read_side2_failed_history((unsigned char)0)=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=1, 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=-128, tmp___5=2, tmp___7=1, tmp___8=0] [L494] tmp___6 = read_side2_failed_history((unsigned char)0) [L495] COND TRUE ! tmp___6 VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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=1, 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=-128, tmp___5=2, tmp___6=0, tmp___7=1, tmp___8=0] [L496] COND TRUE ! ((int )side2_written == 1) [L497] return (0); VAL [\result=0, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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=1, 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=-128, tmp___5=2, tmp___6=0, tmp___7=1, tmp___8=0] [L604] RET, EXPR check() [L604] c1 = check() [L605] CALL assert(c1) VAL [\old(arg)=0, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L617] COND TRUE ! arg VAL [\old(arg)=0, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, arg=0, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L619] reach_error() VAL [\old(arg)=0, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, arg=0, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, 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=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 207 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 157.2s, OverallIterations: 45, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 97.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 44035 SdHoareTripleChecker+Valid, 26.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 43635 mSDsluCounter, 99513 SdHoareTripleChecker+Invalid, 21.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 79087 mSDsCounter, 14595 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 34438 IncrementalHoareTripleChecker+Invalid, 49033 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14595 mSolverCounterUnsat, 20426 mSDtfsCounter, 34438 mSolverCounterSat, 0.5s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6160 GetRequests, 5296 SyntacticMatches, 18 SemanticMatches, 846 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31848 ImplicationChecksByTransitivity, 12.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17971occurred in iteration=39, InterpolantAutomatonStates: 793, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 41.3s AutomataMinimizationTime, 44 MinimizatonAttempts, 109720 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 10.7s InterpolantComputationTime, 8534 NumberOfCodeBlocks, 8534 NumberOfCodeBlocksAsserted, 56 NumberOfCheckSat, 10290 ConstructedInterpolants, 0 QuantifiedInterpolants, 33793 SizeOfPredicates, 35 NumberOfNonLiveVariables, 9143 ConjunctsInSsa, 146 ConjunctsInUnsatCore, 65 InterpolantComputations, 35 PerfectInterpolantSequences, 4133/4807 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-13 18:20:53,869 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