./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 6c24879c 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-?-6c24879 [2022-07-12 06:37:34,001 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 06:37:34,002 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 06:37:34,029 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 06:37:34,029 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 06:37:34,030 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 06:37:34,032 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 06:37:34,039 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 06:37:34,040 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 06:37:34,043 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 06:37:34,044 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 06:37:34,046 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 06:37:34,046 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 06:37:34,047 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 06:37:34,049 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 06:37:34,050 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 06:37:34,051 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 06:37:34,052 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 06:37:34,054 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 06:37:34,058 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 06:37:34,059 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 06:37:34,060 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 06:37:34,061 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 06:37:34,061 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 06:37:34,063 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 06:37:34,068 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 06:37:34,068 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 06:37:34,068 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 06:37:34,069 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 06:37:34,069 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 06:37:34,070 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 06:37:34,070 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 06:37:34,071 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 06:37:34,072 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 06:37:34,072 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 06:37:34,074 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 06:37:34,074 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 06:37:34,074 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 06:37:34,075 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 06:37:34,075 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 06:37:34,075 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 06:37:34,077 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 06:37:34,077 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 06:37:34,100 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 06:37:34,100 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 06:37:34,101 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 06:37:34,101 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 06:37:34,101 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 06:37:34,101 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 06:37:34,102 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 06:37:34,102 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 06:37:34,102 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 06:37:34,103 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 06:37:34,103 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 06:37:34,103 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 06:37:34,104 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 06:37:34,104 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 06:37:34,104 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 06:37:34,104 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 06:37:34,104 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 06:37:34,104 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 06:37:34,105 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 06:37:34,105 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 06:37:34,106 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 06:37:34,106 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 06:37:34,106 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 06:37:34,106 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 06:37:34,106 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 06:37:34,107 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 06:37:34,107 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 06:37:34,107 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 06:37:34,107 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 06:37:34,107 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 06:37:34,108 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 06:37:34,108 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 06:37:34,108 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 06:37:34,108 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-12 06:37:34,269 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 06:37:34,288 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 06:37:34,289 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 06:37:34,290 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 06:37:34,291 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 06:37:34,291 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-12 06:37:34,335 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c5c7f63b/53f3b5c0fc0c450a9b5a908140a46a96/FLAGca572a4e8 [2022-07-12 06:37:34,753 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 06:37:34,754 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-12 06:37:34,760 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c5c7f63b/53f3b5c0fc0c450a9b5a908140a46a96/FLAGca572a4e8 [2022-07-12 06:37:35,142 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c5c7f63b/53f3b5c0fc0c450a9b5a908140a46a96 [2022-07-12 06:37:35,143 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 06:37:35,144 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 06:37:35,146 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 06:37:35,147 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 06:37:35,158 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 06:37:35,159 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:37:35" (1/1) ... [2022-07-12 06:37:35,160 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b82e019 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:37:35, skipping insertion in model container [2022-07-12 06:37:35,160 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:37:35" (1/1) ... [2022-07-12 06:37:35,166 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 06:37:35,199 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 06:37:35,392 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-12 06:37:35,393 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 06:37:35,399 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 06:37:35,446 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-12 06:37:35,447 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 06:37:35,457 INFO L208 MainTranslator]: Completed translation [2022-07-12 06:37:35,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:37:35 WrapperNode [2022-07-12 06:37:35,458 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 06:37:35,458 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 06:37:35,459 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 06:37:35,459 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 06:37:35,470 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:37:35" (1/1) ... [2022-07-12 06:37:35,477 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:37:35" (1/1) ... [2022-07-12 06:37:35,512 INFO L137 Inliner]: procedures = 32, calls = 48, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 538 [2022-07-12 06:37:35,517 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 06:37:35,518 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 06:37:35,518 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 06:37:35,518 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 06:37:35,523 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:37:35" (1/1) ... [2022-07-12 06:37:35,523 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:37:35" (1/1) ... [2022-07-12 06:37:35,533 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:37:35" (1/1) ... [2022-07-12 06:37:35,534 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:37:35" (1/1) ... [2022-07-12 06:37:35,540 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:37:35" (1/1) ... [2022-07-12 06:37:35,544 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:37:35" (1/1) ... [2022-07-12 06:37:35,546 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:37:35" (1/1) ... [2022-07-12 06:37:35,553 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 06:37:35,559 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 06:37:35,560 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 06:37:35,560 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 06:37:35,560 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:37:35" (1/1) ... [2022-07-12 06:37:35,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 06:37:35,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:37:35,612 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-12 06:37:35,618 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-12 06:37:35,645 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2022-07-12 06:37:35,646 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2022-07-12 06:37:35,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 06:37:35,646 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2022-07-12 06:37:35,646 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2022-07-12 06:37:35,646 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2022-07-12 06:37:35,646 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2022-07-12 06:37:35,646 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2022-07-12 06:37:35,647 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2022-07-12 06:37:35,647 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-12 06:37:35,647 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-12 06:37:35,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 06:37:35,647 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2022-07-12 06:37:35,648 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2022-07-12 06:37:35,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 06:37:35,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 06:37:35,648 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2022-07-12 06:37:35,648 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2022-07-12 06:37:35,718 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 06:37:35,720 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 06:37:36,113 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 06:37:36,119 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 06:37:36,119 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-12 06:37:36,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:37:36 BoogieIcfgContainer [2022-07-12 06:37:36,121 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 06:37:36,122 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 06:37:36,122 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 06:37:36,125 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 06:37:36,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 06:37:35" (1/3) ... [2022-07-12 06:37:36,125 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e58356d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:37:36, skipping insertion in model container [2022-07-12 06:37:36,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:37:35" (2/3) ... [2022-07-12 06:37:36,126 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e58356d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:37:36, skipping insertion in model container [2022-07-12 06:37:36,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:37:36" (3/3) ... [2022-07-12 06:37:36,127 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c [2022-07-12 06:37:36,136 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 06:37:36,136 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 06:37:36,171 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 06:37:36,175 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@5bd2d279, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@11052a43 [2022-07-12 06:37:36,175 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 06:37:36,178 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-12 06:37:36,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-12 06:37:36,185 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:37:36,185 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-12 06:37:36,186 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:37:36,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:37:36,189 INFO L85 PathProgramCache]: Analyzing trace with hash -518679476, now seen corresponding path program 1 times [2022-07-12 06:37:36,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:37:36,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246378864] [2022-07-12 06:37:36,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:37:36,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:37:36,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:36,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 06:37:36,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:36,340 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-12 06:37:36,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:37:36,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246378864] [2022-07-12 06:37:36,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246378864] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:37:36,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:37:36,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 06:37:36,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8656849] [2022-07-12 06:37:36,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:37:36,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 06:37:36,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:37:36,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 06:37:36,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 06:37:36,375 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-12 06:37:36,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:37:36,432 INFO L93 Difference]: Finished difference Result 398 states and 642 transitions. [2022-07-12 06:37:36,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 06:37:36,434 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-12 06:37:36,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:37:36,446 INFO L225 Difference]: With dead ends: 398 [2022-07-12 06:37:36,446 INFO L226 Difference]: Without dead ends: 203 [2022-07-12 06:37:36,452 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-12 06:37:36,455 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-12 06:37:36,455 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-12 06:37:36,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-07-12 06:37:36,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2022-07-12 06:37:36,506 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-12 06:37:36,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 308 transitions. [2022-07-12 06:37:36,510 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 308 transitions. Word has length 44 [2022-07-12 06:37:36,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:37:36,511 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 308 transitions. [2022-07-12 06:37:36,511 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-12 06:37:36,511 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 308 transitions. [2022-07-12 06:37:36,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-12 06:37:36,513 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:37:36,514 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-12 06:37:36,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 06:37:36,514 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:37:36,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:37:36,515 INFO L85 PathProgramCache]: Analyzing trace with hash -527444980, now seen corresponding path program 1 times [2022-07-12 06:37:36,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:37:36,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776348925] [2022-07-12 06:37:36,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:37:36,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:37:36,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:36,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 06:37:36,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:36,655 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-12 06:37:36,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:37:36,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776348925] [2022-07-12 06:37:36,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776348925] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:37:36,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:37:36,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 06:37:36,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037233605] [2022-07-12 06:37:36,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:37:36,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 06:37:36,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:37:36,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 06:37:36,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 06:37:36,661 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-12 06:37:36,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:37:36,770 INFO L93 Difference]: Finished difference Result 531 states and 811 transitions. [2022-07-12 06:37:36,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 06:37:36,771 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-12 06:37:36,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:37:36,776 INFO L225 Difference]: With dead ends: 531 [2022-07-12 06:37:36,776 INFO L226 Difference]: Without dead ends: 342 [2022-07-12 06:37:36,779 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-12 06:37:36,781 INFO L413 NwaCegarLoop]: 327 mSDtfsCounter, 171 mSDsluCounter, 1257 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-07-12 06:37:36,781 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.0s Time] [2022-07-12 06:37:36,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2022-07-12 06:37:36,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 203. [2022-07-12 06:37:36,808 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-12 06:37:36,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 296 transitions. [2022-07-12 06:37:36,810 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 296 transitions. Word has length 44 [2022-07-12 06:37:36,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:37:36,810 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 296 transitions. [2022-07-12 06:37:36,811 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-12 06:37:36,811 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 296 transitions. [2022-07-12 06:37:36,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-12 06:37:36,812 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:37:36,812 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-12 06:37:36,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 06:37:36,813 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:37:36,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:37:36,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1202945359, now seen corresponding path program 1 times [2022-07-12 06:37:36,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:37:36,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416634667] [2022-07-12 06:37:36,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:37:36,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:37:36,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:36,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:37:36,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:36,934 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-12 06:37:36,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:37:36,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416634667] [2022-07-12 06:37:36,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416634667] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:37:36,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:37:36,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 06:37:36,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274677365] [2022-07-12 06:37:36,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:37:36,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 06:37:36,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:37:36,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 06:37:36,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 06:37:36,948 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-12 06:37:36,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:37:36,993 INFO L93 Difference]: Finished difference Result 393 states and 582 transitions. [2022-07-12 06:37:36,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 06:37:36,994 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-12 06:37:36,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:37:36,995 INFO L225 Difference]: With dead ends: 393 [2022-07-12 06:37:36,995 INFO L226 Difference]: Without dead ends: 207 [2022-07-12 06:37:36,996 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-12 06:37:36,998 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-12 06:37:37,000 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-12 06:37:37,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-07-12 06:37:37,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2022-07-12 06:37:37,006 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-12 06:37:37,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 299 transitions. [2022-07-12 06:37:37,007 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 299 transitions. Word has length 55 [2022-07-12 06:37:37,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:37:37,007 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 299 transitions. [2022-07-12 06:37:37,008 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-12 06:37:37,008 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 299 transitions. [2022-07-12 06:37:37,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-12 06:37:37,009 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:37:37,009 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-12 06:37:37,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 06:37:37,010 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:37:37,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:37:37,010 INFO L85 PathProgramCache]: Analyzing trace with hash -915994749, now seen corresponding path program 1 times [2022-07-12 06:37:37,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:37:37,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112536440] [2022-07-12 06:37:37,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:37:37,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:37:37,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:37,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:37:37,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:37,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 06:37:37,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:37,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 06:37:37,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:37,092 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-12 06:37:37,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:37:37,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112536440] [2022-07-12 06:37:37,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112536440] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:37:37,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:37:37,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 06:37:37,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076127395] [2022-07-12 06:37:37,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:37:37,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 06:37:37,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:37:37,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 06:37:37,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 06:37:37,095 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-12 06:37:37,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:37:37,116 INFO L93 Difference]: Finished difference Result 564 states and 826 transitions. [2022-07-12 06:37:37,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 06:37:37,116 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-12 06:37:37,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:37:37,121 INFO L225 Difference]: With dead ends: 564 [2022-07-12 06:37:37,121 INFO L226 Difference]: Without dead ends: 374 [2022-07-12 06:37:37,122 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-12 06:37:37,123 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-12 06:37:37,123 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-12 06:37:37,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2022-07-12 06:37:37,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 364. [2022-07-12 06:37:37,138 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-12 06:37:37,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 533 transitions. [2022-07-12 06:37:37,140 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 533 transitions. Word has length 71 [2022-07-12 06:37:37,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:37:37,140 INFO L495 AbstractCegarLoop]: Abstraction has 364 states and 533 transitions. [2022-07-12 06:37:37,140 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-12 06:37:37,141 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 533 transitions. [2022-07-12 06:37:37,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-12 06:37:37,142 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:37:37,142 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-12 06:37:37,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 06:37:37,142 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:37:37,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:37:37,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1756914315, now seen corresponding path program 1 times [2022-07-12 06:37:37,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:37:37,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577868527] [2022-07-12 06:37:37,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:37:37,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:37:37,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:37,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:37:37,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:37,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 06:37:37,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:37,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 06:37:37,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:37,183 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-12 06:37:37,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:37:37,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577868527] [2022-07-12 06:37:37,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577868527] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:37:37,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:37:37,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 06:37:37,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289714309] [2022-07-12 06:37:37,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:37:37,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 06:37:37,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:37:37,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 06:37:37,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 06:37:37,185 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-12 06:37:37,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:37:37,222 INFO L93 Difference]: Finished difference Result 1009 states and 1492 transitions. [2022-07-12 06:37:37,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 06:37:37,223 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-12 06:37:37,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:37:37,230 INFO L225 Difference]: With dead ends: 1009 [2022-07-12 06:37:37,231 INFO L226 Difference]: Without dead ends: 662 [2022-07-12 06:37:37,232 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-12 06:37:37,233 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-12 06:37:37,233 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-12 06:37:37,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2022-07-12 06:37:37,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 645. [2022-07-12 06:37:37,273 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-12 06:37:37,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 957 transitions. [2022-07-12 06:37:37,277 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 957 transitions. Word has length 72 [2022-07-12 06:37:37,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:37:37,277 INFO L495 AbstractCegarLoop]: Abstraction has 645 states and 957 transitions. [2022-07-12 06:37:37,278 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-12 06:37:37,278 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 957 transitions. [2022-07-12 06:37:37,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-12 06:37:37,283 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:37:37,283 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-12 06:37:37,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 06:37:37,284 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:37:37,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:37:37,284 INFO L85 PathProgramCache]: Analyzing trace with hash 477050637, now seen corresponding path program 1 times [2022-07-12 06:37:37,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:37:37,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164988465] [2022-07-12 06:37:37,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:37:37,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:37:37,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:37,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:37:37,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:37,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 06:37:37,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:37,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 06:37:37,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:37,389 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-12 06:37:37,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:37:37,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164988465] [2022-07-12 06:37:37,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164988465] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:37:37,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:37:37,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 06:37:37,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447115551] [2022-07-12 06:37:37,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:37:37,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 06:37:37,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:37:37,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 06:37:37,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 06:37:37,392 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-12 06:37:37,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:37:37,643 INFO L93 Difference]: Finished difference Result 1805 states and 2723 transitions. [2022-07-12 06:37:37,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 06:37:37,644 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-12 06:37:37,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:37:37,649 INFO L225 Difference]: With dead ends: 1805 [2022-07-12 06:37:37,649 INFO L226 Difference]: Without dead ends: 1177 [2022-07-12 06:37:37,651 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-12 06:37:37,652 INFO L413 NwaCegarLoop]: 289 mSDtfsCounter, 786 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.2s IncrementalHoareTripleChecker+Time [2022-07-12 06:37:37,652 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.2s Time] [2022-07-12 06:37:37,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2022-07-12 06:37:37,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 770. [2022-07-12 06:37:37,705 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-12 06:37:37,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1121 transitions. [2022-07-12 06:37:37,708 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1121 transitions. Word has length 72 [2022-07-12 06:37:37,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:37:37,709 INFO L495 AbstractCegarLoop]: Abstraction has 770 states and 1121 transitions. [2022-07-12 06:37:37,709 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-12 06:37:37,709 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1121 transitions. [2022-07-12 06:37:37,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-07-12 06:37:37,710 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:37:37,710 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-12 06:37:37,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 06:37:37,711 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:37:37,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:37:37,711 INFO L85 PathProgramCache]: Analyzing trace with hash -221882142, now seen corresponding path program 1 times [2022-07-12 06:37:37,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:37:37,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715401390] [2022-07-12 06:37:37,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:37:37,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:37:37,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:37,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:37:37,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:37,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 06:37:37,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:37,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 06:37:37,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:37,771 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-12 06:37:37,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:37:37,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715401390] [2022-07-12 06:37:37,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715401390] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:37:37,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:37:37,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 06:37:37,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688288121] [2022-07-12 06:37:37,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:37:37,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 06:37:37,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:37:37,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 06:37:37,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 06:37:37,774 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-12 06:37:38,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:37:38,034 INFO L93 Difference]: Finished difference Result 1809 states and 2723 transitions. [2022-07-12 06:37:38,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 06:37:38,035 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-12 06:37:38,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:37:38,040 INFO L225 Difference]: With dead ends: 1809 [2022-07-12 06:37:38,040 INFO L226 Difference]: Without dead ends: 1181 [2022-07-12 06:37:38,042 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-12 06:37:38,042 INFO L413 NwaCegarLoop]: 289 mSDtfsCounter, 783 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-12 06:37:38,043 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-12 06:37:38,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2022-07-12 06:37:38,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 778. [2022-07-12 06:37:38,083 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-12 06:37:38,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1129 transitions. [2022-07-12 06:37:38,086 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1129 transitions. Word has length 73 [2022-07-12 06:37:38,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:37:38,087 INFO L495 AbstractCegarLoop]: Abstraction has 778 states and 1129 transitions. [2022-07-12 06:37:38,087 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-12 06:37:38,087 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1129 transitions. [2022-07-12 06:37:38,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-07-12 06:37:38,088 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:37:38,088 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-12 06:37:38,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 06:37:38,088 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:37:38,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:37:38,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1379275244, now seen corresponding path program 1 times [2022-07-12 06:37:38,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:37:38,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018720556] [2022-07-12 06:37:38,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:37:38,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:37:38,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:38,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:37:38,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:38,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 06:37:38,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:38,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 06:37:38,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:38,140 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-12 06:37:38,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:37:38,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018720556] [2022-07-12 06:37:38,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018720556] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:37:38,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:37:38,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 06:37:38,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015358200] [2022-07-12 06:37:38,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:37:38,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 06:37:38,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:37:38,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 06:37:38,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 06:37:38,142 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-12 06:37:38,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:37:38,380 INFO L93 Difference]: Finished difference Result 1809 states and 2715 transitions. [2022-07-12 06:37:38,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 06:37:38,381 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-12 06:37:38,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:37:38,386 INFO L225 Difference]: With dead ends: 1809 [2022-07-12 06:37:38,386 INFO L226 Difference]: Without dead ends: 1181 [2022-07-12 06:37:38,389 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-12 06:37:38,389 INFO L413 NwaCegarLoop]: 315 mSDtfsCounter, 238 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-07-12 06:37:38,392 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.1s Time] [2022-07-12 06:37:38,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2022-07-12 06:37:38,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 778. [2022-07-12 06:37:38,431 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-12 06:37:38,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1125 transitions. [2022-07-12 06:37:38,434 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1125 transitions. Word has length 75 [2022-07-12 06:37:38,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:37:38,434 INFO L495 AbstractCegarLoop]: Abstraction has 778 states and 1125 transitions. [2022-07-12 06:37:38,434 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-12 06:37:38,434 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1125 transitions. [2022-07-12 06:37:38,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-12 06:37:38,439 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:37:38,440 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-12 06:37:38,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 06:37:38,440 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:37:38,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:37:38,440 INFO L85 PathProgramCache]: Analyzing trace with hash -156149797, now seen corresponding path program 1 times [2022-07-12 06:37:38,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:37:38,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900271361] [2022-07-12 06:37:38,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:37:38,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:37:38,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:38,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:37:38,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:38,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 06:37:38,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:38,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 06:37:38,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:38,522 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-12 06:37:38,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:37:38,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900271361] [2022-07-12 06:37:38,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900271361] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:37:38,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:37:38,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 06:37:38,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363948423] [2022-07-12 06:37:38,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:37:38,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 06:37:38,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:37:38,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 06:37:38,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 06:37:38,525 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-12 06:37:38,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:37:38,571 INFO L93 Difference]: Finished difference Result 1426 states and 2092 transitions. [2022-07-12 06:37:38,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 06:37:38,572 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-12 06:37:38,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:37:38,574 INFO L225 Difference]: With dead ends: 1426 [2022-07-12 06:37:38,575 INFO L226 Difference]: Without dead ends: 798 [2022-07-12 06:37:38,576 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-12 06:37:38,576 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-12 06:37:38,577 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-12 06:37:38,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2022-07-12 06:37:38,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 798. [2022-07-12 06:37:38,630 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-12 06:37:38,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1141 transitions. [2022-07-12 06:37:38,633 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 1141 transitions. Word has length 76 [2022-07-12 06:37:38,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:37:38,633 INFO L495 AbstractCegarLoop]: Abstraction has 798 states and 1141 transitions. [2022-07-12 06:37:38,633 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-12 06:37:38,633 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1141 transitions. [2022-07-12 06:37:38,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-12 06:37:38,634 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:37:38,634 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-12 06:37:38,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 06:37:38,635 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:37:38,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:37:38,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1992242591, now seen corresponding path program 1 times [2022-07-12 06:37:38,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:37:38,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028205509] [2022-07-12 06:37:38,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:37:38,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:37:38,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:38,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:37:38,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:38,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 06:37:38,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:38,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 06:37:38,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:38,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 06:37:38,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:38,690 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-12 06:37:38,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:37:38,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028205509] [2022-07-12 06:37:38,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028205509] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:37:38,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:37:38,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 06:37:38,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985643073] [2022-07-12 06:37:38,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:37:38,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 06:37:38,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:37:38,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 06:37:38,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 06:37:38,692 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-12 06:37:38,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:37:38,756 INFO L93 Difference]: Finished difference Result 1466 states and 2136 transitions. [2022-07-12 06:37:38,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 06:37:38,757 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-12 06:37:38,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:37:38,760 INFO L225 Difference]: With dead ends: 1466 [2022-07-12 06:37:38,760 INFO L226 Difference]: Without dead ends: 818 [2022-07-12 06:37:38,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 06:37:38,762 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-12 06:37:38,762 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-12 06:37:38,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2022-07-12 06:37:38,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 818. [2022-07-12 06:37:38,797 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-12 06:37:38,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1157 transitions. [2022-07-12 06:37:38,800 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1157 transitions. Word has length 84 [2022-07-12 06:37:38,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:37:38,800 INFO L495 AbstractCegarLoop]: Abstraction has 818 states and 1157 transitions. [2022-07-12 06:37:38,800 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-12 06:37:38,800 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1157 transitions. [2022-07-12 06:37:38,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-07-12 06:37:38,801 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:37:38,801 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-12 06:37:38,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 06:37:38,802 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:37:38,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:37:38,802 INFO L85 PathProgramCache]: Analyzing trace with hash -115565173, now seen corresponding path program 1 times [2022-07-12 06:37:38,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:37:38,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585490616] [2022-07-12 06:37:38,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:37:38,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:37:38,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:38,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:37:38,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:38,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 06:37:38,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:38,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 06:37:38,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:38,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 06:37:38,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:38,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 06:37:38,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:38,850 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-12 06:37:38,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:37:38,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585490616] [2022-07-12 06:37:38,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585490616] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:37:38,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:37:38,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 06:37:38,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321585393] [2022-07-12 06:37:38,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:37:38,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 06:37:38,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:37:38,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 06:37:38,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 06:37:38,852 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-12 06:37:38,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:37:38,913 INFO L93 Difference]: Finished difference Result 1502 states and 2152 transitions. [2022-07-12 06:37:38,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 06:37:38,913 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-12 06:37:38,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:37:38,917 INFO L225 Difference]: With dead ends: 1502 [2022-07-12 06:37:38,917 INFO L226 Difference]: Without dead ends: 834 [2022-07-12 06:37:38,918 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-12 06:37:38,919 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-12 06:37:38,919 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-12 06:37:38,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2022-07-12 06:37:38,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 834. [2022-07-12 06:37:38,954 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-12 06:37:38,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1169 transitions. [2022-07-12 06:37:38,957 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1169 transitions. Word has length 92 [2022-07-12 06:37:38,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:37:38,957 INFO L495 AbstractCegarLoop]: Abstraction has 834 states and 1169 transitions. [2022-07-12 06:37:38,957 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-12 06:37:38,957 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1169 transitions. [2022-07-12 06:37:38,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-07-12 06:37:38,958 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:37:38,959 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-12 06:37:38,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 06:37:38,959 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:37:38,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:37:38,959 INFO L85 PathProgramCache]: Analyzing trace with hash -2014073166, now seen corresponding path program 1 times [2022-07-12 06:37:38,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:37:38,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516033068] [2022-07-12 06:37:38,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:37:38,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:37:38,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:39,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:37:39,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:39,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 06:37:39,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:39,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 06:37:39,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:39,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 06:37:39,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:39,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 06:37:39,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:39,023 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-12 06:37:39,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:37:39,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516033068] [2022-07-12 06:37:39,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516033068] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:37:39,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:37:39,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 06:37:39,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499437030] [2022-07-12 06:37:39,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:37:39,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 06:37:39,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:37:39,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 06:37:39,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 06:37:39,025 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-12 06:37:39,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:37:39,080 INFO L93 Difference]: Finished difference Result 1538 states and 2192 transitions. [2022-07-12 06:37:39,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 06:37:39,080 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-12 06:37:39,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:37:39,083 INFO L225 Difference]: With dead ends: 1538 [2022-07-12 06:37:39,083 INFO L226 Difference]: Without dead ends: 854 [2022-07-12 06:37:39,085 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-12 06:37:39,085 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-12 06:37:39,085 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-12 06:37:39,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2022-07-12 06:37:39,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 854. [2022-07-12 06:37:39,127 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-12 06:37:39,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 1185 transitions. [2022-07-12 06:37:39,130 INFO L78 Accepts]: Start accepts. Automaton has 854 states and 1185 transitions. Word has length 92 [2022-07-12 06:37:39,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:37:39,130 INFO L495 AbstractCegarLoop]: Abstraction has 854 states and 1185 transitions. [2022-07-12 06:37:39,130 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-12 06:37:39,130 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1185 transitions. [2022-07-12 06:37:39,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-12 06:37:39,132 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:37:39,132 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-12 06:37:39,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 06:37:39,132 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:37:39,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:37:39,133 INFO L85 PathProgramCache]: Analyzing trace with hash -794519374, now seen corresponding path program 1 times [2022-07-12 06:37:39,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:37:39,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879589880] [2022-07-12 06:37:39,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:37:39,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:37:39,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:39,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:37:39,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:39,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 06:37:39,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:39,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 06:37:39,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:39,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 06:37:39,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:39,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 06:37:39,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:39,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 06:37:39,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:39,191 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-12 06:37:39,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:37:39,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879589880] [2022-07-12 06:37:39,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879589880] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:37:39,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:37:39,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 06:37:39,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040328048] [2022-07-12 06:37:39,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:37:39,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 06:37:39,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:37:39,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 06:37:39,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 06:37:39,193 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-12 06:37:39,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:37:39,255 INFO L93 Difference]: Finished difference Result 1582 states and 2220 transitions. [2022-07-12 06:37:39,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 06:37:39,258 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-12 06:37:39,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:37:39,262 INFO L225 Difference]: With dead ends: 1582 [2022-07-12 06:37:39,275 INFO L226 Difference]: Without dead ends: 878 [2022-07-12 06:37:39,277 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-12 06:37:39,278 INFO L413 NwaCegarLoop]: 293 mSDtfsCounter, 7 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-07-12 06:37:39,278 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.0s Time] [2022-07-12 06:37:39,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2022-07-12 06:37:39,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 878. [2022-07-12 06:37:39,338 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-12 06:37:39,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1205 transitions. [2022-07-12 06:37:39,351 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1205 transitions. Word has length 100 [2022-07-12 06:37:39,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:37:39,352 INFO L495 AbstractCegarLoop]: Abstraction has 878 states and 1205 transitions. [2022-07-12 06:37:39,352 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-12 06:37:39,352 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1205 transitions. [2022-07-12 06:37:39,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-07-12 06:37:39,354 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:37:39,354 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-12 06:37:39,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 06:37:39,354 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:37:39,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:37:39,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1401758325, now seen corresponding path program 1 times [2022-07-12 06:37:39,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:37:39,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219831488] [2022-07-12 06:37:39,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:37:39,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:37:39,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:39,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:37:39,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:39,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 06:37:39,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:39,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 06:37:39,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:39,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 06:37:39,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:39,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 06:37:39,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:39,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 06:37:39,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:39,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 06:37:39,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:39,513 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-12 06:37:39,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:37:39,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219831488] [2022-07-12 06:37:39,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219831488] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:37:39,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:37:39,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 06:37:39,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640988575] [2022-07-12 06:37:39,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:37:39,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 06:37:39,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:37:39,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 06:37:39,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 06:37:39,515 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-12 06:37:39,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:37:39,751 INFO L93 Difference]: Finished difference Result 2499 states and 3487 transitions. [2022-07-12 06:37:39,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 06:37:39,752 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-12 06:37:39,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:37:39,758 INFO L225 Difference]: With dead ends: 2499 [2022-07-12 06:37:39,758 INFO L226 Difference]: Without dead ends: 1771 [2022-07-12 06:37:39,760 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-12 06:37:39,761 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.1s IncrementalHoareTripleChecker+Time [2022-07-12 06:37:39,761 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.1s Time] [2022-07-12 06:37:39,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1771 states. [2022-07-12 06:37:39,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1771 to 1162. [2022-07-12 06:37:39,826 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-12 06:37:39,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 1162 states and 1583 transitions. [2022-07-12 06:37:39,830 INFO L78 Accepts]: Start accepts. Automaton has 1162 states and 1583 transitions. Word has length 103 [2022-07-12 06:37:39,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:37:39,831 INFO L495 AbstractCegarLoop]: Abstraction has 1162 states and 1583 transitions. [2022-07-12 06:37:39,831 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-12 06:37:39,831 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 1583 transitions. [2022-07-12 06:37:39,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-12 06:37:39,832 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:37:39,832 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-12 06:37:39,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-12 06:37:39,832 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:37:39,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:37:39,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1324741963, now seen corresponding path program 1 times [2022-07-12 06:37:39,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:37:39,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328746177] [2022-07-12 06:37:39,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:37:39,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:37:39,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:39,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:37:39,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:39,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 06:37:39,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:39,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 06:37:39,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:39,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 06:37:39,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:39,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 06:37:39,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:39,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 06:37:39,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:39,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 06:37:39,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:39,904 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-12 06:37:39,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:37:39,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328746177] [2022-07-12 06:37:39,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328746177] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:37:39,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:37:39,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 06:37:39,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058284993] [2022-07-12 06:37:39,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:37:39,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 06:37:39,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:37:39,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 06:37:39,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 06:37:39,906 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-12 06:37:39,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:37:39,991 INFO L93 Difference]: Finished difference Result 2130 states and 2928 transitions. [2022-07-12 06:37:39,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 06:37:39,993 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-12 06:37:39,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:37:39,997 INFO L225 Difference]: With dead ends: 2130 [2022-07-12 06:37:39,998 INFO L226 Difference]: Without dead ends: 1186 [2022-07-12 06:37:40,004 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-12 06:37:40,006 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-12 06:37:40,006 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-12 06:37:40,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2022-07-12 06:37:40,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 1186. [2022-07-12 06:37:40,077 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-12 06:37:40,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 1601 transitions. [2022-07-12 06:37:40,080 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 1601 transitions. Word has length 107 [2022-07-12 06:37:40,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:37:40,080 INFO L495 AbstractCegarLoop]: Abstraction has 1186 states and 1601 transitions. [2022-07-12 06:37:40,080 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-12 06:37:40,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 1601 transitions. [2022-07-12 06:37:40,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-12 06:37:40,081 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:37:40,081 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-12 06:37:40,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-12 06:37:40,082 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:37:40,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:37:40,082 INFO L85 PathProgramCache]: Analyzing trace with hash 682815691, now seen corresponding path program 1 times [2022-07-12 06:37:40,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:37:40,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631440311] [2022-07-12 06:37:40,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:37:40,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:37:40,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:40,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:37:40,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:40,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 06:37:40,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:40,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 06:37:40,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:40,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 06:37:40,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:40,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 06:37:40,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:40,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 06:37:40,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:40,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 06:37:40,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:40,155 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-12 06:37:40,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:37:40,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631440311] [2022-07-12 06:37:40,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631440311] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:37:40,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:37:40,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 06:37:40,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905763825] [2022-07-12 06:37:40,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:37:40,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 06:37:40,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:37:40,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 06:37:40,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 06:37:40,158 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-12 06:37:40,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:37:40,287 INFO L93 Difference]: Finished difference Result 1659 states and 2347 transitions. [2022-07-12 06:37:40,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 06:37:40,287 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-12 06:37:40,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:37:40,292 INFO L225 Difference]: With dead ends: 1659 [2022-07-12 06:37:40,292 INFO L226 Difference]: Without dead ends: 1657 [2022-07-12 06:37:40,293 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-12 06:37:40,294 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-12 06:37:40,294 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-12 06:37:40,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1657 states. [2022-07-12 06:37:40,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1657 to 1194. [2022-07-12 06:37:40,363 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-12 06:37:40,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1194 states to 1194 states and 1609 transitions. [2022-07-12 06:37:40,366 INFO L78 Accepts]: Start accepts. Automaton has 1194 states and 1609 transitions. Word has length 106 [2022-07-12 06:37:40,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:37:40,366 INFO L495 AbstractCegarLoop]: Abstraction has 1194 states and 1609 transitions. [2022-07-12 06:37:40,367 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-12 06:37:40,367 INFO L276 IsEmpty]: Start isEmpty. Operand 1194 states and 1609 transitions. [2022-07-12 06:37:40,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-07-12 06:37:40,368 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:37:40,368 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-12 06:37:40,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-12 06:37:40,368 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:37:40,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:37:40,369 INFO L85 PathProgramCache]: Analyzing trace with hash -614162587, now seen corresponding path program 1 times [2022-07-12 06:37:40,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:37:40,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960175477] [2022-07-12 06:37:40,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:37:40,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:37:40,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:40,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:37:40,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:40,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 06:37:40,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:40,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 06:37:40,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:40,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 06:37:40,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:40,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 06:37:40,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:40,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 06:37:40,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:40,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 06:37:40,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:40,453 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-12 06:37:40,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:37:40,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960175477] [2022-07-12 06:37:40,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960175477] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:37:40,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:37:40,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 06:37:40,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549693517] [2022-07-12 06:37:40,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:37:40,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 06:37:40,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:37:40,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 06:37:40,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 06:37:40,455 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-12 06:37:40,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:37:40,651 INFO L93 Difference]: Finished difference Result 2456 states and 3370 transitions. [2022-07-12 06:37:40,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 06:37:40,652 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-12 06:37:40,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:37:40,657 INFO L225 Difference]: With dead ends: 2456 [2022-07-12 06:37:40,657 INFO L226 Difference]: Without dead ends: 1562 [2022-07-12 06:37:40,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-07-12 06:37:40,660 INFO L413 NwaCegarLoop]: 412 mSDtfsCounter, 527 mSDsluCounter, 1863 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-07-12 06:37:40,660 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.1s Time] [2022-07-12 06:37:40,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1562 states. [2022-07-12 06:37:40,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1562 to 1240. [2022-07-12 06:37:40,737 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-12 06:37:40,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1240 states to 1240 states and 1652 transitions. [2022-07-12 06:37:40,740 INFO L78 Accepts]: Start accepts. Automaton has 1240 states and 1652 transitions. Word has length 109 [2022-07-12 06:37:40,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:37:40,740 INFO L495 AbstractCegarLoop]: Abstraction has 1240 states and 1652 transitions. [2022-07-12 06:37:40,740 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-12 06:37:40,740 INFO L276 IsEmpty]: Start isEmpty. Operand 1240 states and 1652 transitions. [2022-07-12 06:37:40,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-07-12 06:37:40,742 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:37:40,742 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-12 06:37:40,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-12 06:37:40,743 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:37:40,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:37:40,743 INFO L85 PathProgramCache]: Analyzing trace with hash 326540891, now seen corresponding path program 1 times [2022-07-12 06:37:40,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:37:40,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552742569] [2022-07-12 06:37:40,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:37:40,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:37:40,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:40,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:37:40,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:40,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 06:37:40,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:40,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 06:37:40,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:40,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 06:37:40,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:40,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 06:37:40,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:40,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 06:37:40,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:40,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 06:37:40,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:40,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-12 06:37:40,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:40,833 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-12 06:37:40,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:37:40,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552742569] [2022-07-12 06:37:40,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552742569] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:37:40,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:37:40,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 06:37:40,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441212375] [2022-07-12 06:37:40,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:37:40,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 06:37:40,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:37:40,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 06:37:40,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 06:37:40,835 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-12 06:37:41,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:37:41,048 INFO L93 Difference]: Finished difference Result 2550 states and 3481 transitions. [2022-07-12 06:37:41,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 06:37:41,049 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-12 06:37:41,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:37:41,054 INFO L225 Difference]: With dead ends: 2550 [2022-07-12 06:37:41,054 INFO L226 Difference]: Without dead ends: 1590 [2022-07-12 06:37:41,056 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-12 06:37:41,056 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.1s IncrementalHoareTripleChecker+Time [2022-07-12 06:37:41,056 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.1s Time] [2022-07-12 06:37:41,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1590 states. [2022-07-12 06:37:41,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1590 to 1126. [2022-07-12 06:37:41,120 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-12 06:37:41,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 1126 states and 1502 transitions. [2022-07-12 06:37:41,123 INFO L78 Accepts]: Start accepts. Automaton has 1126 states and 1502 transitions. Word has length 111 [2022-07-12 06:37:41,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:37:41,123 INFO L495 AbstractCegarLoop]: Abstraction has 1126 states and 1502 transitions. [2022-07-12 06:37:41,123 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-12 06:37:41,124 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 1502 transitions. [2022-07-12 06:37:41,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-07-12 06:37:41,124 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:37:41,125 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-12 06:37:41,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-12 06:37:41,125 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:37:41,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:37:41,125 INFO L85 PathProgramCache]: Analyzing trace with hash 2059853897, now seen corresponding path program 1 times [2022-07-12 06:37:41,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:37:41,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120041428] [2022-07-12 06:37:41,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:37:41,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:37:41,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:41,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:37:41,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:41,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 06:37:41,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:41,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 06:37:41,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:41,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 06:37:41,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:41,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 06:37:41,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:41,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 06:37:41,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:41,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 06:37:41,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:41,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-12 06:37:41,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:41,241 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-12 06:37:41,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:37:41,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120041428] [2022-07-12 06:37:41,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120041428] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:37:41,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:37:41,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 06:37:41,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875269999] [2022-07-12 06:37:41,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:37:41,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 06:37:41,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:37:41,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 06:37:41,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-12 06:37:41,243 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-12 06:37:41,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:37:41,746 INFO L93 Difference]: Finished difference Result 2621 states and 3588 transitions. [2022-07-12 06:37:41,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 06:37:41,746 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-12 06:37:41,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:37:41,753 INFO L225 Difference]: With dead ends: 2621 [2022-07-12 06:37:41,753 INFO L226 Difference]: Without dead ends: 1695 [2022-07-12 06:37:41,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-07-12 06:37:41,755 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.3s IncrementalHoareTripleChecker+Time [2022-07-12 06:37:41,755 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.3s Time] [2022-07-12 06:37:41,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1695 states. [2022-07-12 06:37:41,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1695 to 1142. [2022-07-12 06:37:41,832 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-12 06:37:41,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 1501 transitions. [2022-07-12 06:37:41,834 INFO L78 Accepts]: Start accepts. Automaton has 1142 states and 1501 transitions. Word has length 112 [2022-07-12 06:37:41,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:37:41,835 INFO L495 AbstractCegarLoop]: Abstraction has 1142 states and 1501 transitions. [2022-07-12 06:37:41,835 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-12 06:37:41,835 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 1501 transitions. [2022-07-12 06:37:41,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-07-12 06:37:41,836 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:37:41,836 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-12 06:37:41,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-12 06:37:41,836 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:37:41,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:37:41,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1941201166, now seen corresponding path program 1 times [2022-07-12 06:37:41,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:37:41,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625821761] [2022-07-12 06:37:41,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:37:41,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:37:41,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:41,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:37:41,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:41,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 06:37:41,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:41,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 06:37:41,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:41,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 06:37:41,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:41,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 06:37:41,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:41,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 06:37:41,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:41,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 06:37:41,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:41,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-12 06:37:41,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:41,878 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-12 06:37:41,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:37:41,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625821761] [2022-07-12 06:37:41,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625821761] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:37:41,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:37:41,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 06:37:41,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552902239] [2022-07-12 06:37:41,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:37:41,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 06:37:41,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:37:41,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 06:37:41,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 06:37:41,880 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-12 06:37:42,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:37:42,146 INFO L93 Difference]: Finished difference Result 3187 states and 4275 transitions. [2022-07-12 06:37:42,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 06:37:42,146 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-12 06:37:42,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:37:42,154 INFO L225 Difference]: With dead ends: 3187 [2022-07-12 06:37:42,155 INFO L226 Difference]: Without dead ends: 2296 [2022-07-12 06:37:42,157 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-12 06:37:42,158 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-12 06:37:42,158 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-12 06:37:42,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2296 states. [2022-07-12 06:37:42,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2296 to 1939. [2022-07-12 06:37:42,337 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-12 06:37:42,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1939 states to 1939 states and 2552 transitions. [2022-07-12 06:37:42,342 INFO L78 Accepts]: Start accepts. Automaton has 1939 states and 2552 transitions. Word has length 112 [2022-07-12 06:37:42,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:37:42,342 INFO L495 AbstractCegarLoop]: Abstraction has 1939 states and 2552 transitions. [2022-07-12 06:37:42,342 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-12 06:37:42,343 INFO L276 IsEmpty]: Start isEmpty. Operand 1939 states and 2552 transitions. [2022-07-12 06:37:42,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-12 06:37:42,344 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:37:42,344 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-12 06:37:42,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-12 06:37:42,344 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:37:42,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:37:42,345 INFO L85 PathProgramCache]: Analyzing trace with hash -2103041469, now seen corresponding path program 1 times [2022-07-12 06:37:42,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:37:42,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336574996] [2022-07-12 06:37:42,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:37:42,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:37:42,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:42,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:37:42,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:42,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 06:37:42,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:42,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 06:37:42,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:42,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 06:37:42,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:42,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 06:37:42,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:42,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 06:37:42,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:42,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 06:37:42,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:42,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-12 06:37:42,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:42,491 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-12 06:37:42,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:37:42,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336574996] [2022-07-12 06:37:42,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336574996] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:37:42,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:37:42,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 06:37:42,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070468990] [2022-07-12 06:37:42,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:37:42,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 06:37:42,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:37:42,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 06:37:42,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 06:37:42,493 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-12 06:37:43,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:37:43,180 INFO L93 Difference]: Finished difference Result 4400 states and 5932 transitions. [2022-07-12 06:37:43,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 06:37:43,180 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-12 06:37:43,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:37:43,189 INFO L225 Difference]: With dead ends: 4400 [2022-07-12 06:37:43,190 INFO L226 Difference]: Without dead ends: 2810 [2022-07-12 06:37:43,193 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-12 06:37:43,193 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-12 06:37:43,193 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-12 06:37:43,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2810 states. [2022-07-12 06:37:43,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2810 to 1958. [2022-07-12 06:37:43,338 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-12 06:37:43,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1958 states to 1958 states and 2570 transitions. [2022-07-12 06:37:43,344 INFO L78 Accepts]: Start accepts. Automaton has 1958 states and 2570 transitions. Word has length 114 [2022-07-12 06:37:43,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:37:43,344 INFO L495 AbstractCegarLoop]: Abstraction has 1958 states and 2570 transitions. [2022-07-12 06:37:43,345 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-12 06:37:43,345 INFO L276 IsEmpty]: Start isEmpty. Operand 1958 states and 2570 transitions. [2022-07-12 06:37:43,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-07-12 06:37:43,346 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:37:43,346 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-12 06:37:43,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-12 06:37:43,346 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:37:43,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:37:43,347 INFO L85 PathProgramCache]: Analyzing trace with hash 985009634, now seen corresponding path program 1 times [2022-07-12 06:37:43,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:37:43,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65937832] [2022-07-12 06:37:43,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:37:43,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:37:43,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:43,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:37:43,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:43,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 06:37:43,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:43,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 06:37:43,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:43,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 06:37:43,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:43,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 06:37:43,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:43,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 06:37:43,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:43,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 06:37:43,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:43,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-12 06:37:43,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:43,388 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-12 06:37:43,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:37:43,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65937832] [2022-07-12 06:37:43,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65937832] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:37:43,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:37:43,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 06:37:43,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827779056] [2022-07-12 06:37:43,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:37:43,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 06:37:43,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:37:43,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 06:37:43,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 06:37:43,390 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-12 06:37:43,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:37:43,787 INFO L93 Difference]: Finished difference Result 5168 states and 6863 transitions. [2022-07-12 06:37:43,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 06:37:43,789 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-12 06:37:43,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:37:43,801 INFO L225 Difference]: With dead ends: 5168 [2022-07-12 06:37:43,802 INFO L226 Difference]: Without dead ends: 3594 [2022-07-12 06:37:43,805 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-12 06:37:43,806 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.2s IncrementalHoareTripleChecker+Time [2022-07-12 06:37:43,806 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.2s Time] [2022-07-12 06:37:43,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3594 states. [2022-07-12 06:37:44,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3594 to 3019. [2022-07-12 06:37:44,022 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-12 06:37:44,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3019 states to 3019 states and 3961 transitions. [2022-07-12 06:37:44,029 INFO L78 Accepts]: Start accepts. Automaton has 3019 states and 3961 transitions. Word has length 115 [2022-07-12 06:37:44,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:37:44,029 INFO L495 AbstractCegarLoop]: Abstraction has 3019 states and 3961 transitions. [2022-07-12 06:37:44,029 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-12 06:37:44,029 INFO L276 IsEmpty]: Start isEmpty. Operand 3019 states and 3961 transitions. [2022-07-12 06:37:44,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-07-12 06:37:44,031 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:37:44,031 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-12 06:37:44,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-12 06:37:44,031 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:37:44,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:37:44,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1237817774, now seen corresponding path program 1 times [2022-07-12 06:37:44,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:37:44,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846226155] [2022-07-12 06:37:44,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:37:44,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:37:44,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:44,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:37:44,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:44,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 06:37:44,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:44,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 06:37:44,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:44,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 06:37:44,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:44,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 06:37:44,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:44,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 06:37:44,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:44,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-12 06:37:44,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:44,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-12 06:37:44,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:44,073 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-12 06:37:44,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:37:44,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846226155] [2022-07-12 06:37:44,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846226155] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:37:44,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:37:44,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 06:37:44,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821829544] [2022-07-12 06:37:44,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:37:44,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 06:37:44,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:37:44,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 06:37:44,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 06:37:44,075 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-12 06:37:44,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:37:44,499 INFO L93 Difference]: Finished difference Result 7140 states and 9437 transitions. [2022-07-12 06:37:44,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 06:37:44,499 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-12 06:37:44,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:37:44,515 INFO L225 Difference]: With dead ends: 7140 [2022-07-12 06:37:44,515 INFO L226 Difference]: Without dead ends: 4635 [2022-07-12 06:37:44,521 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-12 06:37:44,521 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-12 06:37:44,522 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-12 06:37:44,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4635 states. [2022-07-12 06:37:44,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4635 to 4297. [2022-07-12 06:37:44,816 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-12 06:37:44,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4297 states to 4297 states and 5636 transitions. [2022-07-12 06:37:44,825 INFO L78 Accepts]: Start accepts. Automaton has 4297 states and 5636 transitions. Word has length 115 [2022-07-12 06:37:44,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:37:44,825 INFO L495 AbstractCegarLoop]: Abstraction has 4297 states and 5636 transitions. [2022-07-12 06:37:44,825 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-12 06:37:44,825 INFO L276 IsEmpty]: Start isEmpty. Operand 4297 states and 5636 transitions. [2022-07-12 06:37:44,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-07-12 06:37:44,827 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:37:44,827 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-12 06:37:44,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-12 06:37:44,828 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:37:44,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:37:44,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1950956728, now seen corresponding path program 1 times [2022-07-12 06:37:44,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:37:44,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982917896] [2022-07-12 06:37:44,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:37:44,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:37:44,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:44,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:37:44,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:44,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 06:37:44,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:44,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 06:37:44,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:44,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 06:37:44,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:44,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 06:37:44,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:44,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 06:37:44,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:44,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 06:37:44,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:44,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 06:37:44,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:44,857 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-12 06:37:44,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:37:44,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982917896] [2022-07-12 06:37:44,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982917896] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:37:44,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:37:44,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 06:37:44,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233719069] [2022-07-12 06:37:44,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:37:44,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 06:37:44,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:37:44,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 06:37:44,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 06:37:44,859 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-12 06:37:45,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:37:45,321 INFO L93 Difference]: Finished difference Result 9720 states and 13194 transitions. [2022-07-12 06:37:45,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 06:37:45,322 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-12 06:37:45,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:37:45,337 INFO L225 Difference]: With dead ends: 9720 [2022-07-12 06:37:45,337 INFO L226 Difference]: Without dead ends: 5828 [2022-07-12 06:37:45,343 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-12 06:37:45,344 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-12 06:37:45,344 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-12 06:37:45,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5828 states. [2022-07-12 06:37:45,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5828 to 4303. [2022-07-12 06:37:45,664 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-12 06:37:45,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4303 states to 4303 states and 5642 transitions. [2022-07-12 06:37:45,672 INFO L78 Accepts]: Start accepts. Automaton has 4303 states and 5642 transitions. Word has length 116 [2022-07-12 06:37:45,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:37:45,672 INFO L495 AbstractCegarLoop]: Abstraction has 4303 states and 5642 transitions. [2022-07-12 06:37:45,672 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-12 06:37:45,672 INFO L276 IsEmpty]: Start isEmpty. Operand 4303 states and 5642 transitions. [2022-07-12 06:37:45,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-12 06:37:45,674 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:37:45,674 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-12 06:37:45,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-12 06:37:45,674 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:37:45,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:37:45,675 INFO L85 PathProgramCache]: Analyzing trace with hash -2025473139, now seen corresponding path program 1 times [2022-07-12 06:37:45,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:37:45,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159841081] [2022-07-12 06:37:45,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:37:45,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:37:45,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:45,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:37:45,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:45,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 06:37:45,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:45,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 06:37:45,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:45,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 06:37:45,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:45,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 06:37:45,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:45,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 06:37:45,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:45,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-12 06:37:45,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:45,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-12 06:37:45,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:45,719 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-12 06:37:45,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:37:45,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159841081] [2022-07-12 06:37:45,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159841081] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:37:45,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:37:45,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 06:37:45,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415714614] [2022-07-12 06:37:45,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:37:45,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 06:37:45,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:37:45,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 06:37:45,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 06:37:45,721 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-12 06:37:46,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:37:46,060 INFO L93 Difference]: Finished difference Result 9016 states and 12080 transitions. [2022-07-12 06:37:46,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 06:37:46,061 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-12 06:37:46,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:37:46,075 INFO L225 Difference]: With dead ends: 9016 [2022-07-12 06:37:46,076 INFO L226 Difference]: Without dead ends: 4810 [2022-07-12 06:37:46,083 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-12 06:37:46,084 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-12 06:37:46,084 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-12 06:37:46,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4810 states. [2022-07-12 06:37:46,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4810 to 3870. [2022-07-12 06:37:46,452 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-12 06:37:46,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3870 states to 3870 states and 5096 transitions. [2022-07-12 06:37:46,461 INFO L78 Accepts]: Start accepts. Automaton has 3870 states and 5096 transitions. Word has length 117 [2022-07-12 06:37:46,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:37:46,462 INFO L495 AbstractCegarLoop]: Abstraction has 3870 states and 5096 transitions. [2022-07-12 06:37:46,462 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-12 06:37:46,462 INFO L276 IsEmpty]: Start isEmpty. Operand 3870 states and 5096 transitions. [2022-07-12 06:37:46,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-07-12 06:37:46,463 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:37:46,464 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-12 06:37:46,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-12 06:37:46,464 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:37:46,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:37:46,464 INFO L85 PathProgramCache]: Analyzing trace with hash 183157843, now seen corresponding path program 1 times [2022-07-12 06:37:46,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:37:46,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847091226] [2022-07-12 06:37:46,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:37:46,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:37:46,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:46,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:37:46,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:46,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 06:37:46,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:46,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 06:37:46,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:46,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 06:37:46,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:46,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 06:37:46,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:46,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 06:37:46,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:46,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 06:37:46,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:46,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 06:37:46,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:46,500 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-12 06:37:46,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:37:46,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847091226] [2022-07-12 06:37:46,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847091226] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:37:46,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:37:46,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 06:37:46,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128315920] [2022-07-12 06:37:46,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:37:46,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 06:37:46,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:37:46,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 06:37:46,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 06:37:46,502 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-12 06:37:46,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:37:46,959 INFO L93 Difference]: Finished difference Result 8518 states and 11512 transitions. [2022-07-12 06:37:46,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 06:37:46,960 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-12 06:37:46,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:37:46,972 INFO L225 Difference]: With dead ends: 8518 [2022-07-12 06:37:46,973 INFO L226 Difference]: Without dead ends: 4861 [2022-07-12 06:37:46,980 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-12 06:37:46,980 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-12 06:37:46,981 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-12 06:37:46,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4861 states. [2022-07-12 06:37:47,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4861 to 3880. [2022-07-12 06:37:47,295 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-12 06:37:47,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3880 states to 3880 states and 5106 transitions. [2022-07-12 06:37:47,304 INFO L78 Accepts]: Start accepts. Automaton has 3880 states and 5106 transitions. Word has length 118 [2022-07-12 06:37:47,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:37:47,304 INFO L495 AbstractCegarLoop]: Abstraction has 3880 states and 5106 transitions. [2022-07-12 06:37:47,304 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-12 06:37:47,304 INFO L276 IsEmpty]: Start isEmpty. Operand 3880 states and 5106 transitions. [2022-07-12 06:37:47,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-07-12 06:37:47,306 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:37:47,306 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-12 06:37:47,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-12 06:37:47,307 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:37:47,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:37:47,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1515793806, now seen corresponding path program 1 times [2022-07-12 06:37:47,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:37:47,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144292169] [2022-07-12 06:37:47,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:37:47,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:37:47,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:47,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:37:47,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:47,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 06:37:47,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:47,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 06:37:47,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:47,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 06:37:47,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:47,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 06:37:47,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:47,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 06:37:47,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:47,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 06:37:47,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:47,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 06:37:47,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:47,364 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-12 06:37:47,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:37:47,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144292169] [2022-07-12 06:37:47,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144292169] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:37:47,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:37:47,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 06:37:47,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326577510] [2022-07-12 06:37:47,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:37:47,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 06:37:47,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:37:47,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 06:37:47,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 06:37:47,366 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-12 06:37:47,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:37:47,714 INFO L93 Difference]: Finished difference Result 8465 states and 11428 transitions. [2022-07-12 06:37:47,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 06:37:47,715 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-12 06:37:47,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:37:47,729 INFO L225 Difference]: With dead ends: 8465 [2022-07-12 06:37:47,729 INFO L226 Difference]: Without dead ends: 4731 [2022-07-12 06:37:47,738 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-12 06:37:47,739 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-12 06:37:47,739 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-12 06:37:47,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4731 states. [2022-07-12 06:37:48,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4731 to 2927. [2022-07-12 06:37:48,008 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-12 06:37:48,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2927 states to 2927 states and 3836 transitions. [2022-07-12 06:37:48,014 INFO L78 Accepts]: Start accepts. Automaton has 2927 states and 3836 transitions. Word has length 118 [2022-07-12 06:37:48,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:37:48,014 INFO L495 AbstractCegarLoop]: Abstraction has 2927 states and 3836 transitions. [2022-07-12 06:37:48,014 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-12 06:37:48,015 INFO L276 IsEmpty]: Start isEmpty. Operand 2927 states and 3836 transitions. [2022-07-12 06:37:48,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-07-12 06:37:48,018 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:37:48,019 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-12 06:37:48,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-12 06:37:48,019 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:37:48,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:37:48,019 INFO L85 PathProgramCache]: Analyzing trace with hash -402462666, now seen corresponding path program 1 times [2022-07-12 06:37:48,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:37:48,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450105721] [2022-07-12 06:37:48,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:37:48,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:37:48,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:48,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:37:48,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:48,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 06:37:48,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:48,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 06:37:48,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:48,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 06:37:48,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:48,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 06:37:48,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:48,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 06:37:48,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:48,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 06:37:48,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:48,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 06:37:48,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:48,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-12 06:37:48,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:48,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-12 06:37:48,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:48,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-12 06:37:48,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:48,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-12 06:37:48,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:48,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-12 06:37:48,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:48,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-12 06:37:48,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:48,148 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-12 06:37:48,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:37:48,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450105721] [2022-07-12 06:37:48,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450105721] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:37:48,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028372934] [2022-07-12 06:37:48,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:37:48,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:37:48,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:37:48,152 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-12 06:37:48,186 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-12 06:37:48,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:48,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 748 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 06:37:48,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:37:48,558 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-12 06:37:48,558 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 06:37:48,714 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-12 06:37:48,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028372934] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 06:37:48,714 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 06:37:48,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-07-12 06:37:48,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104711402] [2022-07-12 06:37:48,715 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 06:37:48,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 06:37:48,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:37:48,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 06:37:48,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-07-12 06:37:48,716 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-12 06:37:51,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:37:51,735 INFO L93 Difference]: Finished difference Result 10002 states and 14000 transitions. [2022-07-12 06:37:51,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-07-12 06:37:51,735 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-12 06:37:51,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:37:51,756 INFO L225 Difference]: With dead ends: 10002 [2022-07-12 06:37:51,756 INFO L226 Difference]: Without dead ends: 7362 [2022-07-12 06:37:51,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 404 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1358 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=749, Invalid=3411, Unknown=0, NotChecked=0, Total=4160 [2022-07-12 06:37:51,764 INFO L413 NwaCegarLoop]: 337 mSDtfsCounter, 4481 mSDsluCounter, 2949 mSDsCounter, 0 mSdLazyCounter, 2038 mSolverCounterSat, 1308 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4481 SdHoareTripleChecker+Valid, 3286 SdHoareTripleChecker+Invalid, 3346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1308 IncrementalHoareTripleChecker+Valid, 2038 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-12 06:37:51,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4481 Valid, 3286 Invalid, 3346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1308 Valid, 2038 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-12 06:37:51,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7362 states. [2022-07-12 06:37:52,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7362 to 3451. [2022-07-12 06:37:52,212 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-12 06:37:52,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3451 states to 3451 states and 4497 transitions. [2022-07-12 06:37:52,221 INFO L78 Accepts]: Start accepts. Automaton has 3451 states and 4497 transitions. Word has length 186 [2022-07-12 06:37:52,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:37:52,221 INFO L495 AbstractCegarLoop]: Abstraction has 3451 states and 4497 transitions. [2022-07-12 06:37:52,222 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-12 06:37:52,222 INFO L276 IsEmpty]: Start isEmpty. Operand 3451 states and 4497 transitions. [2022-07-12 06:37:52,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-07-12 06:37:52,227 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:37:52,227 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-12 06:37:52,262 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-12 06:37:52,445 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-12 06:37:52,446 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:37:52,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:37:52,446 INFO L85 PathProgramCache]: Analyzing trace with hash 141381451, now seen corresponding path program 1 times [2022-07-12 06:37:52,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:37:52,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252265708] [2022-07-12 06:37:52,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:37:52,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:37:52,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:52,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:37:52,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:52,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 06:37:52,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:52,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 06:37:52,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:52,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 06:37:52,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:52,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 06:37:52,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:52,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 06:37:52,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:52,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 06:37:52,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:52,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-12 06:37:52,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:52,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 06:37:52,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:52,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 06:37:52,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:52,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-12 06:37:52,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:52,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-12 06:37:52,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:52,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-12 06:37:52,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:52,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-12 06:37:52,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:52,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-12 06:37:52,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:52,595 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-12 06:37:52,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:37:52,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252265708] [2022-07-12 06:37:52,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252265708] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:37:52,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022120112] [2022-07-12 06:37:52,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:37:52,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:37:52,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:37:52,598 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-12 06:37:52,599 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-12 06:37:52,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:52,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 793 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-12 06:37:52,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:37:52,999 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-12 06:37:53,000 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 06:37:53,193 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-12 06:37:53,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1022120112] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 06:37:53,193 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 06:37:53,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2022-07-12 06:37:53,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786081981] [2022-07-12 06:37:53,194 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 06:37:53,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-12 06:37:53,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:37:53,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-12 06:37:53,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2022-07-12 06:37:53,195 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-12 06:38:00,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:38:00,458 INFO L93 Difference]: Finished difference Result 17532 states and 23957 transitions. [2022-07-12 06:38:00,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2022-07-12 06:38:00,459 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-12 06:38:00,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:38:00,498 INFO L225 Difference]: With dead ends: 17532 [2022-07-12 06:38:00,498 INFO L226 Difference]: Without dead ends: 14377 [2022-07-12 06:38:00,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 594 GetRequests, 476 SyntacticMatches, 1 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5045 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1835, Invalid=12207, Unknown=0, NotChecked=0, Total=14042 [2022-07-12 06:38:00,509 INFO L413 NwaCegarLoop]: 1832 mSDtfsCounter, 5889 mSDsluCounter, 13834 mSDsCounter, 0 mSdLazyCounter, 5456 mSolverCounterSat, 3535 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s 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, 3.3s IncrementalHoareTripleChecker+Time [2022-07-12 06:38:00,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5889 Valid, 15666 Invalid, 8991 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3535 Valid, 5456 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-07-12 06:38:00,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14377 states. [2022-07-12 06:38:01,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14377 to 6318. [2022-07-12 06:38:01,205 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-12 06:38:01,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6318 states to 6318 states and 8244 transitions. [2022-07-12 06:38:01,219 INFO L78 Accepts]: Start accepts. Automaton has 6318 states and 8244 transitions. Word has length 194 [2022-07-12 06:38:01,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:38:01,220 INFO L495 AbstractCegarLoop]: Abstraction has 6318 states and 8244 transitions. [2022-07-12 06:38:01,220 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-12 06:38:01,220 INFO L276 IsEmpty]: Start isEmpty. Operand 6318 states and 8244 transitions. [2022-07-12 06:38:01,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-07-12 06:38:01,228 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:38:01,228 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-12 06:38:01,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-12 06:38:01,441 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-12 06:38:01,442 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:38:01,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:38:01,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1389154626, now seen corresponding path program 1 times [2022-07-12 06:38:01,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:38:01,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922099974] [2022-07-12 06:38:01,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:38:01,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:38:01,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:01,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:38:01,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:01,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 06:38:01,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:01,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 06:38:01,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:01,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 06:38:01,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:01,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 06:38:01,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:01,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 06:38:01,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:01,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 06:38:01,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:01,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 06:38:01,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:01,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 06:38:01,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:01,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-12 06:38:01,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:01,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-12 06:38:01,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:01,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-12 06:38:01,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:01,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-07-12 06:38:01,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:01,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-12 06:38:01,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:01,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-07-12 06:38:01,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:01,554 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-12 06:38:01,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:38:01,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922099974] [2022-07-12 06:38:01,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922099974] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:38:01,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:38:01,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 06:38:01,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130659748] [2022-07-12 06:38:01,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:38:01,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 06:38:01,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:38:01,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 06:38:01,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 06:38:01,555 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-12 06:38:03,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:38:03,501 INFO L93 Difference]: Finished difference Result 21338 states and 28586 transitions. [2022-07-12 06:38:03,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 06:38:03,501 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-12 06:38:03,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:38:03,539 INFO L225 Difference]: With dead ends: 21338 [2022-07-12 06:38:03,539 INFO L226 Difference]: Without dead ends: 15378 [2022-07-12 06:38:03,550 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-12 06:38:03,551 INFO L413 NwaCegarLoop]: 574 mSDtfsCounter, 817 mSDsluCounter, 2520 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-12 06:38:03,551 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-12 06:38:03,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15378 states. [2022-07-12 06:38:04,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15378 to 8160. [2022-07-12 06:38:04,574 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-12 06:38:04,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8160 states to 8160 states and 10658 transitions. [2022-07-12 06:38:04,590 INFO L78 Accepts]: Start accepts. Automaton has 8160 states and 10658 transitions. Word has length 196 [2022-07-12 06:38:04,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:38:04,593 INFO L495 AbstractCegarLoop]: Abstraction has 8160 states and 10658 transitions. [2022-07-12 06:38:04,593 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-12 06:38:04,593 INFO L276 IsEmpty]: Start isEmpty. Operand 8160 states and 10658 transitions. [2022-07-12 06:38:04,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2022-07-12 06:38:04,604 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:38:04,604 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-12 06:38:04,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-12 06:38:04,604 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:38:04,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:38:04,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1333769863, now seen corresponding path program 1 times [2022-07-12 06:38:04,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:38:04,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378685473] [2022-07-12 06:38:04,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:38:04,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:38:04,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:04,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:38:04,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:04,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 06:38:04,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:04,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 06:38:04,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:04,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 06:38:04,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:04,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 06:38:04,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:04,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 06:38:04,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:04,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 06:38:04,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:04,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 06:38:04,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:04,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 06:38:04,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:04,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-12 06:38:04,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:04,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-12 06:38:04,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:04,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-12 06:38:04,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:04,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-12 06:38:04,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:04,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-07-12 06:38:04,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:04,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-12 06:38:04,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:04,728 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-12 06:38:04,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:38:04,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378685473] [2022-07-12 06:38:04,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378685473] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:38:04,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057977694] [2022-07-12 06:38:04,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:38:04,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:38:04,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:38:04,744 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-12 06:38:04,745 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-12 06:38:04,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:04,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 798 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-12 06:38:04,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:38:04,945 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-12 06:38:04,945 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 06:38:05,044 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-12 06:38:05,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2057977694] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-12 06:38:05,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-12 06:38:05,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8, 7] total 14 [2022-07-12 06:38:05,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289013272] [2022-07-12 06:38:05,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:38:05,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 06:38:05,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:38:05,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 06:38:05,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-07-12 06:38:05,047 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-12 06:38:05,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:38:05,640 INFO L93 Difference]: Finished difference Result 13442 states and 17611 transitions. [2022-07-12 06:38:05,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 06:38:05,641 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-12 06:38:05,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:38:05,653 INFO L225 Difference]: With dead ends: 13442 [2022-07-12 06:38:05,653 INFO L226 Difference]: Without dead ends: 5488 [2022-07-12 06:38:05,662 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-12 06:38:05,662 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-12 06:38:05,663 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-12 06:38:05,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5488 states. [2022-07-12 06:38:06,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5488 to 5488. [2022-07-12 06:38:06,168 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-12 06:38:06,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5488 states to 5488 states and 7173 transitions. [2022-07-12 06:38:06,179 INFO L78 Accepts]: Start accepts. Automaton has 5488 states and 7173 transitions. Word has length 198 [2022-07-12 06:38:06,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:38:06,184 INFO L495 AbstractCegarLoop]: Abstraction has 5488 states and 7173 transitions. [2022-07-12 06:38:06,184 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-12 06:38:06,184 INFO L276 IsEmpty]: Start isEmpty. Operand 5488 states and 7173 transitions. [2022-07-12 06:38:06,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2022-07-12 06:38:06,207 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:38:06,207 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-12 06:38:06,238 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-12 06:38:06,426 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-12 06:38:06,426 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:38:06,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:38:06,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1056461284, now seen corresponding path program 1 times [2022-07-12 06:38:06,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:38:06,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638685554] [2022-07-12 06:38:06,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:38:06,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:38:06,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:06,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:38:06,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:06,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 06:38:06,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:06,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 06:38:06,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:06,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 06:38:06,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:06,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 06:38:06,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:06,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 06:38:06,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:06,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 06:38:06,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:06,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 06:38:06,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:06,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 06:38:06,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:06,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-12 06:38:06,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:06,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-12 06:38:06,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:06,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-12 06:38:06,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:06,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-12 06:38:06,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:06,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-07-12 06:38:06,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:06,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-12 06:38:06,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:06,715 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-12 06:38:06,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:38:06,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638685554] [2022-07-12 06:38:06,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638685554] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:38:06,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608171249] [2022-07-12 06:38:06,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:38:06,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:38:06,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:38:06,736 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-12 06:38:06,738 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-12 06:38:06,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:06,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 824 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-12 06:38:06,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:38:07,247 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-12 06:38:07,247 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 06:38:07,491 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-12 06:38:07,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608171249] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 06:38:07,491 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 06:38:07,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 8] total 24 [2022-07-12 06:38:07,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839808423] [2022-07-12 06:38:07,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 06:38:07,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-12 06:38:07,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:38:07,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-12 06:38:07,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=488, Unknown=0, NotChecked=0, Total=552 [2022-07-12 06:38:07,493 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-12 06:38:20,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:38:20,842 INFO L93 Difference]: Finished difference Result 27311 states and 38275 transitions. [2022-07-12 06:38:20,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 203 states. [2022-07-12 06:38:20,843 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-12 06:38:20,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:38:20,909 INFO L225 Difference]: With dead ends: 27311 [2022-07-12 06:38:20,910 INFO L226 Difference]: Without dead ends: 22107 [2022-07-12 06:38:20,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 640 GetRequests, 417 SyntacticMatches, 1 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20333 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5256, Invalid=44696, Unknown=0, NotChecked=0, Total=49952 [2022-07-12 06:38:20,931 INFO L413 NwaCegarLoop]: 698 mSDtfsCounter, 10125 mSDsluCounter, 8131 mSDsCounter, 0 mSdLazyCounter, 12316 mSolverCounterSat, 4950 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s 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, 5.8s IncrementalHoareTripleChecker+Time [2022-07-12 06:38:20,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10125 Valid, 8829 Invalid, 17266 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4950 Valid, 12316 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2022-07-12 06:38:20,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22107 states. [2022-07-12 06:38:22,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22107 to 11273. [2022-07-12 06:38:22,702 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-12 06:38:22,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11273 states to 11273 states and 14681 transitions. [2022-07-12 06:38:22,733 INFO L78 Accepts]: Start accepts. Automaton has 11273 states and 14681 transitions. Word has length 198 [2022-07-12 06:38:22,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:38:22,733 INFO L495 AbstractCegarLoop]: Abstraction has 11273 states and 14681 transitions. [2022-07-12 06:38:22,734 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-12 06:38:22,734 INFO L276 IsEmpty]: Start isEmpty. Operand 11273 states and 14681 transitions. [2022-07-12 06:38:22,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2022-07-12 06:38:22,752 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:38:22,752 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-12 06:38:22,786 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-12 06:38:22,971 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-12 06:38:22,972 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:38:22,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:38:22,972 INFO L85 PathProgramCache]: Analyzing trace with hash 988856049, now seen corresponding path program 1 times [2022-07-12 06:38:22,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:38:22,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085785945] [2022-07-12 06:38:22,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:38:22,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:38:22,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:23,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:38:23,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:23,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 06:38:23,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:23,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 06:38:23,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:23,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 06:38:23,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:23,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 06:38:23,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:23,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 06:38:23,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:23,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 06:38:23,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:23,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 06:38:23,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:23,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 06:38:23,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:23,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-12 06:38:23,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:23,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-12 06:38:23,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:23,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-12 06:38:23,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:23,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-12 06:38:23,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:23,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-07-12 06:38:23,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:23,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-12 06:38:23,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:23,069 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-12 06:38:23,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:38:23,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085785945] [2022-07-12 06:38:23,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085785945] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:38:23,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:38:23,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 06:38:23,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954001520] [2022-07-12 06:38:23,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:38:23,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 06:38:23,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:38:23,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 06:38:23,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-12 06:38:23,072 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-12 06:38:24,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:38:24,265 INFO L93 Difference]: Finished difference Result 21529 states and 28129 transitions. [2022-07-12 06:38:24,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 06:38:24,265 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-12 06:38:24,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:38:24,292 INFO L225 Difference]: With dead ends: 21529 [2022-07-12 06:38:24,292 INFO L226 Difference]: Without dead ends: 10523 [2022-07-12 06:38:24,309 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-12 06:38:24,309 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-12 06:38:24,309 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-12 06:38:24,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10523 states. [2022-07-12 06:38:25,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10523 to 10523. [2022-07-12 06:38:25,505 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-12 06:38:25,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10523 states to 10523 states and 13723 transitions. [2022-07-12 06:38:25,528 INFO L78 Accepts]: Start accepts. Automaton has 10523 states and 13723 transitions. Word has length 198 [2022-07-12 06:38:25,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:38:25,528 INFO L495 AbstractCegarLoop]: Abstraction has 10523 states and 13723 transitions. [2022-07-12 06:38:25,528 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-12 06:38:25,528 INFO L276 IsEmpty]: Start isEmpty. Operand 10523 states and 13723 transitions. [2022-07-12 06:38:25,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-07-12 06:38:25,539 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:38:25,540 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-12 06:38:25,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-07-12 06:38:25,540 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:38:25,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:38:25,541 INFO L85 PathProgramCache]: Analyzing trace with hash 2041661109, now seen corresponding path program 1 times [2022-07-12 06:38:25,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:38:25,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971196496] [2022-07-12 06:38:25,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:38:25,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:38:25,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:25,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:38:25,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:25,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 06:38:25,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:25,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 06:38:25,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:25,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 06:38:25,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:25,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 06:38:25,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:25,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 06:38:25,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:25,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 06:38:25,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:25,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 06:38:25,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:25,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 06:38:25,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:25,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-12 06:38:25,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:25,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-12 06:38:25,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:25,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-12 06:38:25,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:25,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-12 06:38:25,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:25,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-12 06:38:25,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:25,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-12 06:38:25,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:25,711 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-12 06:38:25,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:38:25,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971196496] [2022-07-12 06:38:25,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971196496] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:38:25,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1506600898] [2022-07-12 06:38:25,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:38:25,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:38:25,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:38:25,732 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-12 06:38:25,733 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-12 06:38:25,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:25,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 823 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-12 06:38:25,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:38:26,034 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-12 06:38:26,034 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 06:38:26,141 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-12 06:38:26,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1506600898] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 06:38:26,141 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 06:38:26,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 17 [2022-07-12 06:38:26,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844202261] [2022-07-12 06:38:26,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 06:38:26,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-12 06:38:26,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:38:26,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-12 06:38:26,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2022-07-12 06:38:26,143 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-12 06:38:32,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:38:32,464 INFO L93 Difference]: Finished difference Result 32522 states and 44939 transitions. [2022-07-12 06:38:32,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-07-12 06:38:32,465 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-12 06:38:32,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:38:32,514 INFO L225 Difference]: With dead ends: 32522 [2022-07-12 06:38:32,514 INFO L226 Difference]: Without dead ends: 22305 [2022-07-12 06:38:32,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 430 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2052 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=886, Invalid=5594, Unknown=0, NotChecked=0, Total=6480 [2022-07-12 06:38:32,552 INFO L413 NwaCegarLoop]: 644 mSDtfsCounter, 3052 mSDsluCounter, 6315 mSDsCounter, 0 mSdLazyCounter, 5308 mSolverCounterSat, 1476 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s 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.2s IncrementalHoareTripleChecker+Time [2022-07-12 06:38:32,554 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.2s Time] [2022-07-12 06:38:32,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22305 states. [2022-07-12 06:38:34,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22305 to 11869. [2022-07-12 06:38:34,211 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-12 06:38:34,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11869 states to 11869 states and 15425 transitions. [2022-07-12 06:38:34,236 INFO L78 Accepts]: Start accepts. Automaton has 11869 states and 15425 transitions. Word has length 199 [2022-07-12 06:38:34,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:38:34,237 INFO L495 AbstractCegarLoop]: Abstraction has 11869 states and 15425 transitions. [2022-07-12 06:38:34,237 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-12 06:38:34,237 INFO L276 IsEmpty]: Start isEmpty. Operand 11869 states and 15425 transitions. [2022-07-12 06:38:34,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-07-12 06:38:34,249 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:38:34,250 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-12 06:38:34,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-07-12 06:38:34,456 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-12 06:38:34,457 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:38:34,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:38:34,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1117795559, now seen corresponding path program 1 times [2022-07-12 06:38:34,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:38:34,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731024166] [2022-07-12 06:38:34,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:38:34,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:38:34,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:34,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:38:34,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:34,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 06:38:34,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:34,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 06:38:34,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:34,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 06:38:34,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:34,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 06:38:34,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:34,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 06:38:34,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:34,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 06:38:34,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:34,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 06:38:34,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:34,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 06:38:34,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:34,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 06:38:34,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:34,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-12 06:38:34,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:34,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-12 06:38:34,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:34,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-12 06:38:34,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:34,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-12 06:38:34,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:34,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-12 06:38:34,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:34,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-12 06:38:34,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:34,522 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-12 06:38:34,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:38:34,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731024166] [2022-07-12 06:38:34,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731024166] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:38:34,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:38:34,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 06:38:34,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896610466] [2022-07-12 06:38:34,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:38:34,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 06:38:34,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:38:34,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 06:38:34,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 06:38:34,523 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-12 06:38:35,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:38:35,864 INFO L93 Difference]: Finished difference Result 22325 states and 29122 transitions. [2022-07-12 06:38:35,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 06:38:35,865 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-12 06:38:35,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:38:35,888 INFO L225 Difference]: With dead ends: 22325 [2022-07-12 06:38:35,889 INFO L226 Difference]: Without dead ends: 10725 [2022-07-12 06:38:35,904 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-12 06:38:35,906 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-12 06:38:35,906 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-12 06:38:35,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10725 states. [2022-07-12 06:38:37,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10725 to 10693. [2022-07-12 06:38:37,282 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-12 06:38:37,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10693 states to 10693 states and 13906 transitions. [2022-07-12 06:38:37,303 INFO L78 Accepts]: Start accepts. Automaton has 10693 states and 13906 transitions. Word has length 207 [2022-07-12 06:38:37,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:38:37,303 INFO L495 AbstractCegarLoop]: Abstraction has 10693 states and 13906 transitions. [2022-07-12 06:38:37,303 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-12 06:38:37,303 INFO L276 IsEmpty]: Start isEmpty. Operand 10693 states and 13906 transitions. [2022-07-12 06:38:37,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-07-12 06:38:37,316 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:38:37,317 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-12 06:38:37,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-07-12 06:38:37,317 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:38:37,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:38:37,318 INFO L85 PathProgramCache]: Analyzing trace with hash 147970794, now seen corresponding path program 1 times [2022-07-12 06:38:37,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:38:37,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367544026] [2022-07-12 06:38:37,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:38:37,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:38:37,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:37,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:38:37,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:37,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 06:38:37,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:37,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 06:38:37,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:37,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 06:38:37,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:37,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 06:38:37,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:37,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 06:38:37,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:37,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 06:38:37,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:37,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-12 06:38:37,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:37,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-12 06:38:37,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:37,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-12 06:38:37,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:37,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-12 06:38:37,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:37,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-12 06:38:37,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:37,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-12 06:38:37,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:37,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-12 06:38:37,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:37,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-12 06:38:37,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:37,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-07-12 06:38:37,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:37,398 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-12 06:38:37,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:38:37,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367544026] [2022-07-12 06:38:37,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367544026] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:38:37,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407085681] [2022-07-12 06:38:37,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:38:37,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:38:37,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:38:37,399 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-12 06:38:37,400 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-12 06:38:37,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:37,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 842 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 06:38:37,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:38:37,746 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-12 06:38:37,746 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 06:38:37,932 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-12 06:38:37,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407085681] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 06:38:37,932 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 06:38:37,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 10 [2022-07-12 06:38:37,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313818701] [2022-07-12 06:38:37,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 06:38:37,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 06:38:37,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:38:37,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 06:38:37,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-12 06:38:37,934 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-12 06:38:41,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:38:41,099 INFO L93 Difference]: Finished difference Result 33530 states and 43784 transitions. [2022-07-12 06:38:41,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 06:38:41,100 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-12 06:38:41,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:38:41,144 INFO L225 Difference]: With dead ends: 33530 [2022-07-12 06:38:41,144 INFO L226 Difference]: Without dead ends: 23272 [2022-07-12 06:38:41,159 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-12 06:38:41,160 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-12 06:38:41,161 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-12 06:38:41,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23272 states. [2022-07-12 06:38:43,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23272 to 16703. [2022-07-12 06:38:43,322 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-12 06:38:43,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16703 states to 16703 states and 21464 transitions. [2022-07-12 06:38:43,353 INFO L78 Accepts]: Start accepts. Automaton has 16703 states and 21464 transitions. Word has length 208 [2022-07-12 06:38:43,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:38:43,354 INFO L495 AbstractCegarLoop]: Abstraction has 16703 states and 21464 transitions. [2022-07-12 06:38:43,354 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-12 06:38:43,354 INFO L276 IsEmpty]: Start isEmpty. Operand 16703 states and 21464 transitions. [2022-07-12 06:38:43,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-07-12 06:38:43,362 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:38:43,362 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-12 06:38:43,379 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-12 06:38:43,579 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-12 06:38:43,579 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:38:43,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:38:43,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1640642370, now seen corresponding path program 1 times [2022-07-12 06:38:43,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:38:43,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187364672] [2022-07-12 06:38:43,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:38:43,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:38:43,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:43,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:38:43,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:43,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 06:38:43,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:43,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 06:38:43,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:43,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 06:38:43,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:43,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 06:38:43,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:43,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 06:38:43,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:43,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 06:38:43,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:43,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 06:38:43,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:43,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 06:38:43,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:43,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 06:38:43,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:43,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-12 06:38:43,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:43,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-12 06:38:43,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:43,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-12 06:38:43,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:43,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-12 06:38:43,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:43,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-12 06:38:43,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:43,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-12 06:38:43,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:43,698 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-12 06:38:43,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:38:43,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187364672] [2022-07-12 06:38:43,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187364672] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:38:43,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16066914] [2022-07-12 06:38:43,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:38:43,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:38:43,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:38:43,700 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-12 06:38:43,702 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-12 06:38:43,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:43,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 842 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 06:38:43,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:38:43,953 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-12 06:38:43,953 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 06:38:44,077 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-12 06:38:44,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [16066914] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 06:38:44,078 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 06:38:44,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2022-07-12 06:38:44,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136783638] [2022-07-12 06:38:44,078 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 06:38:44,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 06:38:44,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:38:44,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 06:38:44,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-12 06:38:44,079 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-12 06:38:47,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:38:47,337 INFO L93 Difference]: Finished difference Result 38927 states and 51697 transitions. [2022-07-12 06:38:47,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 06:38:47,338 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-12 06:38:47,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:38:47,387 INFO L225 Difference]: With dead ends: 38927 [2022-07-12 06:38:47,387 INFO L226 Difference]: Without dead ends: 22530 [2022-07-12 06:38:47,406 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-12 06:38:47,407 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-12 06:38:47,407 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-12 06:38:47,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22530 states. [2022-07-12 06:38:49,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22530 to 16703. [2022-07-12 06:38:49,826 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-12 06:38:49,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16703 states to 16703 states and 21459 transitions. [2022-07-12 06:38:49,860 INFO L78 Accepts]: Start accepts. Automaton has 16703 states and 21459 transitions. Word has length 208 [2022-07-12 06:38:49,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:38:49,860 INFO L495 AbstractCegarLoop]: Abstraction has 16703 states and 21459 transitions. [2022-07-12 06:38:49,860 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-12 06:38:49,860 INFO L276 IsEmpty]: Start isEmpty. Operand 16703 states and 21459 transitions. [2022-07-12 06:38:49,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2022-07-12 06:38:49,868 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:38:49,869 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-12 06:38:49,886 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-12 06:38:50,086 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-12 06:38:50,086 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:38:50,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:38:50,087 INFO L85 PathProgramCache]: Analyzing trace with hash 2029022934, now seen corresponding path program 1 times [2022-07-12 06:38:50,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:38:50,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432616892] [2022-07-12 06:38:50,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:38:50,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:38:50,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:50,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:38:50,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:50,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 06:38:50,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:50,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 06:38:50,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:50,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 06:38:50,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:50,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 06:38:50,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:50,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 06:38:50,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:50,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 06:38:50,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:50,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-12 06:38:50,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:50,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-12 06:38:50,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:50,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 06:38:50,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:50,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-12 06:38:50,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:50,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-12 06:38:50,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:50,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-12 06:38:50,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:50,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-12 06:38:50,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:50,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-12 06:38:50,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:50,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-12 06:38:50,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:50,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-07-12 06:38:50,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:50,341 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-12 06:38:50,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:38:50,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432616892] [2022-07-12 06:38:50,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432616892] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:38:50,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074426706] [2022-07-12 06:38:50,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:38:50,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:38:50,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:38:50,343 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-12 06:38:50,344 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-12 06:38:50,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:50,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 859 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-12 06:38:50,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:38:51,177 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-12 06:38:51,177 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 06:38:51,820 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-12 06:38:51,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1074426706] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 06:38:51,821 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 06:38:51,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 10] total 22 [2022-07-12 06:38:51,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904891314] [2022-07-12 06:38:51,821 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 06:38:51,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-12 06:38:51,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:38:51,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-12 06:38:51,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2022-07-12 06:38:51,822 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-12 06:38:58,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:38:58,638 INFO L93 Difference]: Finished difference Result 39985 states and 53432 transitions. [2022-07-12 06:38:58,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-07-12 06:38:58,639 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-12 06:38:58,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:38:58,717 INFO L225 Difference]: With dead ends: 39985 [2022-07-12 06:38:58,717 INFO L226 Difference]: Without dead ends: 26697 [2022-07-12 06:38:58,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 504 GetRequests, 452 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 603 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=643, Invalid=1907, Unknown=0, NotChecked=0, Total=2550 [2022-07-12 06:38:58,743 INFO L413 NwaCegarLoop]: 452 mSDtfsCounter, 3590 mSDsluCounter, 2589 mSDsCounter, 0 mSdLazyCounter, 2703 mSolverCounterSat, 785 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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.6s IncrementalHoareTripleChecker+Time [2022-07-12 06:38:58,743 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.6s Time] [2022-07-12 06:38:58,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26697 states. [2022-07-12 06:39:00,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26697 to 14070. [2022-07-12 06:39:00,900 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-12 06:39:00,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14070 states to 14070 states and 18044 transitions. [2022-07-12 06:39:00,932 INFO L78 Accepts]: Start accepts. Automaton has 14070 states and 18044 transitions. Word has length 215 [2022-07-12 06:39:00,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:39:00,933 INFO L495 AbstractCegarLoop]: Abstraction has 14070 states and 18044 transitions. [2022-07-12 06:39:00,933 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-12 06:39:00,933 INFO L276 IsEmpty]: Start isEmpty. Operand 14070 states and 18044 transitions. [2022-07-12 06:39:00,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2022-07-12 06:39:00,940 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:39:00,940 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-12 06:39:00,959 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-12 06:39:01,158 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-12 06:39:01,159 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:39:01,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:39:01,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1439794329, now seen corresponding path program 1 times [2022-07-12 06:39:01,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:39:01,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250036592] [2022-07-12 06:39:01,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:39:01,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:39:01,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:01,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:39:01,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:01,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 06:39:01,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:01,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 06:39:01,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:01,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 06:39:01,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:01,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 06:39:01,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:01,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 06:39:01,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:01,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 06:39:01,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:01,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-12 06:39:01,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:01,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-12 06:39:01,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:01,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 06:39:01,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:01,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-12 06:39:01,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:01,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-12 06:39:01,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:01,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-12 06:39:01,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:01,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-12 06:39:01,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:01,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-12 06:39:01,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:01,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-12 06:39:01,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:01,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-07-12 06:39:01,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:01,288 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-12 06:39:01,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:39:01,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250036592] [2022-07-12 06:39:01,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250036592] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:39:01,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028607883] [2022-07-12 06:39:01,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:39:01,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:39:01,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:39:01,312 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-12 06:39:01,314 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-12 06:39:01,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:01,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 861 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-12 06:39:01,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:39:01,613 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-12 06:39:01,614 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 06:39:01,923 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-12 06:39:01,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2028607883] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 06:39:01,924 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 06:39:01,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 8] total 14 [2022-07-12 06:39:01,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700759113] [2022-07-12 06:39:01,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 06:39:01,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 06:39:01,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:39:01,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 06:39:01,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-07-12 06:39:01,926 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-12 06:39:09,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:39:09,213 INFO L93 Difference]: Finished difference Result 43858 states and 59285 transitions. [2022-07-12 06:39:09,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-07-12 06:39:09,214 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-12 06:39:09,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:39:09,285 INFO L225 Difference]: With dead ends: 43858 [2022-07-12 06:39:09,285 INFO L226 Difference]: Without dead ends: 31438 [2022-07-12 06:39:09,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 549 GetRequests, 473 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2124 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=952, Invalid=5054, Unknown=0, NotChecked=0, Total=6006 [2022-07-12 06:39:09,305 INFO L413 NwaCegarLoop]: 982 mSDtfsCounter, 2474 mSDsluCounter, 6173 mSDsCounter, 0 mSdLazyCounter, 1554 mSolverCounterSat, 806 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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.0s IncrementalHoareTripleChecker+Time [2022-07-12 06:39:09,305 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.0s Time] [2022-07-12 06:39:09,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31438 states. [2022-07-12 06:39:12,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31438 to 17971. [2022-07-12 06:39:12,097 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-12 06:39:12,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17971 states to 17971 states and 22851 transitions. [2022-07-12 06:39:12,135 INFO L78 Accepts]: Start accepts. Automaton has 17971 states and 22851 transitions. Word has length 216 [2022-07-12 06:39:12,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:39:12,136 INFO L495 AbstractCegarLoop]: Abstraction has 17971 states and 22851 transitions. [2022-07-12 06:39:12,136 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-12 06:39:12,136 INFO L276 IsEmpty]: Start isEmpty. Operand 17971 states and 22851 transitions. [2022-07-12 06:39:12,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2022-07-12 06:39:12,144 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:39:12,144 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-12 06:39:12,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-07-12 06:39:12,362 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-12 06:39:12,362 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:39:12,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:39:12,363 INFO L85 PathProgramCache]: Analyzing trace with hash 71333719, now seen corresponding path program 1 times [2022-07-12 06:39:12,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:39:12,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987455577] [2022-07-12 06:39:12,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:39:12,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:39:12,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:12,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:39:12,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:12,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 06:39:12,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:12,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 06:39:12,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:12,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 06:39:12,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:12,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 06:39:12,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:12,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 06:39:12,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:12,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 06:39:12,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:12,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-12 06:39:12,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:12,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-12 06:39:12,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:12,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 06:39:12,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:12,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-12 06:39:12,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:12,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-12 06:39:12,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:12,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-12 06:39:12,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:12,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-12 06:39:12,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:12,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-12 06:39:12,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:12,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-12 06:39:12,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:12,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-07-12 06:39:12,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:12,417 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-12 06:39:12,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:39:12,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987455577] [2022-07-12 06:39:12,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987455577] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:39:12,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:39:12,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 06:39:12,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286470900] [2022-07-12 06:39:12,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:39:12,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 06:39:12,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:39:12,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 06:39:12,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 06:39:12,419 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-12 06:39:14,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:39:14,511 INFO L93 Difference]: Finished difference Result 30612 states and 39107 transitions. [2022-07-12 06:39:14,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 06:39:14,511 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-12 06:39:14,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:39:14,537 INFO L225 Difference]: With dead ends: 30612 [2022-07-12 06:39:14,537 INFO L226 Difference]: Without dead ends: 13650 [2022-07-12 06:39:14,551 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-12 06:39:14,551 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-12 06:39:14,552 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-12 06:39:14,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13650 states. [2022-07-12 06:39:16,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13650 to 13607. [2022-07-12 06:39:16,457 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-12 06:39:16,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13607 states to 13607 states and 17317 transitions. [2022-07-12 06:39:16,484 INFO L78 Accepts]: Start accepts. Automaton has 13607 states and 17317 transitions. Word has length 216 [2022-07-12 06:39:16,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:39:16,484 INFO L495 AbstractCegarLoop]: Abstraction has 13607 states and 17317 transitions. [2022-07-12 06:39:16,484 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-12 06:39:16,484 INFO L276 IsEmpty]: Start isEmpty. Operand 13607 states and 17317 transitions. [2022-07-12 06:39:16,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2022-07-12 06:39:16,489 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:39:16,489 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-12 06:39:16,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-07-12 06:39:16,490 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:39:16,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:39:16,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1981403120, now seen corresponding path program 1 times [2022-07-12 06:39:16,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:39:16,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061440839] [2022-07-12 06:39:16,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:39:16,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:39:16,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:16,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:39:16,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:16,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 06:39:16,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:16,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 06:39:16,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:16,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 06:39:16,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:16,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 06:39:16,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:16,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 06:39:16,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:16,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 06:39:16,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:16,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-12 06:39:16,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:16,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-12 06:39:16,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:16,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-12 06:39:16,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:16,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-12 06:39:16,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:16,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-12 06:39:16,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:16,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-07-12 06:39:16,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:16,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-12 06:39:16,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:16,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-12 06:39:16,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:16,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-12 06:39:16,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:16,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-07-12 06:39:16,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:16,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-07-12 06:39:16,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:16,560 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-12 06:39:16,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:39:16,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061440839] [2022-07-12 06:39:16,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061440839] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:39:16,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:39:16,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 06:39:16,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625587601] [2022-07-12 06:39:16,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:39:16,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 06:39:16,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:39:16,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 06:39:16,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 06:39:16,563 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-12 06:39:20,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:39:20,953 INFO L93 Difference]: Finished difference Result 35344 states and 45987 transitions. [2022-07-12 06:39:20,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 06:39:20,953 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-12 06:39:20,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:39:21,012 INFO L225 Difference]: With dead ends: 35344 [2022-07-12 06:39:21,012 INFO L226 Difference]: Without dead ends: 25650 [2022-07-12 06:39:21,029 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-12 06:39:21,030 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.1s IncrementalHoareTripleChecker+Time [2022-07-12 06:39:21,030 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.1s Time] [2022-07-12 06:39:21,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25650 states. [2022-07-12 06:39:23,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25650 to 16802. [2022-07-12 06:39:23,778 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-12 06:39:23,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16802 states to 16802 states and 21292 transitions. [2022-07-12 06:39:23,806 INFO L78 Accepts]: Start accepts. Automaton has 16802 states and 21292 transitions. Word has length 217 [2022-07-12 06:39:23,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:39:23,807 INFO L495 AbstractCegarLoop]: Abstraction has 16802 states and 21292 transitions. [2022-07-12 06:39:23,807 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-12 06:39:23,807 INFO L276 IsEmpty]: Start isEmpty. Operand 16802 states and 21292 transitions. [2022-07-12 06:39:23,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2022-07-12 06:39:23,813 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:39:23,813 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-12 06:39:23,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-07-12 06:39:23,814 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:39:23,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:39:23,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1125932149, now seen corresponding path program 1 times [2022-07-12 06:39:23,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:39:23,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542095256] [2022-07-12 06:39:23,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:39:23,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:39:23,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:23,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:39:23,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:23,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 06:39:23,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:23,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 06:39:23,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:23,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 06:39:23,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:23,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 06:39:23,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:23,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 06:39:23,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:23,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 06:39:23,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:23,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-12 06:39:23,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:23,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-12 06:39:23,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:23,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-12 06:39:23,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:23,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-12 06:39:23,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:23,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-12 06:39:23,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:23,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-12 06:39:23,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:23,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-12 06:39:23,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:23,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-12 06:39:23,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:23,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-07-12 06:39:23,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:23,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-07-12 06:39:23,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:23,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2022-07-12 06:39:23,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:23,965 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-12 06:39:23,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:39:23,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542095256] [2022-07-12 06:39:23,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542095256] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:39:23,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939017422] [2022-07-12 06:39:23,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:39:23,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:39:23,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:39:23,967 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-12 06:39:23,995 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-12 06:39:24,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:24,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 873 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-12 06:39:24,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:39:24,228 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-12 06:39:24,228 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 06:39:24,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1939017422] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:39:24,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 06:39:24,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2022-07-12 06:39:24,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522857860] [2022-07-12 06:39:24,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:39:24,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 06:39:24,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:39:24,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 06:39:24,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2022-07-12 06:39:24,230 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-12 06:39:27,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:39:27,822 INFO L93 Difference]: Finished difference Result 36219 states and 47080 transitions. [2022-07-12 06:39:27,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 06:39:27,822 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-12 06:39:27,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:39:27,876 INFO L225 Difference]: With dead ends: 36219 [2022-07-12 06:39:27,876 INFO L226 Difference]: Without dead ends: 20739 [2022-07-12 06:39:27,897 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-12 06:39:27,897 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.2s IncrementalHoareTripleChecker+Time [2022-07-12 06:39:27,897 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.2s Time] [2022-07-12 06:39:27,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20739 states. [2022-07-12 06:39:30,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20739 to 16802. [2022-07-12 06:39:30,576 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-12 06:39:30,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16802 states to 16802 states and 21206 transitions. [2022-07-12 06:39:30,610 INFO L78 Accepts]: Start accepts. Automaton has 16802 states and 21206 transitions. Word has length 218 [2022-07-12 06:39:30,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:39:30,610 INFO L495 AbstractCegarLoop]: Abstraction has 16802 states and 21206 transitions. [2022-07-12 06:39:30,610 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-12 06:39:30,611 INFO L276 IsEmpty]: Start isEmpty. Operand 16802 states and 21206 transitions. [2022-07-12 06:39:30,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2022-07-12 06:39:30,617 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:39:30,617 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-12 06:39:30,646 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-12 06:39:30,835 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-12 06:39:30,835 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:39:30,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:39:30,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1772199745, now seen corresponding path program 1 times [2022-07-12 06:39:30,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:39:30,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208811907] [2022-07-12 06:39:30,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:39:30,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:39:30,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:30,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:39:30,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:30,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 06:39:30,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:30,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 06:39:30,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:30,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 06:39:30,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:30,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 06:39:30,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:30,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 06:39:30,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:30,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 06:39:30,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:30,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-12 06:39:30,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:30,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-12 06:39:30,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:30,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 06:39:30,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:30,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-12 06:39:30,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:30,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-12 06:39:30,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:30,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-12 06:39:30,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:30,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-12 06:39:30,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:30,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-12 06:39:30,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:30,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-12 06:39:30,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:30,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-07-12 06:39:30,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:30,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-07-12 06:39:30,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:30,972 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-12 06:39:30,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:39:30,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208811907] [2022-07-12 06:39:30,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208811907] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:39:30,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214592407] [2022-07-12 06:39:30,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:39:30,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:39:30,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:39:30,974 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-12 06:39:30,979 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-12 06:39:31,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:31,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 880 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-12 06:39:31,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:39:31,330 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-12 06:39:31,330 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 06:39:31,524 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-12 06:39:31,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214592407] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 06:39:31,525 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 06:39:31,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 12 [2022-07-12 06:39:31,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327885536] [2022-07-12 06:39:31,525 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 06:39:31,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 06:39:31,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:39:31,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 06:39:31,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-07-12 06:39:31,526 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-12 06:39:35,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:39:35,479 INFO L93 Difference]: Finished difference Result 32039 states and 40782 transitions. [2022-07-12 06:39:35,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-12 06:39:35,479 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-12 06:39:35,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:39:35,516 INFO L225 Difference]: With dead ends: 32039 [2022-07-12 06:39:35,516 INFO L226 Difference]: Without dead ends: 19596 [2022-07-12 06:39:35,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 481 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2022-07-12 06:39:35,533 INFO L413 NwaCegarLoop]: 846 mSDtfsCounter, 1267 mSDsluCounter, 3101 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 337 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2022-07-12 06:39:35,533 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.5s Time] [2022-07-12 06:39:35,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19596 states. [2022-07-12 06:39:38,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19596 to 16802. [2022-07-12 06:39:38,260 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-12 06:39:38,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16802 states to 16802 states and 21155 transitions. [2022-07-12 06:39:38,298 INFO L78 Accepts]: Start accepts. Automaton has 16802 states and 21155 transitions. Word has length 224 [2022-07-12 06:39:38,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:39:38,298 INFO L495 AbstractCegarLoop]: Abstraction has 16802 states and 21155 transitions. [2022-07-12 06:39:38,299 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-12 06:39:38,299 INFO L276 IsEmpty]: Start isEmpty. Operand 16802 states and 21155 transitions. [2022-07-12 06:39:38,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2022-07-12 06:39:38,305 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:39:38,306 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-12 06:39:38,323 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-12 06:39:38,516 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-12 06:39:38,516 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:39:38,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:39:38,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1176450, now seen corresponding path program 1 times [2022-07-12 06:39:38,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:39:38,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000558304] [2022-07-12 06:39:38,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:39:38,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:39:38,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:38,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:39:38,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:38,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 06:39:38,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:38,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 06:39:38,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:38,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 06:39:38,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:38,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 06:39:38,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:38,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 06:39:38,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:38,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 06:39:38,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:38,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-12 06:39:38,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:38,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-12 06:39:38,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:38,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 06:39:38,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:38,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-12 06:39:38,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:38,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-12 06:39:38,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:38,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-12 06:39:38,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:38,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-12 06:39:38,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:38,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-12 06:39:38,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:38,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-12 06:39:38,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:38,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-07-12 06:39:38,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:38,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2022-07-12 06:39:38,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:38,670 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-12 06:39:38,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:39:38,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000558304] [2022-07-12 06:39:38,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000558304] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:39:38,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:39:38,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 06:39:38,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642943780] [2022-07-12 06:39:38,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:39:38,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 06:39:38,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:39:38,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 06:39:38,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 06:39:38,672 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-12 06:39:42,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:39:42,751 INFO L93 Difference]: Finished difference Result 32701 states and 42222 transitions. [2022-07-12 06:39:42,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 06:39:42,752 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-12 06:39:42,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:39:42,798 INFO L225 Difference]: With dead ends: 32701 [2022-07-12 06:39:42,798 INFO L226 Difference]: Without dead ends: 20749 [2022-07-12 06:39:42,813 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-12 06:39:42,814 INFO L413 NwaCegarLoop]: 616 mSDtfsCounter, 702 mSDsluCounter, 1996 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.3s IncrementalHoareTripleChecker+Time [2022-07-12 06:39:42,814 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.3s Time] [2022-07-12 06:39:42,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20749 states. [2022-07-12 06:39:45,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20749 to 16793. [2022-07-12 06:39:45,554 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-12 06:39:45,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16793 states to 16793 states and 21128 transitions. [2022-07-12 06:39:45,586 INFO L78 Accepts]: Start accepts. Automaton has 16793 states and 21128 transitions. Word has length 224 [2022-07-12 06:39:45,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:39:45,587 INFO L495 AbstractCegarLoop]: Abstraction has 16793 states and 21128 transitions. [2022-07-12 06:39:45,587 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-12 06:39:45,587 INFO L276 IsEmpty]: Start isEmpty. Operand 16793 states and 21128 transitions. [2022-07-12 06:39:45,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2022-07-12 06:39:45,593 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:39:45,594 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-12 06:39:45,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-07-12 06:39:45,594 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:39:45,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:39:45,594 INFO L85 PathProgramCache]: Analyzing trace with hash 442167154, now seen corresponding path program 1 times [2022-07-12 06:39:45,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:39:45,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398096043] [2022-07-12 06:39:45,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:39:45,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:39:45,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 06:39:45,622 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 06:39:45,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 06:39:45,739 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-12 06:39:45,739 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 06:39:45,740 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 06:39:45,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-07-12 06:39:45,744 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-12 06:39:45,747 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 06:39:45,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 06:39:45 BoogieIcfgContainer [2022-07-12 06:39:45,902 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 06:39:45,903 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 06:39:45,903 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 06:39:45,903 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 06:39:45,903 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:37:36" (3/4) ... [2022-07-12 06:39:45,904 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-12 06:39:46,053 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 06:39:46,053 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 06:39:46,054 INFO L158 Benchmark]: Toolchain (without parser) took 130909.03ms. Allocated memory was 115.3MB in the beginning and 4.0GB in the end (delta: 3.8GB). Free memory was 88.2MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. [2022-07-12 06:39:46,054 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 115.3MB. Free memory is still 76.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 06:39:46,054 INFO L158 Benchmark]: CACSL2BoogieTranslator took 311.47ms. Allocated memory is still 115.3MB. Free memory was 88.0MB in the beginning and 82.6MB in the end (delta: 5.4MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. [2022-07-12 06:39:46,054 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.68ms. Allocated memory is still 115.3MB. Free memory was 82.6MB in the beginning and 79.1MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-12 06:39:46,054 INFO L158 Benchmark]: Boogie Preprocessor took 38.30ms. Allocated memory is still 115.3MB. Free memory was 79.1MB in the beginning and 76.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 06:39:46,054 INFO L158 Benchmark]: RCFGBuilder took 561.44ms. Allocated memory was 115.3MB in the beginning and 167.8MB in the end (delta: 52.4MB). Free memory was 76.6MB in the beginning and 133.6MB in the end (delta: -57.0MB). Peak memory consumption was 29.6MB. Max. memory is 16.1GB. [2022-07-12 06:39:46,054 INFO L158 Benchmark]: TraceAbstraction took 129780.15ms. Allocated memory was 167.8MB in the beginning and 4.0GB in the end (delta: 3.8GB). Free memory was 132.6MB in the beginning and 2.2GB in the end (delta: -2.0GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. [2022-07-12 06:39:46,055 INFO L158 Benchmark]: Witness Printer took 150.49ms. Allocated memory is still 4.0GB. Free memory was 2.2GB in the beginning and 2.1GB in the end (delta: 36.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2022-07-12 06:39:46,061 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.15ms. Allocated memory is still 115.3MB. Free memory is still 76.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 311.47ms. Allocated memory is still 115.3MB. Free memory was 88.0MB in the beginning and 82.6MB in the end (delta: 5.4MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.68ms. Allocated memory is still 115.3MB. Free memory was 82.6MB in the beginning and 79.1MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.30ms. Allocated memory is still 115.3MB. Free memory was 79.1MB in the beginning and 76.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 561.44ms. Allocated memory was 115.3MB in the beginning and 167.8MB in the end (delta: 52.4MB). Free memory was 76.6MB in the beginning and 133.6MB in the end (delta: -57.0MB). Peak memory consumption was 29.6MB. Max. memory is 16.1GB. * TraceAbstraction took 129780.15ms. Allocated memory was 167.8MB in the beginning and 4.0GB in the end (delta: 3.8GB). Free memory was 132.6MB in the beginning and 2.2GB in the end (delta: -2.0GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. * Witness Printer took 150.49ms. Allocated memory is still 4.0GB. Free memory was 2.2GB in the beginning and 2.1GB in the end (delta: 36.7MB). 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: 129.6s, OverallIterations: 45, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 81.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 44035 SdHoareTripleChecker+Valid, 19.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 43635 mSDsluCounter, 99513 SdHoareTripleChecker+Invalid, 15.8s 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.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6160 GetRequests, 5296 SyntacticMatches, 18 SemanticMatches, 846 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31848 ImplicationChecksByTransitivity, 9.2s 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: 34.5s AutomataMinimizationTime, 44 MinimizatonAttempts, 109720 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 7.8s 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-12 06:39:46,116 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