./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.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.UNBOUNDED.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.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 01a21536345230b7194ff5017879c469eb8be909ba72352bb81feb2f101a934f --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 06:37:38,464 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 06:37:38,466 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 06:37:38,513 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 06:37:38,513 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 06:37:38,514 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 06:37:38,516 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 06:37:38,520 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 06:37:38,521 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 06:37:38,522 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 06:37:38,523 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 06:37:38,524 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 06:37:38,525 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 06:37:38,529 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 06:37:38,531 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 06:37:38,532 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 06:37:38,535 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 06:37:38,536 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 06:37:38,537 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 06:37:38,538 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 06:37:38,539 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 06:37:38,540 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 06:37:38,541 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 06:37:38,542 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 06:37:38,542 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 06:37:38,544 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 06:37:38,544 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 06:37:38,544 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 06:37:38,545 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 06:37:38,545 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 06:37:38,545 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 06:37:38,546 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 06:37:38,546 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 06:37:38,547 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 06:37:38,547 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 06:37:38,548 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 06:37:38,548 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 06:37:38,548 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 06:37:38,549 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 06:37:38,549 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 06:37:38,549 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 06:37:38,550 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 06:37:38,550 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:38,566 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 06:37:38,569 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 06:37:38,570 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 06:37:38,570 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 06:37:38,570 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 06:37:38,570 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 06:37:38,571 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 06:37:38,571 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 06:37:38,571 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 06:37:38,572 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 06:37:38,572 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 06:37:38,572 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 06:37:38,572 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 06:37:38,572 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 06:37:38,573 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 06:37:38,573 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 06:37:38,573 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 06:37:38,573 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 06:37:38,573 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 06:37:38,573 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 06:37:38,573 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 06:37:38,574 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 06:37:38,574 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 06:37:38,574 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 06:37:38,574 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 06:37:38,574 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 06:37:38,574 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 06:37:38,575 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 06:37:38,575 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 06:37:38,575 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 06:37:38,575 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 06:37:38,575 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 06:37:38,576 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 06:37:38,576 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 -> 01a21536345230b7194ff5017879c469eb8be909ba72352bb81feb2f101a934f [2022-07-12 06:37:38,748 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 06:37:38,774 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 06:37:38,775 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 06:37:38,776 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 06:37:38,776 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 06:37:38,777 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.UNBOUNDED.pals.c [2022-07-12 06:37:38,821 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7212395e9/a4dbb0c71bb1463896cab58f08ca5175/FLAGdad5914b8 [2022-07-12 06:37:39,185 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 06:37:39,186 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c [2022-07-12 06:37:39,200 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7212395e9/a4dbb0c71bb1463896cab58f08ca5175/FLAGdad5914b8 [2022-07-12 06:37:39,210 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7212395e9/a4dbb0c71bb1463896cab58f08ca5175 [2022-07-12 06:37:39,212 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 06:37:39,213 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 06:37:39,214 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 06:37:39,214 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 06:37:39,226 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 06:37:39,226 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:37:39" (1/1) ... [2022-07-12 06:37:39,227 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64f9718d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:37:39, skipping insertion in model container [2022-07-12 06:37:39,227 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:37:39" (1/1) ... [2022-07-12 06:37:39,231 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 06:37:39,261 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 06:37:39,495 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.UNBOUNDED.pals.c[14684,14697] [2022-07-12 06:37:39,497 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 06:37:39,503 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 06:37:39,543 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.UNBOUNDED.pals.c[14684,14697] [2022-07-12 06:37:39,544 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 06:37:39,561 INFO L208 MainTranslator]: Completed translation [2022-07-12 06:37:39,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:37:39 WrapperNode [2022-07-12 06:37:39,562 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 06:37:39,563 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 06:37:39,563 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 06:37:39,563 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 06:37:39,570 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:39" (1/1) ... [2022-07-12 06:37:39,580 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:39" (1/1) ... [2022-07-12 06:37:39,608 INFO L137 Inliner]: procedures = 32, calls = 48, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 535 [2022-07-12 06:37:39,610 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 06:37:39,611 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 06:37:39,617 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 06:37:39,617 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 06:37:39,623 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:39" (1/1) ... [2022-07-12 06:37:39,623 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:39" (1/1) ... [2022-07-12 06:37:39,627 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:39" (1/1) ... [2022-07-12 06:37:39,627 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:39" (1/1) ... [2022-07-12 06:37:39,634 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:39" (1/1) ... [2022-07-12 06:37:39,639 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:39" (1/1) ... [2022-07-12 06:37:39,642 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:39" (1/1) ... [2022-07-12 06:37:39,645 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 06:37:39,645 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 06:37:39,646 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 06:37:39,646 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 06:37:39,647 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:37:39" (1/1) ... [2022-07-12 06:37:39,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 06:37:39,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:37:39,706 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:39,712 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:39,740 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2022-07-12 06:37:39,741 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2022-07-12 06:37:39,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 06:37:39,741 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2022-07-12 06:37:39,741 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2022-07-12 06:37:39,741 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2022-07-12 06:37:39,741 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2022-07-12 06:37:39,741 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2022-07-12 06:37:39,742 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2022-07-12 06:37:39,742 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-12 06:37:39,742 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-12 06:37:39,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 06:37:39,742 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2022-07-12 06:37:39,742 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2022-07-12 06:37:39,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 06:37:39,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 06:37:39,743 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2022-07-12 06:37:39,743 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2022-07-12 06:37:39,817 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 06:37:39,818 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 06:37:40,276 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 06:37:40,282 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 06:37:40,282 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-12 06:37:40,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:37:40 BoogieIcfgContainer [2022-07-12 06:37:40,284 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 06:37:40,285 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 06:37:40,285 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 06:37:40,287 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 06:37:40,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 06:37:39" (1/3) ... [2022-07-12 06:37:40,288 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@434d4037 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:37:40, skipping insertion in model container [2022-07-12 06:37:40,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:37:39" (2/3) ... [2022-07-12 06:37:40,288 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@434d4037 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:37:40, skipping insertion in model container [2022-07-12 06:37:40,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:37:40" (3/3) ... [2022-07-12 06:37:40,289 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_2.ufo.UNBOUNDED.pals.c [2022-07-12 06:37:40,299 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 06:37:40,299 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 06:37:40,350 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 06:37:40,358 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@7853df13, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@52633b10 [2022-07-12 06:37:40,358 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 06:37:40,370 INFO L276 IsEmpty]: Start isEmpty. Operand has 206 states, 166 states have (on average 1.5542168674698795) internal successors, (258), 168 states have internal predecessors, (258), 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:40,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-12 06:37:40,382 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:37:40,382 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:40,383 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:37:40,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:37:40,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1527920627, now seen corresponding path program 1 times [2022-07-12 06:37:40,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:37:40,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790358263] [2022-07-12 06:37:40,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:37:40,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:37:40,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:40,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 06:37:40,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:40,549 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:40,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:37:40,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790358263] [2022-07-12 06:37:40,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790358263] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:37:40,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:37:40,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 06:37:40,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006049977] [2022-07-12 06:37:40,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:37:40,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 06:37:40,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:37:40,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 06:37:40,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 06:37:40,585 INFO L87 Difference]: Start difference. First operand has 206 states, 166 states have (on average 1.5542168674698795) internal successors, (258), 168 states have internal predecessors, (258), 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:40,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:37:40,641 INFO L93 Difference]: Finished difference Result 392 states and 637 transitions. [2022-07-12 06:37:40,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 06:37:40,642 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:40,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:37:40,651 INFO L225 Difference]: With dead ends: 392 [2022-07-12 06:37:40,651 INFO L226 Difference]: Without dead ends: 202 [2022-07-12 06:37:40,654 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:40,657 INFO L413 NwaCegarLoop]: 307 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, 307 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:40,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 307 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:40,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-07-12 06:37:40,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2022-07-12 06:37:40,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 163 states have (on average 1.5030674846625767) internal successors, (245), 164 states have internal predecessors, (245), 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:40,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 307 transitions. [2022-07-12 06:37:40,703 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 307 transitions. Word has length 44 [2022-07-12 06:37:40,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:37:40,703 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 307 transitions. [2022-07-12 06:37:40,703 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:40,704 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 307 transitions. [2022-07-12 06:37:40,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-12 06:37:40,705 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:37:40,705 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:40,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 06:37:40,706 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:37:40,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:37:40,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1536686131, now seen corresponding path program 1 times [2022-07-12 06:37:40,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:37:40,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948966732] [2022-07-12 06:37:40,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:37:40,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:37:40,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:40,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 06:37:40,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:40,827 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:40,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:37:40,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948966732] [2022-07-12 06:37:40,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948966732] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:37:40,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:37:40,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 06:37:40,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271226149] [2022-07-12 06:37:40,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:37:40,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 06:37:40,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:37:40,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 06:37:40,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 06:37:40,831 INFO L87 Difference]: Start difference. First operand 202 states and 307 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:40,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:37:40,911 INFO L93 Difference]: Finished difference Result 390 states and 588 transitions. [2022-07-12 06:37:40,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 06:37:40,912 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:40,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:37:40,915 INFO L225 Difference]: With dead ends: 390 [2022-07-12 06:37:40,917 INFO L226 Difference]: Without dead ends: 202 [2022-07-12 06:37:40,918 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:40,920 INFO L413 NwaCegarLoop]: 303 mSDtfsCounter, 171 mSDsluCounter, 993 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 1296 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 06:37:40,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 1296 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 06:37:40,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-07-12 06:37:40,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2022-07-12 06:37:40,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 163 states have (on average 1.4294478527607362) internal successors, (233), 164 states have internal predecessors, (233), 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:40,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 295 transitions. [2022-07-12 06:37:40,938 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 295 transitions. Word has length 44 [2022-07-12 06:37:40,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:37:40,939 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 295 transitions. [2022-07-12 06:37:40,939 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:40,939 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 295 transitions. [2022-07-12 06:37:40,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-12 06:37:40,941 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:37:40,941 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:40,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 06:37:40,941 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:37:40,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:37:40,942 INFO L85 PathProgramCache]: Analyzing trace with hash 2082780786, now seen corresponding path program 1 times [2022-07-12 06:37:40,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:37:40,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198184102] [2022-07-12 06:37:40,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:37:40,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:37:41,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:41,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:37:41,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:41,091 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:41,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:37:41,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198184102] [2022-07-12 06:37:41,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198184102] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:37:41,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:37:41,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 06:37:41,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343877464] [2022-07-12 06:37:41,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:37:41,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 06:37:41,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:37:41,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 06:37:41,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 06:37:41,094 INFO L87 Difference]: Start difference. First operand 202 states and 295 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:41,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:37:41,129 INFO L93 Difference]: Finished difference Result 391 states and 580 transitions. [2022-07-12 06:37:41,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 06:37:41,130 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:41,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:37:41,132 INFO L225 Difference]: With dead ends: 391 [2022-07-12 06:37:41,132 INFO L226 Difference]: Without dead ends: 206 [2022-07-12 06:37:41,133 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:41,134 INFO L413 NwaCegarLoop]: 289 mSDtfsCounter, 5 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 857 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:41,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 857 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:41,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-07-12 06:37:41,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2022-07-12 06:37:41,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 166 states have (on average 1.4216867469879517) internal successors, (236), 167 states have internal predecessors, (236), 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:41,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 298 transitions. [2022-07-12 06:37:41,148 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 298 transitions. Word has length 55 [2022-07-12 06:37:41,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:37:41,148 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 298 transitions. [2022-07-12 06:37:41,148 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:41,149 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 298 transitions. [2022-07-12 06:37:41,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-12 06:37:41,149 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:37:41,150 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:41,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 06:37:41,150 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:37:41,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:37:41,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1990587108, now seen corresponding path program 1 times [2022-07-12 06:37:41,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:37:41,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236726016] [2022-07-12 06:37:41,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:37:41,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:37:41,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:41,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:37:41,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:41,205 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 57 [2022-07-12 06:37:41,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:41,211 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:41,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:37:41,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236726016] [2022-07-12 06:37:41,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236726016] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:37:41,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:37:41,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 06:37:41,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752705610] [2022-07-12 06:37:41,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:37:41,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 06:37:41,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:37:41,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 06:37:41,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 06:37:41,214 INFO L87 Difference]: Start difference. First operand 206 states and 298 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:41,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:37:41,249 INFO L93 Difference]: Finished difference Result 561 states and 823 transitions. [2022-07-12 06:37:41,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 06:37:41,250 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:41,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:37:41,253 INFO L225 Difference]: With dead ends: 561 [2022-07-12 06:37:41,253 INFO L226 Difference]: Without dead ends: 372 [2022-07-12 06:37:41,254 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:41,268 INFO L413 NwaCegarLoop]: 340 mSDtfsCounter, 226 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 620 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:41,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 620 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:41,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2022-07-12 06:37:41,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 363. [2022-07-12 06:37:41,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 286 states have (on average 1.4405594405594406) internal successors, (412), 288 states have internal predecessors, (412), 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:41,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 532 transitions. [2022-07-12 06:37:41,290 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 532 transitions. Word has length 71 [2022-07-12 06:37:41,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:37:41,291 INFO L495 AbstractCegarLoop]: Abstraction has 363 states and 532 transitions. [2022-07-12 06:37:41,291 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:41,291 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 532 transitions. [2022-07-12 06:37:41,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-12 06:37:41,293 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:37:41,293 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:41,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 06:37:41,293 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:37:41,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:37:41,293 INFO L85 PathProgramCache]: Analyzing trace with hash 687571372, now seen corresponding path program 1 times [2022-07-12 06:37:41,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:37:41,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633333580] [2022-07-12 06:37:41,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:37:41,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:37:41,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:41,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:37:41,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:41,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 06:37:41,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:41,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 06:37:41,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:41,405 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:41,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:37:41,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633333580] [2022-07-12 06:37:41,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633333580] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:37:41,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:37:41,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 06:37:41,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784119038] [2022-07-12 06:37:41,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:37:41,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 06:37:41,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:37:41,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 06:37:41,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 06:37:41,411 INFO L87 Difference]: Start difference. First operand 363 states and 532 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:41,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:37:41,448 INFO L93 Difference]: Finished difference Result 1006 states and 1489 transitions. [2022-07-12 06:37:41,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 06:37:41,452 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:41,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:37:41,456 INFO L225 Difference]: With dead ends: 1006 [2022-07-12 06:37:41,458 INFO L226 Difference]: Without dead ends: 660 [2022-07-12 06:37:41,459 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:41,461 INFO L413 NwaCegarLoop]: 373 mSDtfsCounter, 234 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 655 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:41,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 655 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:41,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2022-07-12 06:37:41,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 643. [2022-07-12 06:37:41,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 494 states have (on average 1.459514170040486) internal successors, (721), 498 states have internal predecessors, (721), 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:41,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 955 transitions. [2022-07-12 06:37:41,512 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 955 transitions. Word has length 72 [2022-07-12 06:37:41,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:37:41,513 INFO L495 AbstractCegarLoop]: Abstraction has 643 states and 955 transitions. [2022-07-12 06:37:41,514 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:41,514 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 955 transitions. [2022-07-12 06:37:41,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-12 06:37:41,517 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:37:41,518 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:41,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 06:37:41,518 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:37:41,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:37:41,519 INFO L85 PathProgramCache]: Analyzing trace with hash -592292306, now seen corresponding path program 1 times [2022-07-12 06:37:41,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:37:41,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182287572] [2022-07-12 06:37:41,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:37:41,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:37:41,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:41,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:37:41,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:41,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 06:37:41,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:41,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 06:37:41,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:41,637 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:41,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:37:41,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182287572] [2022-07-12 06:37:41,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182287572] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:37:41,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:37:41,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 06:37:41,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849214342] [2022-07-12 06:37:41,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:37:41,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 06:37:41,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:37:41,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 06:37:41,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 06:37:41,640 INFO L87 Difference]: Start difference. First operand 643 states and 955 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:41,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:37:41,894 INFO L93 Difference]: Finished difference Result 1799 states and 2717 transitions. [2022-07-12 06:37:41,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 06:37:41,895 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:41,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:37:41,899 INFO L225 Difference]: With dead ends: 1799 [2022-07-12 06:37:41,900 INFO L226 Difference]: Without dead ends: 1173 [2022-07-12 06:37:41,901 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:41,902 INFO L413 NwaCegarLoop]: 288 mSDtfsCounter, 783 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 783 SdHoareTripleChecker+Valid, 775 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:41,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [783 Valid, 775 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:41,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2022-07-12 06:37:41,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 768. [2022-07-12 06:37:41,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 768 states, 606 states have (on average 1.4372937293729373) internal successors, (871), 609 states have internal predecessors, (871), 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:41,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 1119 transitions. [2022-07-12 06:37:41,943 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 1119 transitions. Word has length 72 [2022-07-12 06:37:41,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:37:41,943 INFO L495 AbstractCegarLoop]: Abstraction has 768 states and 1119 transitions. [2022-07-12 06:37:41,943 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:41,943 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 1119 transitions. [2022-07-12 06:37:41,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-07-12 06:37:41,956 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:37:41,956 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:41,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 06:37:41,957 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:37:41,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:37:41,957 INFO L85 PathProgramCache]: Analyzing trace with hash 9157699, now seen corresponding path program 1 times [2022-07-12 06:37:41,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:37:41,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136066345] [2022-07-12 06:37:41,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:37:41,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:37:41,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:41,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:37:41,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:42,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 06:37:42,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:42,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 06:37:42,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:42,003 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:42,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:37:42,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136066345] [2022-07-12 06:37:42,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136066345] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:37:42,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:37:42,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 06:37:42,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510407619] [2022-07-12 06:37:42,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:37:42,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 06:37:42,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:37:42,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 06:37:42,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 06:37:42,005 INFO L87 Difference]: Start difference. First operand 768 states and 1119 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:42,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:37:42,250 INFO L93 Difference]: Finished difference Result 1803 states and 2717 transitions. [2022-07-12 06:37:42,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 06:37:42,251 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:42,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:37:42,257 INFO L225 Difference]: With dead ends: 1803 [2022-07-12 06:37:42,257 INFO L226 Difference]: Without dead ends: 1177 [2022-07-12 06:37:42,259 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:42,260 INFO L413 NwaCegarLoop]: 288 mSDtfsCounter, 780 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 780 SdHoareTripleChecker+Valid, 777 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:42,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [780 Valid, 777 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:42,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2022-07-12 06:37:42,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 776. [2022-07-12 06:37:42,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 776 states, 614 states have (on average 1.4315960912052117) internal successors, (879), 617 states have internal predecessors, (879), 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:42,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1127 transitions. [2022-07-12 06:37:42,321 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1127 transitions. Word has length 73 [2022-07-12 06:37:42,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:37:42,322 INFO L495 AbstractCegarLoop]: Abstraction has 776 states and 1127 transitions. [2022-07-12 06:37:42,322 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:42,322 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1127 transitions. [2022-07-12 06:37:42,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-07-12 06:37:42,323 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:37:42,323 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:42,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 06:37:42,337 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:37:42,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:37:42,338 INFO L85 PathProgramCache]: Analyzing trace with hash 341297525, now seen corresponding path program 1 times [2022-07-12 06:37:42,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:37:42,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837234487] [2022-07-12 06:37:42,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:37:42,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:37:42,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:42,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:37:42,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:42,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 06:37:42,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:42,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 06:37:42,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:42,420 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:42,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:37:42,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837234487] [2022-07-12 06:37:42,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837234487] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:37:42,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:37:42,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 06:37:42,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088251429] [2022-07-12 06:37:42,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:37:42,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 06:37:42,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:37:42,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 06:37:42,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 06:37:42,422 INFO L87 Difference]: Start difference. First operand 776 states and 1127 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:42,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:37:42,668 INFO L93 Difference]: Finished difference Result 1803 states and 2709 transitions. [2022-07-12 06:37:42,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 06:37:42,669 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:42,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:37:42,673 INFO L225 Difference]: With dead ends: 1803 [2022-07-12 06:37:42,673 INFO L226 Difference]: Without dead ends: 1177 [2022-07-12 06:37:42,674 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:42,675 INFO L413 NwaCegarLoop]: 314 mSDtfsCounter, 237 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 06:37:42,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 744 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 06:37:42,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2022-07-12 06:37:42,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 776. [2022-07-12 06:37:42,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 776 states, 614 states have (on average 1.4250814332247557) internal successors, (875), 617 states have internal predecessors, (875), 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:42,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1123 transitions. [2022-07-12 06:37:42,726 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1123 transitions. Word has length 75 [2022-07-12 06:37:42,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:37:42,726 INFO L495 AbstractCegarLoop]: Abstraction has 776 states and 1123 transitions. [2022-07-12 06:37:42,726 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:42,727 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1123 transitions. [2022-07-12 06:37:42,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-12 06:37:42,727 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:37:42,728 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:42,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 06:37:42,728 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:37:42,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:37:42,728 INFO L85 PathProgramCache]: Analyzing trace with hash 662931196, now seen corresponding path program 1 times [2022-07-12 06:37:42,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:37:42,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327931794] [2022-07-12 06:37:42,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:37:42,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:37:42,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:42,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:37:42,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:42,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 06:37:42,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:42,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 06:37:42,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:42,784 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:42,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:37:42,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327931794] [2022-07-12 06:37:42,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327931794] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:37:42,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:37:42,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 06:37:42,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885419415] [2022-07-12 06:37:42,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:37:42,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 06:37:42,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:37:42,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 06:37:42,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 06:37:42,785 INFO L87 Difference]: Start difference. First operand 776 states and 1123 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:42,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:37:42,840 INFO L93 Difference]: Finished difference Result 1422 states and 2088 transitions. [2022-07-12 06:37:42,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 06:37:42,841 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:42,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:37:42,844 INFO L225 Difference]: With dead ends: 1422 [2022-07-12 06:37:42,844 INFO L226 Difference]: Without dead ends: 796 [2022-07-12 06:37:42,845 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:42,846 INFO L413 NwaCegarLoop]: 291 mSDtfsCounter, 6 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 869 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:42,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 869 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:42,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2022-07-12 06:37:42,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 796. [2022-07-12 06:37:42,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 796 states, 630 states have (on average 1.4142857142857144) internal successors, (891), 633 states have internal predecessors, (891), 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:42,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 1139 transitions. [2022-07-12 06:37:42,904 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 1139 transitions. Word has length 76 [2022-07-12 06:37:42,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:37:42,905 INFO L495 AbstractCegarLoop]: Abstraction has 796 states and 1139 transitions. [2022-07-12 06:37:42,905 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:42,905 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1139 transitions. [2022-07-12 06:37:42,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-12 06:37:42,906 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:37:42,906 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:42,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 06:37:42,906 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:37:42,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:37:42,907 INFO L85 PathProgramCache]: Analyzing trace with hash -520002270, now seen corresponding path program 1 times [2022-07-12 06:37:42,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:37:42,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562007865] [2022-07-12 06:37:42,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:37:42,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:37:42,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:42,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:37:42,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:42,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 06:37:42,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:42,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 06:37:42,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:42,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 06:37:42,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:42,958 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:42,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:37:42,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562007865] [2022-07-12 06:37:42,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562007865] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:37:42,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:37:42,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 06:37:42,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801715495] [2022-07-12 06:37:42,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:37:42,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 06:37:42,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:37:42,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 06:37:42,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 06:37:42,960 INFO L87 Difference]: Start difference. First operand 796 states and 1139 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:43,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:37:43,017 INFO L93 Difference]: Finished difference Result 1462 states and 2132 transitions. [2022-07-12 06:37:43,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 06:37:43,017 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:43,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:37:43,020 INFO L225 Difference]: With dead ends: 1462 [2022-07-12 06:37:43,020 INFO L226 Difference]: Without dead ends: 816 [2022-07-12 06:37:43,022 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:43,022 INFO L413 NwaCegarLoop]: 288 mSDtfsCounter, 6 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 855 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:43,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 855 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:43,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2022-07-12 06:37:43,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 816. [2022-07-12 06:37:43,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 816 states, 646 states have (on average 1.4040247678018576) internal successors, (907), 649 states have internal predecessors, (907), 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:43,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1155 transitions. [2022-07-12 06:37:43,077 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1155 transitions. Word has length 84 [2022-07-12 06:37:43,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:37:43,078 INFO L495 AbstractCegarLoop]: Abstraction has 816 states and 1155 transitions. [2022-07-12 06:37:43,078 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:43,078 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1155 transitions. [2022-07-12 06:37:43,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-07-12 06:37:43,079 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:37:43,079 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:43,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 06:37:43,079 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:37:43,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:37:43,080 INFO L85 PathProgramCache]: Analyzing trace with hash -285867028, now seen corresponding path program 1 times [2022-07-12 06:37:43,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:37:43,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471617175] [2022-07-12 06:37:43,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:37:43,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:37:43,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:43,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:37:43,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:43,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 06:37:43,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:43,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 06:37:43,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:43,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 06:37:43,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:43,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 06:37:43,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:43,126 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:43,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:37:43,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471617175] [2022-07-12 06:37:43,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471617175] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:37:43,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:37:43,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 06:37:43,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315591981] [2022-07-12 06:37:43,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:37:43,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 06:37:43,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:37:43,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 06:37:43,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 06:37:43,128 INFO L87 Difference]: Start difference. First operand 816 states and 1155 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:43,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:37:43,178 INFO L93 Difference]: Finished difference Result 1498 states and 2148 transitions. [2022-07-12 06:37:43,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 06:37:43,179 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:43,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:37:43,182 INFO L225 Difference]: With dead ends: 1498 [2022-07-12 06:37:43,182 INFO L226 Difference]: Without dead ends: 832 [2022-07-12 06:37:43,183 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:43,184 INFO L413 NwaCegarLoop]: 293 mSDtfsCounter, 5 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 864 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:43,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 864 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:43,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2022-07-12 06:37:43,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 832. [2022-07-12 06:37:43,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 832 states, 658 states have (on average 1.3966565349544073) internal successors, (919), 661 states have internal predecessors, (919), 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:43,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 1167 transitions. [2022-07-12 06:37:43,223 INFO L78 Accepts]: Start accepts. Automaton has 832 states and 1167 transitions. Word has length 92 [2022-07-12 06:37:43,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:37:43,223 INFO L495 AbstractCegarLoop]: Abstraction has 832 states and 1167 transitions. [2022-07-12 06:37:43,223 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:43,223 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1167 transitions. [2022-07-12 06:37:43,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-07-12 06:37:43,224 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:37:43,225 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:43,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 06:37:43,225 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:37:43,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:37:43,225 INFO L85 PathProgramCache]: Analyzing trace with hash 2110592275, now seen corresponding path program 1 times [2022-07-12 06:37:43,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:37:43,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095660194] [2022-07-12 06:37:43,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:37:43,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:37:43,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:43,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:37:43,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:43,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 06:37:43,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:43,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 06:37:43,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:43,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 06:37:43,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:43,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 06:37:43,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:43,301 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:43,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:37:43,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095660194] [2022-07-12 06:37:43,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095660194] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:37:43,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:37:43,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 06:37:43,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021223450] [2022-07-12 06:37:43,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:37:43,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 06:37:43,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:37:43,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 06:37:43,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 06:37:43,303 INFO L87 Difference]: Start difference. First operand 832 states and 1167 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:43,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:37:43,356 INFO L93 Difference]: Finished difference Result 1534 states and 2188 transitions. [2022-07-12 06:37:43,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 06:37:43,357 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:43,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:37:43,360 INFO L225 Difference]: With dead ends: 1534 [2022-07-12 06:37:43,360 INFO L226 Difference]: Without dead ends: 852 [2022-07-12 06:37:43,361 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:43,362 INFO L413 NwaCegarLoop]: 288 mSDtfsCounter, 6 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 855 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:43,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 855 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:43,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2022-07-12 06:37:43,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 852. [2022-07-12 06:37:43,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 852 states, 674 states have (on average 1.3872403560830862) internal successors, (935), 677 states have internal predecessors, (935), 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:43,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1183 transitions. [2022-07-12 06:37:43,401 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1183 transitions. Word has length 92 [2022-07-12 06:37:43,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:37:43,402 INFO L495 AbstractCegarLoop]: Abstraction has 852 states and 1183 transitions. [2022-07-12 06:37:43,402 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:43,402 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1183 transitions. [2022-07-12 06:37:43,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-12 06:37:43,404 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:37:43,404 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:43,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 06:37:43,404 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:37:43,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:37:43,405 INFO L85 PathProgramCache]: Analyzing trace with hash 483840627, now seen corresponding path program 1 times [2022-07-12 06:37:43,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:37:43,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195057486] [2022-07-12 06:37:43,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:37:43,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:37:43,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:43,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:37:43,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:43,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 06:37:43,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:43,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 06:37:43,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:43,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 06:37:43,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:43,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 06:37:43,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:43,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 06:37:43,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:43,475 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:43,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:37:43,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195057486] [2022-07-12 06:37:43,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195057486] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:37:43,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:37:43,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 06:37:43,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882527258] [2022-07-12 06:37:43,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:37:43,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 06:37:43,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:37:43,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 06:37:43,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 06:37:43,477 INFO L87 Difference]: Start difference. First operand 852 states and 1183 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:43,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:37:43,540 INFO L93 Difference]: Finished difference Result 1578 states and 2216 transitions. [2022-07-12 06:37:43,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 06:37:43,541 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:43,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:37:43,545 INFO L225 Difference]: With dead ends: 1578 [2022-07-12 06:37:43,545 INFO L226 Difference]: Without dead ends: 876 [2022-07-12 06:37:43,547 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:43,547 INFO L413 NwaCegarLoop]: 292 mSDtfsCounter, 7 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 866 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:43,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 866 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:43,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2022-07-12 06:37:43,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 876. [2022-07-12 06:37:43,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 876 states, 694 states have (on average 1.3760806916426513) internal successors, (955), 697 states have internal predecessors, (955), 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:43,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1203 transitions. [2022-07-12 06:37:43,588 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1203 transitions. Word has length 100 [2022-07-12 06:37:43,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:37:43,588 INFO L495 AbstractCegarLoop]: Abstraction has 876 states and 1203 transitions. [2022-07-12 06:37:43,589 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:43,589 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1203 transitions. [2022-07-12 06:37:43,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-07-12 06:37:43,591 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:37:43,591 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:43,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 06:37:43,591 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:37:43,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:37:43,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1857958922, now seen corresponding path program 1 times [2022-07-12 06:37:43,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:37:43,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984341819] [2022-07-12 06:37:43,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:37:43,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:37:43,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:43,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:37:43,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:43,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 06:37:43,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:43,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 06:37:43,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:43,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 06:37:43,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:43,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 06:37:43,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:43,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 06:37:43,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:43,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 06:37:43,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:43,732 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:43,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:37:43,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984341819] [2022-07-12 06:37:43,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984341819] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:37:43,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:37:43,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 06:37:43,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123968778] [2022-07-12 06:37:43,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:37:43,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 06:37:43,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:37:43,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 06:37:43,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 06:37:43,734 INFO L87 Difference]: Start difference. First operand 876 states and 1203 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:43,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:37:43,972 INFO L93 Difference]: Finished difference Result 2489 states and 3477 transitions. [2022-07-12 06:37:43,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 06:37:43,972 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:43,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:37:43,978 INFO L225 Difference]: With dead ends: 2489 [2022-07-12 06:37:43,978 INFO L226 Difference]: Without dead ends: 1763 [2022-07-12 06:37:43,980 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:43,980 INFO L413 NwaCegarLoop]: 417 mSDtfsCounter, 392 mSDsluCounter, 1888 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 2305 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:43,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 2305 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:43,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1763 states. [2022-07-12 06:37:44,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1763 to 1160. [2022-07-12 06:37:44,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1160 states, 905 states have (on average 1.3668508287292818) internal successors, (1237), 910 states have internal predecessors, (1237), 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:44,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 1581 transitions. [2022-07-12 06:37:44,046 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 1581 transitions. Word has length 103 [2022-07-12 06:37:44,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:37:44,046 INFO L495 AbstractCegarLoop]: Abstraction has 1160 states and 1581 transitions. [2022-07-12 06:37:44,046 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:44,046 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1581 transitions. [2022-07-12 06:37:44,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-12 06:37:44,047 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:37:44,047 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:44,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-12 06:37:44,048 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:37:44,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:37:44,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1544619372, now seen corresponding path program 1 times [2022-07-12 06:37:44,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:37:44,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851738969] [2022-07-12 06:37:44,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:37:44,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:37:44,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:44,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:37:44,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:44,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 06:37:44,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:44,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 06:37:44,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:44,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 06:37:44,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:44,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 06:37:44,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:44,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 06:37:44,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:44,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 06:37:44,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:44,094 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:44,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:37:44,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851738969] [2022-07-12 06:37:44,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851738969] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:37:44,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:37:44,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 06:37:44,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903225145] [2022-07-12 06:37:44,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:37:44,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 06:37:44,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:37:44,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 06:37:44,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 06:37:44,096 INFO L87 Difference]: Start difference. First operand 1160 states and 1581 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:44,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:37:44,164 INFO L93 Difference]: Finished difference Result 2126 states and 2924 transitions. [2022-07-12 06:37:44,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 06:37:44,165 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:44,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:37:44,168 INFO L225 Difference]: With dead ends: 2126 [2022-07-12 06:37:44,168 INFO L226 Difference]: Without dead ends: 1184 [2022-07-12 06:37:44,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 06:37:44,170 INFO L413 NwaCegarLoop]: 293 mSDtfsCounter, 5 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 864 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:44,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 864 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:44,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2022-07-12 06:37:44,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 1184. [2022-07-12 06:37:44,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1184 states, 923 states have (on average 1.3596966413867821) internal successors, (1255), 928 states have internal predecessors, (1255), 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:44,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1184 states and 1599 transitions. [2022-07-12 06:37:44,225 INFO L78 Accepts]: Start accepts. Automaton has 1184 states and 1599 transitions. Word has length 107 [2022-07-12 06:37:44,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:37:44,226 INFO L495 AbstractCegarLoop]: Abstraction has 1184 states and 1599 transitions. [2022-07-12 06:37:44,226 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:44,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 1599 transitions. [2022-07-12 06:37:44,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-12 06:37:44,227 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:37:44,227 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:44,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-12 06:37:44,227 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:37:44,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:37:44,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1746652564, now seen corresponding path program 1 times [2022-07-12 06:37:44,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:37:44,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419078853] [2022-07-12 06:37:44,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:37:44,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:37:44,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:44,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:37:44,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:44,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 06:37:44,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:44,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 06:37:44,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:44,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 06:37:44,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:44,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 06:37:44,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:44,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 06:37:44,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:44,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 06:37:44,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:44,287 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:44,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:37:44,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419078853] [2022-07-12 06:37:44,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419078853] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:37:44,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:37:44,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 06:37:44,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955293868] [2022-07-12 06:37:44,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:37:44,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 06:37:44,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:37:44,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 06:37:44,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 06:37:44,289 INFO L87 Difference]: Start difference. First operand 1184 states and 1599 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:44,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:37:44,414 INFO L93 Difference]: Finished difference Result 1655 states and 2343 transitions. [2022-07-12 06:37:44,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 06:37:44,415 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:44,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:37:44,420 INFO L225 Difference]: With dead ends: 1655 [2022-07-12 06:37:44,421 INFO L226 Difference]: Without dead ends: 1653 [2022-07-12 06:37:44,421 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:44,422 INFO L413 NwaCegarLoop]: 515 mSDtfsCounter, 261 mSDsluCounter, 1736 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 2251 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:44,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 2251 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:44,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1653 states. [2022-07-12 06:37:44,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1653 to 1192. [2022-07-12 06:37:44,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1192 states, 927 states have (on average 1.3581445523193096) internal successors, (1259), 934 states have internal predecessors, (1259), 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:44,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 1607 transitions. [2022-07-12 06:37:44,494 INFO L78 Accepts]: Start accepts. Automaton has 1192 states and 1607 transitions. Word has length 106 [2022-07-12 06:37:44,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:37:44,494 INFO L495 AbstractCegarLoop]: Abstraction has 1192 states and 1607 transitions. [2022-07-12 06:37:44,494 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:44,494 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 1607 transitions. [2022-07-12 06:37:44,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-07-12 06:37:44,495 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:37:44,496 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:44,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-12 06:37:44,496 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:37:44,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:37:44,496 INFO L85 PathProgramCache]: Analyzing trace with hash 285885957, now seen corresponding path program 1 times [2022-07-12 06:37:44,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:37:44,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305197101] [2022-07-12 06:37:44,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:37:44,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:37:44,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:44,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:37:44,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:44,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 06:37:44,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:44,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 06:37:44,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:44,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 06:37:44,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:44,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 06:37:44,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:44,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 06:37:44,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:44,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 06:37:44,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:44,572 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:44,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:37:44,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305197101] [2022-07-12 06:37:44,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305197101] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:37:44,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:37:44,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 06:37:44,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611393244] [2022-07-12 06:37:44,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:37:44,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 06:37:44,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:37:44,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 06:37:44,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 06:37:44,574 INFO L87 Difference]: Start difference. First operand 1192 states and 1607 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:44,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:37:44,738 INFO L93 Difference]: Finished difference Result 2446 states and 3360 transitions. [2022-07-12 06:37:44,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 06:37:44,738 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:44,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:37:44,744 INFO L225 Difference]: With dead ends: 2446 [2022-07-12 06:37:44,744 INFO L226 Difference]: Without dead ends: 1554 [2022-07-12 06:37:44,746 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:44,747 INFO L413 NwaCegarLoop]: 410 mSDtfsCounter, 524 mSDsluCounter, 1854 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 2264 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:44,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 2264 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:44,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1554 states. [2022-07-12 06:37:44,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1554 to 1236. [2022-07-12 06:37:44,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1236 states, 982 states have (on average 1.3482688391038697) internal successors, (1324), 994 states have internal predecessors, (1324), 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:44,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1236 states to 1236 states and 1648 transitions. [2022-07-12 06:37:44,838 INFO L78 Accepts]: Start accepts. Automaton has 1236 states and 1648 transitions. Word has length 109 [2022-07-12 06:37:44,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:37:44,838 INFO L495 AbstractCegarLoop]: Abstraction has 1236 states and 1648 transitions. [2022-07-12 06:37:44,839 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:44,839 INFO L276 IsEmpty]: Start isEmpty. Operand 1236 states and 1648 transitions. [2022-07-12 06:37:44,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-07-12 06:37:44,840 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:37:44,840 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:44,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-12 06:37:44,840 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:37:44,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:37:44,841 INFO L85 PathProgramCache]: Analyzing trace with hash 641112124, now seen corresponding path program 1 times [2022-07-12 06:37:44,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:37:44,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933292680] [2022-07-12 06:37:44,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:37:44,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:37:44,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:44,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:37:44,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:44,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 06:37:44,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:44,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 06:37:44,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:44,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 06:37:44,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:44,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 06:37:44,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:44,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 06:37:44,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:44,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 06:37:44,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:44,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-12 06:37:44,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:44,927 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:44,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:37:44,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933292680] [2022-07-12 06:37:44,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933292680] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:37:44,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:37:44,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 06:37:44,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539862032] [2022-07-12 06:37:44,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:37:44,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 06:37:44,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:37:44,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 06:37:44,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 06:37:44,929 INFO L87 Difference]: Start difference. First operand 1236 states and 1648 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:45,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:37:45,109 INFO L93 Difference]: Finished difference Result 2538 states and 3469 transitions. [2022-07-12 06:37:45,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 06:37:45,110 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:45,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:37:45,115 INFO L225 Difference]: With dead ends: 2538 [2022-07-12 06:37:45,115 INFO L226 Difference]: Without dead ends: 1582 [2022-07-12 06:37:45,118 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:45,118 INFO L413 NwaCegarLoop]: 440 mSDtfsCounter, 396 mSDsluCounter, 1974 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 2414 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:45,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 2414 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:45,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1582 states. [2022-07-12 06:37:45,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1582 to 1123. [2022-07-12 06:37:45,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1123 states, 896 states have (on average 1.3493303571428572) internal successors, (1209), 906 states have internal predecessors, (1209), 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:45,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1499 transitions. [2022-07-12 06:37:45,199 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1499 transitions. Word has length 111 [2022-07-12 06:37:45,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:37:45,199 INFO L495 AbstractCegarLoop]: Abstraction has 1123 states and 1499 transitions. [2022-07-12 06:37:45,199 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:45,199 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1499 transitions. [2022-07-12 06:37:45,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-07-12 06:37:45,200 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:37:45,200 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:45,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-12 06:37:45,201 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:37:45,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:37:45,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1939847605, now seen corresponding path program 1 times [2022-07-12 06:37:45,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:37:45,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944095281] [2022-07-12 06:37:45,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:37:45,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:37:45,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:45,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:37:45,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:45,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 06:37:45,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:45,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 06:37:45,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:45,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 06:37:45,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:45,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 06:37:45,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:45,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 06:37:45,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:45,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 06:37:45,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:45,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-12 06:37:45,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:45,288 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:45,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:37:45,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944095281] [2022-07-12 06:37:45,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944095281] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:37:45,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:37:45,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 06:37:45,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402219613] [2022-07-12 06:37:45,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:37:45,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 06:37:45,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:37:45,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 06:37:45,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-12 06:37:45,289 INFO L87 Difference]: Start difference. First operand 1123 states and 1499 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:45,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:37:45,800 INFO L93 Difference]: Finished difference Result 2606 states and 3573 transitions. [2022-07-12 06:37:45,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 06:37:45,800 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:45,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:37:45,806 INFO L225 Difference]: With dead ends: 2606 [2022-07-12 06:37:45,806 INFO L226 Difference]: Without dead ends: 1683 [2022-07-12 06:37:45,807 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:45,809 INFO L413 NwaCegarLoop]: 506 mSDtfsCounter, 1047 mSDsluCounter, 1646 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1053 SdHoareTripleChecker+Valid, 2152 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 06:37:45,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1053 Valid, 2152 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 06:37:45,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1683 states. [2022-07-12 06:37:45,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1683 to 1139. [2022-07-12 06:37:45,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1139 states, 904 states have (on average 1.329646017699115) internal successors, (1202), 915 states have internal predecessors, (1202), 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:45,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1498 transitions. [2022-07-12 06:37:45,887 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1498 transitions. Word has length 112 [2022-07-12 06:37:45,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:37:45,887 INFO L495 AbstractCegarLoop]: Abstraction has 1139 states and 1498 transitions. [2022-07-12 06:37:45,887 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:45,887 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1498 transitions. [2022-07-12 06:37:45,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-07-12 06:37:45,888 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:37:45,888 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:45,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-12 06:37:45,888 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:37:45,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:37:45,889 INFO L85 PathProgramCache]: Analyzing trace with hash 889695918, now seen corresponding path program 1 times [2022-07-12 06:37:45,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:37:45,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830165793] [2022-07-12 06:37:45,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:37:45,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:37:45,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:45,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:37:45,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:45,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 06:37:45,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:45,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 06:37:45,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:45,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 06:37:45,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:45,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 06:37:45,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:45,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 06:37:45,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:45,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 06:37:45,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:45,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-12 06:37:45,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:45,972 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,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:37:45,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830165793] [2022-07-12 06:37:45,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830165793] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:37:45,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:37:45,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 06:37:45,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097699326] [2022-07-12 06:37:45,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:37:45,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 06:37:45,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:37:45,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 06:37:45,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 06:37:45,973 INFO L87 Difference]: Start difference. First operand 1139 states and 1498 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:46,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:37:46,219 INFO L93 Difference]: Finished difference Result 3175 states and 4263 transitions. [2022-07-12 06:37:46,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 06:37:46,220 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:46,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:37:46,228 INFO L225 Difference]: With dead ends: 3175 [2022-07-12 06:37:46,228 INFO L226 Difference]: Without dead ends: 2287 [2022-07-12 06:37:46,230 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,231 INFO L413 NwaCegarLoop]: 510 mSDtfsCounter, 437 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 1223 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:46,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 1223 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:46,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2287 states. [2022-07-12 06:37:46,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2287 to 1935. [2022-07-12 06:37:46,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1935 states, 1510 states have (on average 1.3271523178807947) internal successors, (2004), 1529 states have internal predecessors, (2004), 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:46,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1935 states and 2548 transitions. [2022-07-12 06:37:46,414 INFO L78 Accepts]: Start accepts. Automaton has 1935 states and 2548 transitions. Word has length 112 [2022-07-12 06:37:46,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:37:46,414 INFO L495 AbstractCegarLoop]: Abstraction has 1935 states and 2548 transitions. [2022-07-12 06:37:46,414 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:46,415 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 2548 transitions. [2022-07-12 06:37:46,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-12 06:37:46,416 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:37:46,416 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:46,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-12 06:37:46,416 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:37:46,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:37:46,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1041296419, now seen corresponding path program 1 times [2022-07-12 06:37:46,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:37:46,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010350330] [2022-07-12 06:37:46,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:37:46,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:37:46,441 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 15 [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 47 [2022-07-12 06:37:46,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:46,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 06:37:46,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:46,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 06:37:46,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:46,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 06:37:46,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:46,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 06:37:46,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:46,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 06:37:46,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:46,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-12 06:37:46,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:46,525 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:46,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:37:46,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010350330] [2022-07-12 06:37:46,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010350330] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:37:46,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:37:46,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 06:37:46,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350337388] [2022-07-12 06:37:46,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:37:46,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 06:37:46,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:37:46,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 06:37:46,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 06:37:46,527 INFO L87 Difference]: Start difference. First operand 1935 states and 2548 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:47,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:37:47,091 INFO L93 Difference]: Finished difference Result 4386 states and 5918 transitions. [2022-07-12 06:37:47,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 06:37:47,091 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:47,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:37:47,100 INFO L225 Difference]: With dead ends: 4386 [2022-07-12 06:37:47,100 INFO L226 Difference]: Without dead ends: 2800 [2022-07-12 06:37:47,103 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:47,104 INFO L413 NwaCegarLoop]: 575 mSDtfsCounter, 802 mSDsluCounter, 1930 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 805 SdHoareTripleChecker+Valid, 2505 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 06:37:47,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [805 Valid, 2505 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 06:37:47,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2800 states. [2022-07-12 06:37:47,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2800 to 1954. [2022-07-12 06:37:47,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1954 states, 1516 states have (on average 1.3232189973614776) internal successors, (2006), 1536 states have internal predecessors, (2006), 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:47,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1954 states to 1954 states and 2566 transitions. [2022-07-12 06:37:47,267 INFO L78 Accepts]: Start accepts. Automaton has 1954 states and 2566 transitions. Word has length 114 [2022-07-12 06:37:47,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:37:47,267 INFO L495 AbstractCegarLoop]: Abstraction has 1954 states and 2566 transitions. [2022-07-12 06:37:47,267 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:47,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1954 states and 2566 transitions. [2022-07-12 06:37:47,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-07-12 06:37:47,268 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:37:47,269 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:47,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-12 06:37:47,269 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:37:47,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:37:47,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1708808100, now seen corresponding path program 1 times [2022-07-12 06:37:47,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:37:47,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985581473] [2022-07-12 06:37:47,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:37:47,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:37:47,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:47,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:37:47,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:47,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 06:37:47,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:47,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 06:37:47,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:47,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 06:37:47,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:47,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 06:37:47,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:47,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 06:37:47,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:47,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 06:37:47,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:47,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-12 06:37:47,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:47,317 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,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:37:47,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985581473] [2022-07-12 06:37:47,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985581473] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:37:47,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:37:47,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 06:37:47,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237557838] [2022-07-12 06:37:47,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:37:47,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 06:37:47,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:37:47,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 06:37:47,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 06:37:47,319 INFO L87 Difference]: Start difference. First operand 1954 states and 2566 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:47,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:37:47,625 INFO L93 Difference]: Finished difference Result 5154 states and 6849 transitions. [2022-07-12 06:37:47,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 06:37:47,634 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:47,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:37:47,653 INFO L225 Difference]: With dead ends: 5154 [2022-07-12 06:37:47,657 INFO L226 Difference]: Without dead ends: 3584 [2022-07-12 06:37:47,660 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,660 INFO L413 NwaCegarLoop]: 526 mSDtfsCounter, 484 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 1287 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 06:37:47,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 1287 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 06:37:47,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3584 states. [2022-07-12 06:37:47,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3584 to 3015. [2022-07-12 06:37:47,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3015 states, 2302 states have (on average 1.3192875760208513) internal successors, (3037), 2333 states have internal predecessors, (3037), 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:47,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3015 states to 3015 states and 3957 transitions. [2022-07-12 06:37:47,853 INFO L78 Accepts]: Start accepts. Automaton has 3015 states and 3957 transitions. Word has length 115 [2022-07-12 06:37:47,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:37:47,853 INFO L495 AbstractCegarLoop]: Abstraction has 3015 states and 3957 transitions. [2022-07-12 06:37:47,853 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:47,853 INFO L276 IsEmpty]: Start isEmpty. Operand 3015 states and 3957 transitions. [2022-07-12 06:37:47,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-07-12 06:37:47,855 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:37:47,856 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:47,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-12 06:37:47,856 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:37:47,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:37:47,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1228455916, now seen corresponding path program 1 times [2022-07-12 06:37:47,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:37:47,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045036742] [2022-07-12 06:37:47,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:37:47,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:37:47,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:47,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:37:47,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:47,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 06:37:47,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:47,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 06:37:47,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:47,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 06:37:47,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:47,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 06:37:47,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:47,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 06:37:47,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:47,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-12 06:37:47,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:47,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-12 06:37:47,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:47,922 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,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:37:47,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045036742] [2022-07-12 06:37:47,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045036742] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:37:47,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:37:47,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 06:37:47,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196291758] [2022-07-12 06:37:47,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:37:47,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 06:37:47,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:37:47,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 06:37:47,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 06:37:47,924 INFO L87 Difference]: Start difference. First operand 3015 states and 3957 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:48,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:37:48,372 INFO L93 Difference]: Finished difference Result 7127 states and 9424 transitions. [2022-07-12 06:37:48,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 06:37:48,373 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:48,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:37:48,385 INFO L225 Difference]: With dead ends: 7127 [2022-07-12 06:37:48,386 INFO L226 Difference]: Without dead ends: 4626 [2022-07-12 06:37:48,391 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:48,392 INFO L413 NwaCegarLoop]: 549 mSDtfsCounter, 431 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 1283 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:48,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 1283 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:48,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4626 states. [2022-07-12 06:37:48,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4626 to 4292. [2022-07-12 06:37:48,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4292 states, 3255 states have (on average 1.3170506912442397) internal successors, (4287), 3299 states have internal predecessors, (4287), 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:48,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4292 states to 4292 states and 5631 transitions. [2022-07-12 06:37:48,668 INFO L78 Accepts]: Start accepts. Automaton has 4292 states and 5631 transitions. Word has length 115 [2022-07-12 06:37:48,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:37:48,669 INFO L495 AbstractCegarLoop]: Abstraction has 4292 states and 5631 transitions. [2022-07-12 06:37:48,669 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:48,669 INFO L276 IsEmpty]: Start isEmpty. Operand 4292 states and 5631 transitions. [2022-07-12 06:37:48,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-07-12 06:37:48,670 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:37:48,671 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:48,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-12 06:37:48,671 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:37:48,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:37:48,671 INFO L85 PathProgramCache]: Analyzing trace with hash 331094376, now seen corresponding path program 1 times [2022-07-12 06:37:48,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:37:48,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868687145] [2022-07-12 06:37:48,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:37:48,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:37:48,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:48,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:37:48,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:48,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 06:37:48,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:48,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 06:37:48,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:48,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 06:37:48,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:48,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 06:37:48,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:48,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 06:37:48,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:48,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 06:37:48,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:48,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 06:37:48,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:48,701 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:48,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:37:48,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868687145] [2022-07-12 06:37:48,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868687145] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:37:48,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:37:48,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 06:37:48,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271657726] [2022-07-12 06:37:48,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:37:48,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 06:37:48,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:37:48,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 06:37:48,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 06:37:48,703 INFO L87 Difference]: Start difference. First operand 4292 states and 5631 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:49,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:37:49,137 INFO L93 Difference]: Finished difference Result 9705 states and 13179 transitions. [2022-07-12 06:37:49,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 06:37:49,137 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:49,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:37:49,150 INFO L225 Difference]: With dead ends: 9705 [2022-07-12 06:37:49,150 INFO L226 Difference]: Without dead ends: 5818 [2022-07-12 06:37:49,157 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:49,157 INFO L413 NwaCegarLoop]: 458 mSDtfsCounter, 151 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 703 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:49,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 703 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:49,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5818 states. [2022-07-12 06:37:49,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5818 to 4298. [2022-07-12 06:37:49,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4298 states, 3261 states have (on average 1.3164673413063477) internal successors, (4293), 3305 states have internal predecessors, (4293), 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:49,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4298 states to 4298 states and 5637 transitions. [2022-07-12 06:37:49,472 INFO L78 Accepts]: Start accepts. Automaton has 4298 states and 5637 transitions. Word has length 116 [2022-07-12 06:37:49,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:37:49,472 INFO L495 AbstractCegarLoop]: Abstraction has 4298 states and 5637 transitions. [2022-07-12 06:37:49,472 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:49,472 INFO L276 IsEmpty]: Start isEmpty. Operand 4298 states and 5637 transitions. [2022-07-12 06:37:49,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-12 06:37:49,474 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:37:49,474 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:49,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-12 06:37:49,474 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:37:49,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:37:49,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1590062833, now seen corresponding path program 1 times [2022-07-12 06:37:49,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:37:49,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811607205] [2022-07-12 06:37:49,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:37:49,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:37:49,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:49,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:37:49,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:49,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 06:37:49,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:49,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 06:37:49,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:49,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 06:37:49,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:49,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-12 06:37:49,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:49,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-12 06:37:49,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:49,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-12 06:37:49,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:49,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-12 06:37:49,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:49,518 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:49,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:37:49,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811607205] [2022-07-12 06:37:49,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811607205] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:37:49,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:37:49,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 06:37:49,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138954241] [2022-07-12 06:37:49,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:37:49,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 06:37:49,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:37:49,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 06:37:49,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 06:37:49,520 INFO L87 Difference]: Start difference. First operand 4298 states and 5637 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:49,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:37:49,879 INFO L93 Difference]: Finished difference Result 9003 states and 12067 transitions. [2022-07-12 06:37:49,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 06:37:49,880 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:49,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:37:49,890 INFO L225 Difference]: With dead ends: 9003 [2022-07-12 06:37:49,890 INFO L226 Difference]: Without dead ends: 4802 [2022-07-12 06:37:49,896 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:49,896 INFO L413 NwaCegarLoop]: 334 mSDtfsCounter, 369 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 881 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:49,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 881 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:49,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4802 states. [2022-07-12 06:37:50,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4802 to 3865. [2022-07-12 06:37:50,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3865 states, 2911 states have (on average 1.3229130882858124) internal successors, (3851), 2945 states have internal predecessors, (3851), 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:50,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3865 states to 3865 states and 5091 transitions. [2022-07-12 06:37:50,229 INFO L78 Accepts]: Start accepts. Automaton has 3865 states and 5091 transitions. Word has length 117 [2022-07-12 06:37:50,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:37:50,229 INFO L495 AbstractCegarLoop]: Abstraction has 3865 states and 5091 transitions. [2022-07-12 06:37:50,229 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:50,229 INFO L276 IsEmpty]: Start isEmpty. Operand 3865 states and 5091 transitions. [2022-07-12 06:37:50,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-07-12 06:37:50,231 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:37:50,231 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:50,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-12 06:37:50,231 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:37:50,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:37:50,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1465420109, now seen corresponding path program 1 times [2022-07-12 06:37:50,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:37:50,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361551511] [2022-07-12 06:37:50,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:37:50,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:37:50,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:50,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:37:50,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:50,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 06:37:50,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:50,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 06:37:50,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:50,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 06:37:50,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:50,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 06:37:50,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:50,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 06:37:50,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:50,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 06:37:50,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:50,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 06:37:50,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:50,275 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:50,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:37:50,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361551511] [2022-07-12 06:37:50,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361551511] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:37:50,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:37:50,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 06:37:50,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555904644] [2022-07-12 06:37:50,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:37:50,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 06:37:50,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:37:50,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 06:37:50,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 06:37:50,278 INFO L87 Difference]: Start difference. First operand 3865 states and 5091 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:50,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:37:50,697 INFO L93 Difference]: Finished difference Result 8503 states and 11497 transitions. [2022-07-12 06:37:50,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 06:37:50,698 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:50,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:37:50,707 INFO L225 Difference]: With dead ends: 8503 [2022-07-12 06:37:50,707 INFO L226 Difference]: Without dead ends: 4851 [2022-07-12 06:37:50,712 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:50,712 INFO L413 NwaCegarLoop]: 438 mSDtfsCounter, 151 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 682 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:50,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 682 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:50,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4851 states. [2022-07-12 06:37:50,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4851 to 3875. [2022-07-12 06:37:50,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3875 states, 2921 states have (on average 1.3218076001369394) internal successors, (3861), 2955 states have internal predecessors, (3861), 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:50,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3875 states to 3875 states and 5101 transitions. [2022-07-12 06:37:50,966 INFO L78 Accepts]: Start accepts. Automaton has 3875 states and 5101 transitions. Word has length 118 [2022-07-12 06:37:50,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:37:50,966 INFO L495 AbstractCegarLoop]: Abstraction has 3875 states and 5101 transitions. [2022-07-12 06:37:50,966 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:50,966 INFO L276 IsEmpty]: Start isEmpty. Operand 3875 states and 5101 transitions. [2022-07-12 06:37:50,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-07-12 06:37:50,967 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:37:50,968 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:50,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-12 06:37:50,968 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:37:50,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:37:50,968 INFO L85 PathProgramCache]: Analyzing trace with hash -132784146, now seen corresponding path program 1 times [2022-07-12 06:37:50,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:37:50,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284310645] [2022-07-12 06:37:50,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:37:50,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:37:50,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:51,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:37:51,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:51,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 06:37:51,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:51,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-12 06:37:51,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:51,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 06:37:51,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:51,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 06:37:51,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:51,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 06:37:51,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:51,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 06:37:51,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:51,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 06:37:51,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:51,013 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:51,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:37:51,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284310645] [2022-07-12 06:37:51,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284310645] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:37:51,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:37:51,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 06:37:51,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181691358] [2022-07-12 06:37:51,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:37:51,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 06:37:51,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:37:51,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 06:37:51,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 06:37:51,014 INFO L87 Difference]: Start difference. First operand 3875 states and 5101 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:51,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:37:51,386 INFO L93 Difference]: Finished difference Result 8451 states and 11414 transitions. [2022-07-12 06:37:51,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 06:37:51,387 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:51,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:37:51,397 INFO L225 Difference]: With dead ends: 8451 [2022-07-12 06:37:51,397 INFO L226 Difference]: Without dead ends: 4722 [2022-07-12 06:37:51,402 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:51,402 INFO L413 NwaCegarLoop]: 359 mSDtfsCounter, 284 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 912 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:51,402 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 912 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:51,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4722 states. [2022-07-12 06:37:51,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4722 to 2925. [2022-07-12 06:37:51,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2925 states, 2205 states have (on average 1.3133786848072562) internal successors, (2896), 2224 states have internal predecessors, (2896), 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:51,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2925 states to 2925 states and 3834 transitions. [2022-07-12 06:37:51,618 INFO L78 Accepts]: Start accepts. Automaton has 2925 states and 3834 transitions. Word has length 118 [2022-07-12 06:37:51,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:37:51,618 INFO L495 AbstractCegarLoop]: Abstraction has 2925 states and 3834 transitions. [2022-07-12 06:37:51,618 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:51,619 INFO L276 IsEmpty]: Start isEmpty. Operand 2925 states and 3834 transitions. [2022-07-12 06:37:51,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2022-07-12 06:37:51,623 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:37:51,623 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] [2022-07-12 06:37:51,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-12 06:37:51,623 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:37:51,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:37:51,624 INFO L85 PathProgramCache]: Analyzing trace with hash -664741411, now seen corresponding path program 1 times [2022-07-12 06:37:51,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:37:51,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534341943] [2022-07-12 06:37:51,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:37:51,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:37:51,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:51,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:37:51,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:51,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 06:37:51,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:51,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 06:37:51,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:51,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 06:37:51,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:51,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 06:37:51,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:51,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 06:37:51,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:51,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 06:37:51,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:51,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 06:37:51,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:51,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-12 06:37:51,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:51,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-12 06:37:51,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:51,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-12 06:37:51,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:51,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-12 06:37:51,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:51,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-12 06:37:51,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:51,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-12 06:37:51,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:51,740 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:51,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:37:51,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534341943] [2022-07-12 06:37:51,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534341943] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:37:51,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782261175] [2022-07-12 06:37:51,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:37:51,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:37:51,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:37:51,743 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:51,780 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:51,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:51,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 744 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 06:37:51,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:37:52,090 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:52,090 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 06:37:52,228 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:52,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1782261175] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 06:37:52,229 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 06:37:52,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-07-12 06:37:52,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514621603] [2022-07-12 06:37:52,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 06:37:52,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 06:37:52,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:37:52,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 06:37:52,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-07-12 06:37:52,230 INFO L87 Difference]: Start difference. First operand 2925 states and 3834 transitions. Second operand has 14 states, 14 states have (on average 18.714285714285715) internal successors, (262), 13 states have internal predecessors, (262), 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:55,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:37:55,260 INFO L93 Difference]: Finished difference Result 9990 states and 13988 transitions. [2022-07-12 06:37:55,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-07-12 06:37:55,261 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 18.714285714285715) internal successors, (262), 13 states have internal predecessors, (262), 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 185 [2022-07-12 06:37:55,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:37:55,278 INFO L225 Difference]: With dead ends: 9990 [2022-07-12 06:37:55,278 INFO L226 Difference]: Without dead ends: 7352 [2022-07-12 06:37:55,283 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 466 GetRequests, 402 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:55,284 INFO L413 NwaCegarLoop]: 336 mSDtfsCounter, 4455 mSDsluCounter, 2937 mSDsCounter, 0 mSdLazyCounter, 2038 mSolverCounterSat, 1308 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4455 SdHoareTripleChecker+Valid, 3273 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.5s IncrementalHoareTripleChecker+Time [2022-07-12 06:37:55,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4455 Valid, 3273 Invalid, 3346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1308 Valid, 2038 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-12 06:37:55,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7352 states. [2022-07-12 06:37:55,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7352 to 3449. [2022-07-12 06:37:55,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3449 states, 2622 states have (on average 1.3093058733790999) internal successors, (3433), 2642 states have internal predecessors, (3433), 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:55,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3449 states to 3449 states and 4495 transitions. [2022-07-12 06:37:55,726 INFO L78 Accepts]: Start accepts. Automaton has 3449 states and 4495 transitions. Word has length 185 [2022-07-12 06:37:55,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:37:55,727 INFO L495 AbstractCegarLoop]: Abstraction has 3449 states and 4495 transitions. [2022-07-12 06:37:55,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 18.714285714285715) internal successors, (262), 13 states have internal predecessors, (262), 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:55,727 INFO L276 IsEmpty]: Start isEmpty. Operand 3449 states and 4495 transitions. [2022-07-12 06:37:55,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2022-07-12 06:37:55,732 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:37:55,732 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] [2022-07-12 06:37:55,750 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:55,950 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:55,950 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:37:55,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:37:55,950 INFO L85 PathProgramCache]: Analyzing trace with hash 782511274, now seen corresponding path program 1 times [2022-07-12 06:37:55,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:37:55,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253723078] [2022-07-12 06:37:55,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:37:55,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:37:56,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:56,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:37:56,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:56,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 06:37:56,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:56,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 06:37:56,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:56,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 06:37:56,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:56,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 06:37:56,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:56,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 06:37:56,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:56,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 06:37:56,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:56,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-12 06:37:56,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:56,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-12 06:37:56,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:56,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-12 06:37:56,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:56,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-12 06:37:56,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:56,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-12 06:37:56,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:56,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-12 06:37:56,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:56,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-12 06:37:56,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:56,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-12 06:37:56,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:56,114 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:56,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:37:56,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253723078] [2022-07-12 06:37:56,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253723078] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:37:56,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1021417353] [2022-07-12 06:37:56,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:37:56,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:37:56,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:37:56,132 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:56,133 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:56,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:37:56,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-12 06:37:56,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:37:56,527 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:56,528 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 06:37:56,712 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:56,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1021417353] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 06:37:56,712 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 06:37:56,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2022-07-12 06:37:56,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58529362] [2022-07-12 06:37:56,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 06:37:56,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-12 06:37:56,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:37:56,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-12 06:37:56,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2022-07-12 06:37:56,715 INFO L87 Difference]: Start difference. First operand 3449 states and 4495 transitions. Second operand has 16 states, 16 states have (on average 16.5) internal successors, (264), 14 states have internal predecessors, (264), 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:03,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:38:03,853 INFO L93 Difference]: Finished difference Result 17499 states and 23924 transitions. [2022-07-12 06:38:03,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2022-07-12 06:38:03,853 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 16.5) internal successors, (264), 14 states have internal predecessors, (264), 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 193 [2022-07-12 06:38:03,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:38:03,896 INFO L225 Difference]: With dead ends: 17499 [2022-07-12 06:38:03,896 INFO L226 Difference]: Without dead ends: 14346 [2022-07-12 06:38:03,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 592 GetRequests, 474 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:03,910 INFO L413 NwaCegarLoop]: 1822 mSDtfsCounter, 7160 mSDsluCounter, 13743 mSDsCounter, 0 mSdLazyCounter, 5454 mSolverCounterSat, 4426 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7160 SdHoareTripleChecker+Valid, 15565 SdHoareTripleChecker+Invalid, 9880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4426 IncrementalHoareTripleChecker+Valid, 5454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-07-12 06:38:03,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7160 Valid, 15565 Invalid, 9880 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4426 Valid, 5454 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-07-12 06:38:03,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14346 states. [2022-07-12 06:38:04,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14346 to 6315. [2022-07-12 06:38:04,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6315 states, 4771 states have (on average 1.3114651016558374) internal successors, (6257), 4809 states have internal predecessors, (6257), 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:04,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6315 states to 6315 states and 8241 transitions. [2022-07-12 06:38:04,667 INFO L78 Accepts]: Start accepts. Automaton has 6315 states and 8241 transitions. Word has length 193 [2022-07-12 06:38:04,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:38:04,668 INFO L495 AbstractCegarLoop]: Abstraction has 6315 states and 8241 transitions. [2022-07-12 06:38:04,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 16.5) internal successors, (264), 14 states have internal predecessors, (264), 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:04,668 INFO L276 IsEmpty]: Start isEmpty. Operand 6315 states and 8241 transitions. [2022-07-12 06:38:04,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2022-07-12 06:38:04,675 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:38:04,675 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] [2022-07-12 06:38:04,697 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:04,892 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:04,892 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:38:04,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:38:04,893 INFO L85 PathProgramCache]: Analyzing trace with hash -579946063, now seen corresponding path program 1 times [2022-07-12 06:38:04,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:38:04,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313440894] [2022-07-12 06:38:04,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:38:04,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:38:04,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:04,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:38:04,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:04,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 06:38:04,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:04,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 06:38:04,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:04,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 06:38:04,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:04,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 06:38:04,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:04,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 06:38:04,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:04,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 06:38:04,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:04,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 06:38:04,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:04,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 06:38:04,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:04,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 06:38:04,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:04,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-12 06:38:04,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:04,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-12 06:38:04,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:04,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-12 06:38:04,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:04,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-12 06:38:04,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:04,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-12 06:38:04,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:04,970 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:04,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:38:04,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313440894] [2022-07-12 06:38:04,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313440894] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:38:04,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:38:04,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 06:38:04,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242150077] [2022-07-12 06:38:04,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:38:04,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 06:38:04,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:38:04,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 06:38:04,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 06:38:04,971 INFO L87 Difference]: Start difference. First operand 6315 states and 8241 transitions. Second operand has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 6 states have internal predecessors, (116), 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:07,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:38:07,212 INFO L93 Difference]: Finished difference Result 21323 states and 28571 transitions. [2022-07-12 06:38:07,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 06:38:07,213 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 6 states have internal predecessors, (116), 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 195 [2022-07-12 06:38:07,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:38:07,252 INFO L225 Difference]: With dead ends: 21323 [2022-07-12 06:38:07,253 INFO L226 Difference]: Without dead ends: 15366 [2022-07-12 06:38:07,264 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:07,265 INFO L413 NwaCegarLoop]: 572 mSDtfsCounter, 811 mSDsluCounter, 2510 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 830 SdHoareTripleChecker+Valid, 3082 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.3s IncrementalHoareTripleChecker+Time [2022-07-12 06:38:07,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [830 Valid, 3082 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 06:38:07,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15366 states. [2022-07-12 06:38:08,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15366 to 8157. [2022-07-12 06:38:08,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8157 states, 6101 states have (on average 1.3088018357646287) internal successors, (7985), 6152 states have internal predecessors, (7985), 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:08,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8157 states to 8157 states and 10655 transitions. [2022-07-12 06:38:08,121 INFO L78 Accepts]: Start accepts. Automaton has 8157 states and 10655 transitions. Word has length 195 [2022-07-12 06:38:08,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:38:08,122 INFO L495 AbstractCegarLoop]: Abstraction has 8157 states and 10655 transitions. [2022-07-12 06:38:08,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 6 states have internal predecessors, (116), 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:08,122 INFO L276 IsEmpty]: Start isEmpty. Operand 8157 states and 10655 transitions. [2022-07-12 06:38:08,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2022-07-12 06:38:08,132 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:38:08,133 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] [2022-07-12 06:38:08,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-12 06:38:08,133 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:38:08,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:38:08,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1014240118, now seen corresponding path program 1 times [2022-07-12 06:38:08,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:38:08,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944842751] [2022-07-12 06:38:08,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:38:08,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:38:08,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:08,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:38:08,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:08,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 06:38:08,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:08,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 06:38:08,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:08,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 06:38:08,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:08,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 06:38:08,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:08,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 06:38:08,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:08,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 06:38:08,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:08,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 06:38:08,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:08,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 06:38:08,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:08,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 06:38:08,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:08,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-12 06:38:08,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:08,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-12 06:38:08,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:08,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-12 06:38:08,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:08,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-12 06:38:08,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:08,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-12 06:38:08,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:08,256 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:08,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:38:08,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944842751] [2022-07-12 06:38:08,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944842751] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:38:08,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [844054557] [2022-07-12 06:38:08,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:38:08,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:38:08,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:38:08,280 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:08,316 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:08,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:08,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 794 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-12 06:38:08,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:38:08,517 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:08,517 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 06:38:08,600 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:08,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [844054557] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-12 06:38:08,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-12 06:38:08,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8, 7] total 14 [2022-07-12 06:38:08,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912303630] [2022-07-12 06:38:08,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:38:08,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 06:38:08,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:38:08,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 06:38:08,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-07-12 06:38:08,603 INFO L87 Difference]: Start difference. First operand 8157 states and 10655 transitions. Second operand has 5 states, 4 states have (on average 28.5) internal successors, (114), 5 states have internal predecessors, (114), 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:09,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:38:09,204 INFO L93 Difference]: Finished difference Result 13437 states and 17606 transitions. [2022-07-12 06:38:09,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 06:38:09,205 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 28.5) internal successors, (114), 5 states have internal predecessors, (114), 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 197 [2022-07-12 06:38:09,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:38:09,220 INFO L225 Difference]: With dead ends: 13437 [2022-07-12 06:38:09,220 INFO L226 Difference]: Without dead ends: 5486 [2022-07-12 06:38:09,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 417 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:09,230 INFO L413 NwaCegarLoop]: 292 mSDtfsCounter, 2 mSDsluCounter, 863 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1155 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 06:38:09,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1155 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 06:38:09,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5486 states. [2022-07-12 06:38:09,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5486 to 5486. [2022-07-12 06:38:09,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5486 states, 4104 states have (on average 1.3082358674463939) internal successors, (5369), 4138 states have internal predecessors, (5369), 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:09,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5486 states to 5486 states and 7171 transitions. [2022-07-12 06:38:09,745 INFO L78 Accepts]: Start accepts. Automaton has 5486 states and 7171 transitions. Word has length 197 [2022-07-12 06:38:09,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:38:09,745 INFO L495 AbstractCegarLoop]: Abstraction has 5486 states and 7171 transitions. [2022-07-12 06:38:09,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 28.5) internal successors, (114), 5 states have internal predecessors, (114), 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:09,746 INFO L276 IsEmpty]: Start isEmpty. Operand 5486 states and 7171 transitions. [2022-07-12 06:38:09,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2022-07-12 06:38:09,753 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:38:09,753 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] [2022-07-12 06:38:09,786 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:09,972 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:09,972 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:38:09,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:38:09,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1806123049, now seen corresponding path program 1 times [2022-07-12 06:38:09,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:38:09,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335975167] [2022-07-12 06:38:09,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:38:09,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:38:09,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:10,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:38:10,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:10,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 06:38:10,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:10,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 06:38:10,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:10,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 06:38:10,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:10,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 06:38:10,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:10,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 06:38:10,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:10,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 06:38:10,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:10,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 06:38:10,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:10,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 06:38:10,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:10,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-12 06:38:10,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:10,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-12 06:38:10,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:10,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-12 06:38:10,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:10,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-12 06:38:10,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:10,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-12 06:38:10,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:10,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-12 06:38:10,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:10,124 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:10,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:38:10,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335975167] [2022-07-12 06:38:10,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335975167] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:38:10,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182573008] [2022-07-12 06:38:10,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:38:10,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:38:10,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:38:10,131 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:10,154 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:10,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:10,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 820 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-12 06:38:10,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:38:10,663 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:10,663 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 06:38:10,939 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:10,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1182573008] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 06:38:10,940 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 06:38:10,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 8] total 24 [2022-07-12 06:38:10,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675290773] [2022-07-12 06:38:10,940 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 06:38:10,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-12 06:38:10,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:38:10,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-12 06:38:10,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=488, Unknown=0, NotChecked=0, Total=552 [2022-07-12 06:38:10,941 INFO L87 Difference]: Start difference. First operand 5486 states and 7171 transitions. Second operand has 24 states, 24 states have (on average 14.25) internal successors, (342), 24 states have internal predecessors, (342), 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:25,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:38:25,133 INFO L93 Difference]: Finished difference Result 28569 states and 40063 transitions. [2022-07-12 06:38:25,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 231 states. [2022-07-12 06:38:25,133 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 14.25) internal successors, (342), 24 states have internal predecessors, (342), 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 197 [2022-07-12 06:38:25,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:38:25,186 INFO L225 Difference]: With dead ends: 28569 [2022-07-12 06:38:25,186 INFO L226 Difference]: Without dead ends: 23367 [2022-07-12 06:38:25,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 666 GetRequests, 415 SyntacticMatches, 1 SemanticMatches, 250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26384 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6223, Invalid=57029, Unknown=0, NotChecked=0, Total=63252 [2022-07-12 06:38:25,208 INFO L413 NwaCegarLoop]: 704 mSDtfsCounter, 9301 mSDsluCounter, 7978 mSDsCounter, 0 mSdLazyCounter, 12855 mSolverCounterSat, 4404 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9301 SdHoareTripleChecker+Valid, 8682 SdHoareTripleChecker+Invalid, 17259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4404 IncrementalHoareTripleChecker+Valid, 12855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-07-12 06:38:25,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9301 Valid, 8682 Invalid, 17259 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4404 Valid, 12855 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2022-07-12 06:38:25,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23367 states. [2022-07-12 06:38:26,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23367 to 11873. [2022-07-12 06:38:26,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11873 states, 8944 states have (on average 1.3064624329159213) internal successors, (11685), 9014 states have internal predecessors, (11685), 1889 states have call successors, (1889), 1039 states have call predecessors, (1889), 1039 states have return successors, (1889), 1819 states have call predecessors, (1889), 1889 states have call successors, (1889) [2022-07-12 06:38:26,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11873 states to 11873 states and 15463 transitions. [2022-07-12 06:38:26,743 INFO L78 Accepts]: Start accepts. Automaton has 11873 states and 15463 transitions. Word has length 197 [2022-07-12 06:38:26,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:38:26,743 INFO L495 AbstractCegarLoop]: Abstraction has 11873 states and 15463 transitions. [2022-07-12 06:38:26,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 14.25) internal successors, (342), 24 states have internal predecessors, (342), 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:26,744 INFO L276 IsEmpty]: Start isEmpty. Operand 11873 states and 15463 transitions. [2022-07-12 06:38:26,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2022-07-12 06:38:26,759 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:38:26,759 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] [2022-07-12 06:38:26,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-12 06:38:26,980 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:26,980 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:38:26,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:38:26,980 INFO L85 PathProgramCache]: Analyzing trace with hash 2096530114, now seen corresponding path program 1 times [2022-07-12 06:38:26,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:38:26,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007333486] [2022-07-12 06:38:26,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:38:26,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:38:26,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:27,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:38:27,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:27,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 06:38:27,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:27,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 06:38:27,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:27,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 06:38:27,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:27,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 06:38:27,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:27,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 06:38:27,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:27,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 06:38:27,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:27,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 06:38:27,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:27,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 06:38:27,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:27,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-12 06:38:27,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:27,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-12 06:38:27,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:27,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-12 06:38:27,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:27,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-12 06:38:27,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:27,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-12 06:38:27,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:27,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-12 06:38:27,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:27,075 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:27,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:38:27,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007333486] [2022-07-12 06:38:27,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007333486] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:38:27,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:38:27,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 06:38:27,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519005968] [2022-07-12 06:38:27,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:38:27,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 06:38:27,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:38:27,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 06:38:27,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-12 06:38:27,076 INFO L87 Difference]: Start difference. First operand 11873 states and 15463 transitions. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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:28,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:38:28,344 INFO L93 Difference]: Finished difference Result 22733 states and 29699 transitions. [2022-07-12 06:38:28,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 06:38:28,344 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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 197 [2022-07-12 06:38:28,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:38:28,412 INFO L225 Difference]: With dead ends: 22733 [2022-07-12 06:38:28,413 INFO L226 Difference]: Without dead ends: 11127 [2022-07-12 06:38:28,425 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:28,435 INFO L413 NwaCegarLoop]: 254 mSDtfsCounter, 449 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 06:38:28,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 475 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 06:38:28,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11127 states. [2022-07-12 06:38:29,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11127 to 11125. [2022-07-12 06:38:29,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11125 states, 8388 states have (on average 1.308416785884597) internal successors, (10975), 8454 states have internal predecessors, (10975), 1767 states have call successors, (1767), 969 states have call predecessors, (1767), 969 states have return successors, (1767), 1701 states have call predecessors, (1767), 1767 states have call successors, (1767) [2022-07-12 06:38:29,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11125 states to 11125 states and 14509 transitions. [2022-07-12 06:38:29,720 INFO L78 Accepts]: Start accepts. Automaton has 11125 states and 14509 transitions. Word has length 197 [2022-07-12 06:38:29,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:38:29,721 INFO L495 AbstractCegarLoop]: Abstraction has 11125 states and 14509 transitions. [2022-07-12 06:38:29,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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:29,721 INFO L276 IsEmpty]: Start isEmpty. Operand 11125 states and 14509 transitions. [2022-07-12 06:38:29,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2022-07-12 06:38:29,773 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:38:29,773 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] [2022-07-12 06:38:29,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-07-12 06:38:29,774 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:38:29,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:38:29,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1193102570, now seen corresponding path program 1 times [2022-07-12 06:38:29,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:38:29,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941630725] [2022-07-12 06:38:29,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:38:29,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:38:29,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:29,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:38:29,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:29,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 06:38:29,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:29,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 06:38:29,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:29,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 06:38:29,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:29,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 06:38:29,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:29,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 06:38:29,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:29,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 06:38:29,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:29,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 06:38:29,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:29,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 06:38:29,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:29,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-12 06:38:29,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:29,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-12 06:38:29,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:29,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-12 06:38:29,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:29,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-12 06:38:29,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:29,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-07-12 06:38:29,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:29,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-12 06:38:29,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:29,912 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:29,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:38:29,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941630725] [2022-07-12 06:38:29,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941630725] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:38:29,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885382815] [2022-07-12 06:38:29,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:38:29,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:38:29,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:38:29,928 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:29,959 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:30,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:30,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 819 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-12 06:38:30,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:38:30,191 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:30,191 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 06:38:30,294 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:30,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [885382815] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 06:38:30,295 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 06:38:30,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 17 [2022-07-12 06:38:30,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913231054] [2022-07-12 06:38:30,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 06:38:30,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-12 06:38:30,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:38:30,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-12 06:38:30,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2022-07-12 06:38:30,298 INFO L87 Difference]: Start difference. First operand 11125 states and 14509 transitions. Second operand has 17 states, 17 states have (on average 15.117647058823529) internal successors, (257), 16 states have internal predecessors, (257), 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:37,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:38:37,638 INFO L93 Difference]: Finished difference Result 34382 states and 47559 transitions. [2022-07-12 06:38:37,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-07-12 06:38:37,639 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 15.117647058823529) internal successors, (257), 16 states have internal predecessors, (257), 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 198 [2022-07-12 06:38:37,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:38:37,712 INFO L225 Difference]: With dead ends: 34382 [2022-07-12 06:38:37,712 INFO L226 Difference]: Without dead ends: 23563 [2022-07-12 06:38:37,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 428 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2051 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=886, Invalid=5594, Unknown=0, NotChecked=0, Total=6480 [2022-07-12 06:38:37,737 INFO L413 NwaCegarLoop]: 638 mSDtfsCounter, 3541 mSDsluCounter, 6698 mSDsCounter, 0 mSdLazyCounter, 5668 mSolverCounterSat, 1858 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3541 SdHoareTripleChecker+Valid, 7336 SdHoareTripleChecker+Invalid, 7526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1858 IncrementalHoareTripleChecker+Valid, 5668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-07-12 06:38:37,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3541 Valid, 7336 Invalid, 7526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1858 Valid, 5668 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-07-12 06:38:37,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23563 states. [2022-07-12 06:38:39,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23563 to 12473. [2022-07-12 06:38:39,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12473 states, 9416 states have (on average 1.304269328802039) internal successors, (12281), 9490 states have internal predecessors, (12281), 1967 states have call successors, (1967), 1089 states have call predecessors, (1967), 1089 states have return successors, (1967), 1893 states have call predecessors, (1967), 1967 states have call successors, (1967) [2022-07-12 06:38:39,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12473 states to 12473 states and 16215 transitions. [2022-07-12 06:38:39,415 INFO L78 Accepts]: Start accepts. Automaton has 12473 states and 16215 transitions. Word has length 198 [2022-07-12 06:38:39,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:38:39,415 INFO L495 AbstractCegarLoop]: Abstraction has 12473 states and 16215 transitions. [2022-07-12 06:38:39,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 15.117647058823529) internal successors, (257), 16 states have internal predecessors, (257), 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:39,416 INFO L276 IsEmpty]: Start isEmpty. Operand 12473 states and 16215 transitions. [2022-07-12 06:38:39,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2022-07-12 06:38:39,429 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:38:39,429 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] [2022-07-12 06:38:39,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-12 06:38:39,639 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:39,639 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:38:39,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:38:39,640 INFO L85 PathProgramCache]: Analyzing trace with hash -679576872, now seen corresponding path program 1 times [2022-07-12 06:38:39,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:38:39,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807918503] [2022-07-12 06:38:39,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:38:39,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:38:39,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:39,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:38:39,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:39,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 06:38:39,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:39,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 06:38:39,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:39,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 06:38:39,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:39,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 06:38:39,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:39,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 06:38:39,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:39,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 06:38:39,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:39,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 06:38:39,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:39,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 06:38:39,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:39,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 06:38:39,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:39,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-12 06:38:39,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:39,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-12 06:38:39,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:39,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-12 06:38:39,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:39,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-07-12 06:38:39,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:39,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-12 06:38:39,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:39,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-12 06:38:39,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:39,699 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:39,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:38:39,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807918503] [2022-07-12 06:38:39,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807918503] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:38:39,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:38:39,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 06:38:39,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029476628] [2022-07-12 06:38:39,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:38:39,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 06:38:39,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:38:39,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 06:38:39,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 06:38:39,701 INFO L87 Difference]: Start difference. First operand 12473 states and 16215 transitions. Second operand has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 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:41,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:38:41,177 INFO L93 Difference]: Finished difference Result 24021 states and 31326 transitions. [2022-07-12 06:38:41,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 06:38:41,178 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 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 206 [2022-07-12 06:38:41,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:38:41,222 INFO L225 Difference]: With dead ends: 24021 [2022-07-12 06:38:41,222 INFO L226 Difference]: Without dead ends: 11817 [2022-07-12 06:38:41,238 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:41,240 INFO L413 NwaCegarLoop]: 264 mSDtfsCounter, 234 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 06:38:41,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 454 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 06:38:41,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11817 states. [2022-07-12 06:38:42,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11817 to 11785. [2022-07-12 06:38:42,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11785 states, 8920 states have (on average 1.303811659192825) internal successors, (11630), 8990 states have internal predecessors, (11630), 1845 states have call successors, (1845), 1019 states have call predecessors, (1845), 1019 states have return successors, (1845), 1775 states have call predecessors, (1845), 1845 states have call successors, (1845) [2022-07-12 06:38:42,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11785 states to 11785 states and 15320 transitions. [2022-07-12 06:38:42,779 INFO L78 Accepts]: Start accepts. Automaton has 11785 states and 15320 transitions. Word has length 206 [2022-07-12 06:38:42,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:38:42,779 INFO L495 AbstractCegarLoop]: Abstraction has 11785 states and 15320 transitions. [2022-07-12 06:38:42,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 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:42,779 INFO L276 IsEmpty]: Start isEmpty. Operand 11785 states and 15320 transitions. [2022-07-12 06:38:42,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-07-12 06:38:42,791 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:38:42,791 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] [2022-07-12 06:38:42,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-07-12 06:38:42,791 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:38:42,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:38:42,791 INFO L85 PathProgramCache]: Analyzing trace with hash -999010550, now seen corresponding path program 1 times [2022-07-12 06:38:42,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:38:42,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296580304] [2022-07-12 06:38:42,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:38:42,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:38:42,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:42,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:38:42,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:42,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 06:38:42,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:42,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 06:38:42,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:42,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 06:38:42,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:42,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 06:38:42,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:42,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 06:38:42,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:42,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 06:38:42,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:42,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-12 06:38:42,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:42,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-12 06:38:42,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:42,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-12 06:38:42,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:42,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-12 06:38:42,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:42,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-12 06:38:42,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:42,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-12 06:38:42,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:42,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-12 06:38:42,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:42,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-12 06:38:42,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:42,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-12 06:38:42,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:42,871 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:42,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:38:42,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296580304] [2022-07-12 06:38:42,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296580304] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:38:42,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2142597572] [2022-07-12 06:38:42,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:38:42,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:38:42,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:38:42,873 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:42,909 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:43,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:43,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 06:38:43,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:38:43,229 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:43,229 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 06:38:43,408 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:43,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2142597572] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 06:38:43,408 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 06:38:43,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 10 [2022-07-12 06:38:43,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743089596] [2022-07-12 06:38:43,408 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 06:38:43,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 06:38:43,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:38:43,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 06:38:43,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-12 06:38:43,409 INFO L87 Difference]: Start difference. First operand 11785 states and 15320 transitions. Second operand has 10 states, 10 states have (on average 18.7) internal successors, (187), 9 states have internal predecessors, (187), 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:46,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:38:46,991 INFO L93 Difference]: Finished difference Result 36730 states and 47908 transitions. [2022-07-12 06:38:46,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 06:38:46,992 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 18.7) internal successors, (187), 9 states have internal predecessors, (187), 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 207 [2022-07-12 06:38:46,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:38:47,042 INFO L225 Difference]: With dead ends: 36730 [2022-07-12 06:38:47,043 INFO L226 Difference]: Without dead ends: 25380 [2022-07-12 06:38:47,061 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 464 GetRequests, 445 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:47,064 INFO L413 NwaCegarLoop]: 402 mSDtfsCounter, 779 mSDsluCounter, 2560 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 784 SdHoareTripleChecker+Valid, 2962 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 06:38:47,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [784 Valid, 2962 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 06:38:47,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25380 states. [2022-07-12 06:38:49,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25380 to 18325. [2022-07-12 06:38:49,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18325 states, 13994 states have (on average 1.2876947263112763) internal successors, (18020), 14123 states have internal predecessors, (18020), 2752 states have call successors, (2752), 1578 states have call predecessors, (2752), 1578 states have return successors, (2752), 2623 states have call predecessors, (2752), 2752 states have call successors, (2752) [2022-07-12 06:38:49,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18325 states to 18325 states and 23524 transitions. [2022-07-12 06:38:49,664 INFO L78 Accepts]: Start accepts. Automaton has 18325 states and 23524 transitions. Word has length 207 [2022-07-12 06:38:49,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:38:49,665 INFO L495 AbstractCegarLoop]: Abstraction has 18325 states and 23524 transitions. [2022-07-12 06:38:49,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.7) internal successors, (187), 9 states have internal predecessors, (187), 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:49,665 INFO L276 IsEmpty]: Start isEmpty. Operand 18325 states and 23524 transitions. [2022-07-12 06:38:49,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-07-12 06:38:49,675 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:38:49,675 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] [2022-07-12 06:38:49,693 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-07-12 06:38:49,892 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:49,893 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:38:49,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:38:49,893 INFO L85 PathProgramCache]: Analyzing trace with hash 261492107, now seen corresponding path program 1 times [2022-07-12 06:38:49,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:38:49,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617838866] [2022-07-12 06:38:49,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:38:49,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:38:49,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:49,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:38:49,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:49,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 06:38:49,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:49,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 06:38:49,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:49,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 06:38:49,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:49,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 06:38:49,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:49,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 06:38:49,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:49,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 06:38:49,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:49,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 06:38:49,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:49,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 06:38:49,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:49,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 06:38:49,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:49,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-12 06:38:49,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:49,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-12 06:38:49,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:49,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-12 06:38:49,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:49,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-12 06:38:49,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:49,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-12 06:38:49,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:49,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-12 06:38:49,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:49,999 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:50,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:38:50,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617838866] [2022-07-12 06:38:50,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617838866] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:38:50,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803193043] [2022-07-12 06:38:50,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:38:50,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:38:50,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:38:50,004 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:50,047 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:50,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:50,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 06:38:50,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:38:50,276 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:50,277 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 06:38:50,403 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:50,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803193043] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 06:38:50,404 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 06:38:50,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2022-07-12 06:38:50,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844592067] [2022-07-12 06:38:50,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 06:38:50,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 06:38:50,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:38:50,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 06:38:50,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-12 06:38:50,405 INFO L87 Difference]: Start difference. First operand 18325 states and 23524 transitions. Second operand has 9 states, 9 states have (on average 20.22222222222222) internal successors, (182), 8 states have internal predecessors, (182), 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:54,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:38:54,329 INFO L93 Difference]: Finished difference Result 42775 states and 56777 transitions. [2022-07-12 06:38:54,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 06:38:54,329 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 20.22222222222222) internal successors, (182), 8 states have internal predecessors, (182), 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 207 [2022-07-12 06:38:54,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:38:54,414 INFO L225 Difference]: With dead ends: 42775 [2022-07-12 06:38:54,414 INFO L226 Difference]: Without dead ends: 24756 [2022-07-12 06:38:54,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 443 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:54,433 INFO L413 NwaCegarLoop]: 424 mSDtfsCounter, 281 mSDsluCounter, 1859 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 2283 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:54,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 2283 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:54,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24756 states. [2022-07-12 06:38:56,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24756 to 18325. [2022-07-12 06:38:56,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18325 states, 13994 states have (on average 1.287337430327283) internal successors, (18015), 14123 states have internal predecessors, (18015), 2752 states have call successors, (2752), 1578 states have call predecessors, (2752), 1578 states have return successors, (2752), 2623 states have call predecessors, (2752), 2752 states have call successors, (2752) [2022-07-12 06:38:56,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18325 states to 18325 states and 23519 transitions. [2022-07-12 06:38:57,005 INFO L78 Accepts]: Start accepts. Automaton has 18325 states and 23519 transitions. Word has length 207 [2022-07-12 06:38:57,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:38:57,019 INFO L495 AbstractCegarLoop]: Abstraction has 18325 states and 23519 transitions. [2022-07-12 06:38:57,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 20.22222222222222) internal successors, (182), 8 states have internal predecessors, (182), 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:57,020 INFO L276 IsEmpty]: Start isEmpty. Operand 18325 states and 23519 transitions. [2022-07-12 06:38:57,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2022-07-12 06:38:57,030 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:38:57,030 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] [2022-07-12 06:38:57,065 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:57,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:38:57,248 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:38:57,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:38:57,248 INFO L85 PathProgramCache]: Analyzing trace with hash -148674929, now seen corresponding path program 1 times [2022-07-12 06:38:57,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:38:57,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802550034] [2022-07-12 06:38:57,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:38:57,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:38:57,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:57,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:38:57,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:57,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 06:38:57,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:57,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 06:38:57,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:57,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 06:38:57,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:57,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 06:38:57,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:57,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 06:38:57,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:57,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 06:38:57,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:57,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-12 06:38:57,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:57,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-12 06:38:57,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:57,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 06:38:57,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:57,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-12 06:38:57,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:57,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-12 06:38:57,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:57,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-12 06:38:57,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:57,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-07-12 06:38:57,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:57,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-12 06:38:57,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:57,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-12 06:38:57,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:57,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2022-07-12 06:38:57,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:57,574 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:57,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:38:57,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802550034] [2022-07-12 06:38:57,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802550034] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:38:57,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822195037] [2022-07-12 06:38:57,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:38:57,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:38:57,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:38:57,576 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:57,577 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:57,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:38:57,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 855 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-12 06:38:57,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:38:58,327 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:58,327 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 06:38:58,941 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:58,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822195037] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 06:38:58,941 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 06:38:58,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 10] total 22 [2022-07-12 06:38:58,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958054726] [2022-07-12 06:38:58,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 06:38:58,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-12 06:38:58,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:38:58,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-12 06:38:58,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2022-07-12 06:38:58,943 INFO L87 Difference]: Start difference. First operand 18325 states and 23519 transitions. Second operand has 22 states, 22 states have (on average 16.818181818181817) internal successors, (370), 22 states have internal predecessors, (370), 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:06,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:39:06,446 INFO L93 Difference]: Finished difference Result 43825 states and 58510 transitions. [2022-07-12 06:39:06,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-07-12 06:39:06,447 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 16.818181818181817) internal successors, (370), 22 states have internal predecessors, (370), 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 214 [2022-07-12 06:39:06,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:39:06,537 INFO L225 Difference]: With dead ends: 43825 [2022-07-12 06:39:06,537 INFO L226 Difference]: Without dead ends: 29125 [2022-07-12 06:39:06,560 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 450 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 601 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=643, Invalid=1907, Unknown=0, NotChecked=0, Total=2550 [2022-07-12 06:39:06,563 INFO L413 NwaCegarLoop]: 451 mSDtfsCounter, 6733 mSDsluCounter, 2674 mSDsCounter, 0 mSdLazyCounter, 2679 mSolverCounterSat, 2781 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6734 SdHoareTripleChecker+Valid, 3125 SdHoareTripleChecker+Invalid, 5460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2781 IncrementalHoareTripleChecker+Valid, 2679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-12 06:39:06,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6734 Valid, 3125 Invalid, 5460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2781 Valid, 2679 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-07-12 06:39:06,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29125 states. [2022-07-12 06:39:08,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29125 to 14875. [2022-07-12 06:39:08,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14875 states, 11277 states have (on average 1.2813691584641305) internal successors, (14450), 11385 states have internal predecessors, (14450), 2308 states have call successors, (2308), 1289 states have call predecessors, (2308), 1289 states have return successors, (2308), 2200 states have call predecessors, (2308), 2308 states have call successors, (2308) [2022-07-12 06:39:08,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14875 states to 14875 states and 19066 transitions. [2022-07-12 06:39:08,805 INFO L78 Accepts]: Start accepts. Automaton has 14875 states and 19066 transitions. Word has length 214 [2022-07-12 06:39:08,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:39:08,806 INFO L495 AbstractCegarLoop]: Abstraction has 14875 states and 19066 transitions. [2022-07-12 06:39:08,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 16.818181818181817) internal successors, (370), 22 states have internal predecessors, (370), 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:08,806 INFO L276 IsEmpty]: Start isEmpty. Operand 14875 states and 19066 transitions. [2022-07-12 06:39:08,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2022-07-12 06:39:08,814 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:39:08,814 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] [2022-07-12 06:39:08,832 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:09,016 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:09,016 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:39:09,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:39:09,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1038689630, now seen corresponding path program 1 times [2022-07-12 06:39:09,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:39:09,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208085027] [2022-07-12 06:39:09,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:39:09,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:39:09,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:09,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:39:09,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:09,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 06:39:09,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:09,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 06:39:09,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:09,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 06:39:09,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:09,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 06:39:09,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:09,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 06:39:09,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:09,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 06:39:09,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:09,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-12 06:39:09,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:09,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-12 06:39:09,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:09,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 06:39:09,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:09,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-12 06:39:09,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:09,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-12 06:39:09,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:09,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-12 06:39:09,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:09,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-12 06:39:09,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:09,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-12 06:39:09,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:09,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-12 06:39:09,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:09,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-07-12 06:39:09,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:09,116 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:09,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:39:09,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208085027] [2022-07-12 06:39:09,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208085027] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:39:09,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015664389] [2022-07-12 06:39:09,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:39:09,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:39:09,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:39:09,119 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:09,122 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:09,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:09,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-12 06:39:09,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:39:09,396 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:09,397 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 06:39:09,665 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:09,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1015664389] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 06:39:09,665 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 06:39:09,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 8] total 14 [2022-07-12 06:39:09,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904416948] [2022-07-12 06:39:09,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 06:39:09,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 06:39:09,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:39:09,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 06:39:09,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-07-12 06:39:09,667 INFO L87 Difference]: Start difference. First operand 14875 states and 19066 transitions. Second operand has 14 states, 14 states have (on average 18.285714285714285) internal successors, (256), 14 states have internal predecessors, (256), 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:17,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:39:17,744 INFO L93 Difference]: Finished difference Result 47041 states and 63502 transitions. [2022-07-12 06:39:17,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-07-12 06:39:17,745 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 18.285714285714285) internal successors, (256), 14 states have internal predecessors, (256), 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 215 [2022-07-12 06:39:17,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:39:17,821 INFO L225 Difference]: With dead ends: 47041 [2022-07-12 06:39:17,822 INFO L226 Difference]: Without dead ends: 33867 [2022-07-12 06:39:17,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 547 GetRequests, 471 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:17,844 INFO L413 NwaCegarLoop]: 979 mSDtfsCounter, 2310 mSDsluCounter, 6882 mSDsCounter, 0 mSdLazyCounter, 1606 mSolverCounterSat, 727 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2410 SdHoareTripleChecker+Valid, 7861 SdHoareTripleChecker+Invalid, 2333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 727 IncrementalHoareTripleChecker+Valid, 1606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-12 06:39:17,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2410 Valid, 7861 Invalid, 2333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [727 Valid, 1606 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-12 06:39:17,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33867 states. [2022-07-12 06:39:20,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33867 to 19644. [2022-07-12 06:39:20,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19644 states, 15082 states have (on average 1.2717146267073332) internal successors, (19180), 15215 states have internal predecessors, (19180), 2885 states have call successors, (2885), 1676 states have call predecessors, (2885), 1676 states have return successors, (2885), 2752 states have call predecessors, (2885), 2885 states have call successors, (2885) [2022-07-12 06:39:20,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19644 states to 19644 states and 24950 transitions. [2022-07-12 06:39:20,992 INFO L78 Accepts]: Start accepts. Automaton has 19644 states and 24950 transitions. Word has length 215 [2022-07-12 06:39:20,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:39:20,992 INFO L495 AbstractCegarLoop]: Abstraction has 19644 states and 24950 transitions. [2022-07-12 06:39:20,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 18.285714285714285) internal successors, (256), 14 states have internal predecessors, (256), 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:20,993 INFO L276 IsEmpty]: Start isEmpty. Operand 19644 states and 24950 transitions. [2022-07-12 06:39:21,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2022-07-12 06:39:21,003 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:39:21,003 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] [2022-07-12 06:39:21,020 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:21,207 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:21,208 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:39:21,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:39:21,208 INFO L85 PathProgramCache]: Analyzing trace with hash -390096860, now seen corresponding path program 1 times [2022-07-12 06:39:21,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:39:21,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545708345] [2022-07-12 06:39:21,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:39:21,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:39:21,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:21,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:39:21,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:21,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 06:39:21,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:21,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 06:39:21,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:21,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 06:39:21,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:21,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 06:39:21,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:21,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 06:39:21,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:21,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 06:39:21,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:21,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-12 06:39:21,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:21,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-12 06:39:21,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:21,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 06:39:21,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:21,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-12 06:39:21,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:21,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-12 06:39:21,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:21,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-12 06:39:21,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:21,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-12 06:39:21,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:21,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-12 06:39:21,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:21,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-12 06:39:21,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:21,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-07-12 06:39:21,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:21,326 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:21,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:39:21,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545708345] [2022-07-12 06:39:21,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545708345] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:39:21,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:39:21,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 06:39:21,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094431989] [2022-07-12 06:39:21,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:39:21,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 06:39:21,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:39:21,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 06:39:21,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 06:39:21,327 INFO L87 Difference]: Start difference. First operand 19644 states and 24950 transitions. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 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:23,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:39:23,569 INFO L93 Difference]: Finished difference Result 33015 states and 42131 transitions. [2022-07-12 06:39:23,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 06:39:23,570 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 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 215 [2022-07-12 06:39:23,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:39:23,603 INFO L225 Difference]: With dead ends: 33015 [2022-07-12 06:39:23,603 INFO L226 Difference]: Without dead ends: 14409 [2022-07-12 06:39:23,626 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:23,626 INFO L413 NwaCegarLoop]: 260 mSDtfsCounter, 238 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 486 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:23,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 486 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:23,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14409 states. [2022-07-12 06:39:25,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14409 to 14366. [2022-07-12 06:39:25,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14366 states, 11123 states have (on average 1.2738469837274116) internal successors, (14169), 11211 states have internal predecessors, (14169), 2049 states have call successors, (2049), 1193 states have call predecessors, (2049), 1193 states have return successors, (2049), 1961 states have call predecessors, (2049), 2049 states have call successors, (2049) [2022-07-12 06:39:25,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14366 states to 14366 states and 18267 transitions. [2022-07-12 06:39:25,901 INFO L78 Accepts]: Start accepts. Automaton has 14366 states and 18267 transitions. Word has length 215 [2022-07-12 06:39:25,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:39:25,912 INFO L495 AbstractCegarLoop]: Abstraction has 14366 states and 18267 transitions. [2022-07-12 06:39:25,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 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:25,912 INFO L276 IsEmpty]: Start isEmpty. Operand 14366 states and 18267 transitions. [2022-07-12 06:39:25,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2022-07-12 06:39:25,918 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:39:25,918 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] [2022-07-12 06:39:25,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-07-12 06:39:25,918 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:39:25,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:39:25,919 INFO L85 PathProgramCache]: Analyzing trace with hash -2065979923, now seen corresponding path program 1 times [2022-07-12 06:39:25,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:39:25,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485450944] [2022-07-12 06:39:25,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:39:25,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:39:25,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:25,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:39:25,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:25,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 06:39:25,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:25,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 06:39:25,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:25,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 06:39:25,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:25,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 06:39:25,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:25,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 06:39:25,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:25,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 06:39:25,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:25,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-12 06:39:26,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:26,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-12 06:39:26,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:26,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-12 06:39:26,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:26,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-12 06:39:26,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:26,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-12 06:39:26,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:26,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-12 06:39:26,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:26,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-12 06:39:26,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:26,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-12 06:39:26,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:26,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-12 06:39:26,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:26,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-12 06:39:26,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:26,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-07-12 06:39:26,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:26,015 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:26,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:39:26,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485450944] [2022-07-12 06:39:26,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485450944] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:39:26,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:39:26,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 06:39:26,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398453474] [2022-07-12 06:39:26,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:39:26,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 06:39:26,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:39:26,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 06:39:26,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 06:39:26,017 INFO L87 Difference]: Start difference. First operand 14366 states and 18267 transitions. Second operand has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 6 states have internal predecessors, (114), 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:30,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:39:30,790 INFO L93 Difference]: Finished difference Result 37324 states and 48512 transitions. [2022-07-12 06:39:30,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 06:39:30,791 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 6 states have internal predecessors, (114), 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 216 [2022-07-12 06:39:30,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:39:30,845 INFO L225 Difference]: With dead ends: 37324 [2022-07-12 06:39:30,845 INFO L226 Difference]: Without dead ends: 27051 [2022-07-12 06:39:30,858 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:30,859 INFO L413 NwaCegarLoop]: 583 mSDtfsCounter, 611 mSDsluCounter, 2416 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 626 SdHoareTripleChecker+Valid, 2999 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:30,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [626 Valid, 2999 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:30,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27051 states. [2022-07-12 06:39:33,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27051 to 17739. [2022-07-12 06:39:33,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17739 states, 13570 states have (on average 1.2665438467207075) internal successors, (17187), 13692 states have internal predecessors, (17187), 2637 states have call successors, (2637), 1531 states have call predecessors, (2637), 1531 states have return successors, (2637), 2515 states have call predecessors, (2637), 2637 states have call successors, (2637) [2022-07-12 06:39:33,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17739 states to 17739 states and 22461 transitions. [2022-07-12 06:39:33,753 INFO L78 Accepts]: Start accepts. Automaton has 17739 states and 22461 transitions. Word has length 216 [2022-07-12 06:39:33,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:39:33,754 INFO L495 AbstractCegarLoop]: Abstraction has 17739 states and 22461 transitions. [2022-07-12 06:39:33,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 6 states have internal predecessors, (114), 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:33,754 INFO L276 IsEmpty]: Start isEmpty. Operand 17739 states and 22461 transitions. [2022-07-12 06:39:33,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2022-07-12 06:39:33,762 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:39:33,762 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] [2022-07-12 06:39:33,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-07-12 06:39:33,762 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:39:33,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:39:33,763 INFO L85 PathProgramCache]: Analyzing trace with hash 231937200, now seen corresponding path program 1 times [2022-07-12 06:39:33,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:39:33,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084180568] [2022-07-12 06:39:33,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:39:33,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:39:33,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:33,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:39:33,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:33,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 06:39:33,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:33,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 06:39:33,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:33,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 06:39:33,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:33,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 06:39:33,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:33,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 06:39:33,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:33,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 06:39:33,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:33,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-12 06:39:33,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:33,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-12 06:39:33,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:33,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-12 06:39:33,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:33,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-12 06:39:33,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:33,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-12 06:39:33,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:33,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-07-12 06:39:33,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:33,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-12 06:39:33,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:33,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-12 06:39:33,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:33,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-12 06:39:33,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:33,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-07-12 06:39:33,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:33,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-07-12 06:39:33,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:33,905 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:33,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:39:33,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084180568] [2022-07-12 06:39:33,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084180568] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:39:33,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042867693] [2022-07-12 06:39:33,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:39:33,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:39:33,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:39:33,906 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:33,912 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:34,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:34,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 869 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-12 06:39:34,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:39:34,164 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:34,164 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 06:39:34,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1042867693] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:39:34,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 06:39:34,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2022-07-12 06:39:34,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582945248] [2022-07-12 06:39:34,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:39:34,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 06:39:34,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:39:34,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 06:39:34,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2022-07-12 06:39:34,166 INFO L87 Difference]: Start difference. First operand 17739 states and 22461 transitions. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 6 states have internal predecessors, (151), 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:37,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:39:37,973 INFO L93 Difference]: Finished difference Result 38045 states and 49370 transitions. [2022-07-12 06:39:37,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 06:39:37,974 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 6 states have internal predecessors, (151), 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 217 [2022-07-12 06:39:37,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:39:38,023 INFO L225 Difference]: With dead ends: 38045 [2022-07-12 06:39:38,023 INFO L226 Difference]: Without dead ends: 21711 [2022-07-12 06:39:38,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 250 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:38,049 INFO L413 NwaCegarLoop]: 609 mSDtfsCounter, 671 mSDsluCounter, 1752 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 671 SdHoareTripleChecker+Valid, 2361 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 06:39:38,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [671 Valid, 2361 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 06:39:38,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21711 states. [2022-07-12 06:39:40,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21711 to 17739. [2022-07-12 06:39:41,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17739 states, 13570 states have (on average 1.2602063375092114) internal successors, (17101), 13692 states have internal predecessors, (17101), 2637 states have call successors, (2637), 1531 states have call predecessors, (2637), 1531 states have return successors, (2637), 2515 states have call predecessors, (2637), 2637 states have call successors, (2637) [2022-07-12 06:39:41,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17739 states to 17739 states and 22375 transitions. [2022-07-12 06:39:41,041 INFO L78 Accepts]: Start accepts. Automaton has 17739 states and 22375 transitions. Word has length 217 [2022-07-12 06:39:41,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:39:41,041 INFO L495 AbstractCegarLoop]: Abstraction has 17739 states and 22375 transitions. [2022-07-12 06:39:41,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 6 states have internal predecessors, (151), 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:41,042 INFO L276 IsEmpty]: Start isEmpty. Operand 17739 states and 22375 transitions. [2022-07-12 06:39:41,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2022-07-12 06:39:41,048 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:39:41,048 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] [2022-07-12 06:39:41,073 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:41,256 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:41,257 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:39:41,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:39:41,257 INFO L85 PathProgramCache]: Analyzing trace with hash -639550038, now seen corresponding path program 1 times [2022-07-12 06:39:41,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:39:41,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509199506] [2022-07-12 06:39:41,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:39:41,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:39:41,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:41,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:39:41,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:41,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 06:39:41,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:41,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 06:39:41,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:41,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 06:39:41,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:41,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 06:39:41,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:41,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 06:39:41,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:41,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 06:39:41,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:41,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-12 06:39:41,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:41,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-12 06:39:41,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:41,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 06:39:41,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:41,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-12 06:39:41,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:41,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-12 06:39:41,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:41,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-12 06:39:41,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:41,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-12 06:39:41,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:41,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-12 06:39:41,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:41,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-12 06:39:41,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:41,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-07-12 06:39:41,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:41,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2022-07-12 06:39:41,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:41,389 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:41,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:39:41,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509199506] [2022-07-12 06:39:41,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509199506] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 06:39:41,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147489221] [2022-07-12 06:39:41,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:39:41,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 06:39:41,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 06:39:41,404 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:41,440 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:41,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:41,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 876 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-12 06:39:41,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 06:39:41,756 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:41,757 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 06:39:41,940 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:41,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [147489221] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 06:39:41,940 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 06:39:41,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 12 [2022-07-12 06:39:41,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434232211] [2022-07-12 06:39:41,941 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 06:39:41,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 06:39:41,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:39:41,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 06:39:41,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-07-12 06:39:41,942 INFO L87 Difference]: Start difference. First operand 17739 states and 22375 transitions. Second operand has 12 states, 12 states have (on average 19.25) internal successors, (231), 11 states have internal predecessors, (231), 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:45,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:39:45,944 INFO L93 Difference]: Finished difference Result 33921 states and 43141 transitions. [2022-07-12 06:39:45,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-12 06:39:45,944 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 19.25) internal successors, (231), 11 states have internal predecessors, (231), 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 223 [2022-07-12 06:39:45,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:39:45,986 INFO L225 Difference]: With dead ends: 33921 [2022-07-12 06:39:45,986 INFO L226 Difference]: Without dead ends: 20736 [2022-07-12 06:39:46,004 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 508 GetRequests, 479 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:46,004 INFO L413 NwaCegarLoop]: 843 mSDtfsCounter, 1333 mSDsluCounter, 3572 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 318 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1345 SdHoareTripleChecker+Valid, 4415 SdHoareTripleChecker+Invalid, 996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 318 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 06:39:46,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1345 Valid, 4415 Invalid, 996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [318 Valid, 678 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 06:39:46,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20736 states. [2022-07-12 06:39:48,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20736 to 17739. [2022-07-12 06:39:48,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17739 states, 13570 states have (on average 1.2562269712601326) internal successors, (17047), 13692 states have internal predecessors, (17047), 2637 states have call successors, (2637), 1531 states have call predecessors, (2637), 1531 states have return successors, (2637), 2515 states have call predecessors, (2637), 2637 states have call successors, (2637) [2022-07-12 06:39:48,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17739 states to 17739 states and 22321 transitions. [2022-07-12 06:39:48,914 INFO L78 Accepts]: Start accepts. Automaton has 17739 states and 22321 transitions. Word has length 223 [2022-07-12 06:39:48,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:39:48,915 INFO L495 AbstractCegarLoop]: Abstraction has 17739 states and 22321 transitions. [2022-07-12 06:39:48,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 19.25) internal successors, (231), 11 states have internal predecessors, (231), 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:48,916 INFO L276 IsEmpty]: Start isEmpty. Operand 17739 states and 22321 transitions. [2022-07-12 06:39:48,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2022-07-12 06:39:48,922 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:39:48,923 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] [2022-07-12 06:39:48,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-12 06:39:49,139 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:49,140 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:39:49,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:39:49,140 INFO L85 PathProgramCache]: Analyzing trace with hash 267578377, now seen corresponding path program 1 times [2022-07-12 06:39:49,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:39:49,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121487104] [2022-07-12 06:39:49,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:39:49,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:39:49,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:49,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 06:39:49,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:49,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-12 06:39:49,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:49,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 06:39:49,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:49,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 06:39:49,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:49,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 06:39:49,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:49,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 06:39:49,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:49,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 06:39:49,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:49,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-12 06:39:49,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:49,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-12 06:39:49,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:49,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 06:39:49,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:49,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-12 06:39:49,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:49,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-12 06:39:49,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:49,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-12 06:39:49,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:49,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-12 06:39:49,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:49,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-12 06:39:49,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:49,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-12 06:39:49,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:49,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-07-12 06:39:49,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:49,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2022-07-12 06:39:49,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 06:39:49,223 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:49,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 06:39:49,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121487104] [2022-07-12 06:39:49,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121487104] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 06:39:49,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 06:39:49,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 06:39:49,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027614195] [2022-07-12 06:39:49,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 06:39:49,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 06:39:49,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 06:39:49,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 06:39:49,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 06:39:49,225 INFO L87 Difference]: Start difference. First operand 17739 states and 22321 transitions. Second operand has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 6 states have internal predecessors, (141), 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:53,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 06:39:53,445 INFO L93 Difference]: Finished difference Result 34536 states and 44573 transitions. [2022-07-12 06:39:53,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 06:39:53,445 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 6 states have internal predecessors, (141), 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 223 [2022-07-12 06:39:53,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 06:39:53,488 INFO L225 Difference]: With dead ends: 34536 [2022-07-12 06:39:53,489 INFO L226 Difference]: Without dead ends: 21888 [2022-07-12 06:39:53,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-07-12 06:39:53,504 INFO L413 NwaCegarLoop]: 610 mSDtfsCounter, 705 mSDsluCounter, 1978 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 708 SdHoareTripleChecker+Valid, 2588 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 06:39:53,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [708 Valid, 2588 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 06:39:53,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21888 states. [2022-07-12 06:39:56,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21888 to 17730. [2022-07-12 06:39:56,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17730 states, 13561 states have (on average 1.2550696851264656) internal successors, (17020), 13683 states have internal predecessors, (17020), 2637 states have call successors, (2637), 1531 states have call predecessors, (2637), 1531 states have return successors, (2637), 2515 states have call predecessors, (2637), 2637 states have call successors, (2637) [2022-07-12 06:39:56,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17730 states to 17730 states and 22294 transitions. [2022-07-12 06:39:56,494 INFO L78 Accepts]: Start accepts. Automaton has 17730 states and 22294 transitions. Word has length 223 [2022-07-12 06:39:56,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 06:39:56,494 INFO L495 AbstractCegarLoop]: Abstraction has 17730 states and 22294 transitions. [2022-07-12 06:39:56,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.142857142857142) internal successors, (141), 6 states have internal predecessors, (141), 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:56,495 INFO L276 IsEmpty]: Start isEmpty. Operand 17730 states and 22294 transitions. [2022-07-12 06:39:56,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2022-07-12 06:39:56,501 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 06:39:56,502 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] [2022-07-12 06:39:56,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-07-12 06:39:56,502 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 06:39:56,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 06:39:56,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1055302569, now seen corresponding path program 1 times [2022-07-12 06:39:56,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 06:39:56,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096490698] [2022-07-12 06:39:56,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 06:39:56,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 06:39:56,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 06:39:56,550 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 06:39:56,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 06:39:56,679 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-12 06:39:56,679 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 06:39:56,680 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 06:39:56,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-07-12 06:39:56,683 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:56,687 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 06:39:56,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 06:39:56 BoogieIcfgContainer [2022-07-12 06:39:56,822 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 06:39:56,823 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 06:39:56,823 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 06:39:56,823 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 06:39:56,824 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:40" (3/4) ... [2022-07-12 06:39:56,825 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-12 06:39:56,972 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 06:39:56,972 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 06:39:56,973 INFO L158 Benchmark]: Toolchain (without parser) took 137759.93ms. Allocated memory was 100.7MB in the beginning and 4.6GB in the end (delta: 4.5GB). Free memory was 71.6MB in the beginning and 3.0GB in the end (delta: -2.9GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2022-07-12 06:39:56,973 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 100.7MB. Free memory is still 59.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 06:39:56,973 INFO L158 Benchmark]: CACSL2BoogieTranslator took 348.80ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 71.3MB in the beginning and 91.0MB in the end (delta: -19.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-12 06:39:56,973 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.98ms. Allocated memory is still 121.6MB. Free memory was 91.0MB in the beginning and 87.7MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-12 06:39:56,973 INFO L158 Benchmark]: Boogie Preprocessor took 34.21ms. Allocated memory is still 121.6MB. Free memory was 87.7MB in the beginning and 85.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 06:39:56,973 INFO L158 Benchmark]: RCFGBuilder took 638.46ms. Allocated memory is still 121.6MB. Free memory was 85.1MB in the beginning and 91.0MB in the end (delta: -5.8MB). Peak memory consumption was 29.1MB. Max. memory is 16.1GB. [2022-07-12 06:39:56,973 INFO L158 Benchmark]: TraceAbstraction took 136537.50ms. Allocated memory was 121.6MB in the beginning and 4.6GB in the end (delta: 4.4GB). Free memory was 90.4MB in the beginning and 3.0GB in the end (delta: -2.9GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2022-07-12 06:39:56,974 INFO L158 Benchmark]: Witness Printer took 149.37ms. Allocated memory is still 4.6GB. Free memory was 3.0GB in the beginning and 3.0GB in the end (delta: 36.2MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2022-07-12 06:39:56,979 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.10ms. Allocated memory is still 100.7MB. Free memory is still 59.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 348.80ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 71.3MB in the beginning and 91.0MB in the end (delta: -19.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.98ms. Allocated memory is still 121.6MB. Free memory was 91.0MB in the beginning and 87.7MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.21ms. Allocated memory is still 121.6MB. Free memory was 87.7MB in the beginning and 85.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 638.46ms. Allocated memory is still 121.6MB. Free memory was 85.1MB in the beginning and 91.0MB in the end (delta: -5.8MB). Peak memory consumption was 29.1MB. Max. memory is 16.1GB. * TraceAbstraction took 136537.50ms. Allocated memory was 121.6MB in the beginning and 4.6GB in the end (delta: 4.4GB). Free memory was 90.4MB in the beginning and 3.0GB in the end (delta: -2.9GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. * Witness Printer took 149.37ms. Allocated memory is still 4.6GB. Free memory was 3.0GB in the beginning and 3.0GB in the end (delta: 36.2MB). 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: 618]: 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 1 [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=-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=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-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=-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=-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=-127, manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new=-127, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-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=-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=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-127, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-127, manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new=-127, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-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=-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=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-127, cs1_old=-1, cs2=0, cs2_new=-127, cs2_old=-1, manual_selection=0, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-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=-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)=-255, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-127, cs1_old=-1, cs2=0, cs2_new=-127, cs2_old=-1, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-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=-127, cs1_old=-1, cs2=0, cs2_new=-127, cs2_old=-1, manual_selection=0, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-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=-127, cs1_old=-1, cs2=0, cs2_new=-127, cs2_old=-1, manual_selection=0, manual_selection_History_0=-127, 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=-127, cs1_old=-1, cs2=0, cs2_new=-127, cs2_old=-1, manual_selection=0, manual_selection_History_0=-127, 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=-127, cs1_old=-1, cs2=0, cs2_new=-127, cs2_old=-1, manual_selection=0, manual_selection_History_0=-127, 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=-127, cs1_old=-1, cs2=0, cs2_new=-127, cs2_old=-1, manual_selection=0, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-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=-127, cs1_old=-1, cs2=0, cs2_new=-127, cs2_old=-1, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-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=-127, cs1_old=-1, cs2=0, cs2_new=-127, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-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=-127, cs1_old=-1, cs2=0, cs2_new=-127, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-127, 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=-127, cs1_old=-1, cs2=0, cs2_new=-127, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-127, 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=-127, cs1_old=-1, cs2=0, cs2_new=-127, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-127, 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=-127, cs1_old=-1, cs2=0, cs2_new=-127, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-127, 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=-127, cs1_old=-1, cs2=0, cs2_new=-127, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-127, 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=-127, cs1_old=-1, cs2=0, cs2_new=-127, cs2_old=-1, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-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=-127, cs1_old=-1, cs2=0, cs2_new=-127, cs2_old=-1, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-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=-127, cs1_old=-1, cs2=0, cs2_new=-127, cs2_old=-1, index=0, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-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=-127, cs1_old=-1, cs2=0, cs2_new=-127, cs2_old=-1, manual_selection_History_0=-127, 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=-127, cs1_old=-1, cs2=0, cs2_new=-127, cs2_old=-1, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-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=-127, cs1_old=-1, cs2=0, cs2_new=-127, cs2_old=-1, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-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=-127, cs1_old=-1, cs2=0, cs2_new=-127, cs2_old=-1, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-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=-127, cs1_old=-1, cs2=0, cs2_new=-127, cs2_old=-1, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-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=-127, cs1_old=-1, cs2=0, cs2_new=-127, cs2_old=-1, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-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=-127, cs1_old=-1, cs2=0, cs2_new=-127, cs2_old=-1, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-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=-127, cs1_old=-1, cs2=0, cs2_new=-127, cs2_old=-1, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-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=-127, cs2=0, cs2_new=-1, cs2_old=-127, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, 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=-127, cs2=0, cs2_new=-1, cs2_old=-127, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, 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=-127, cs2=0, cs2_new=-1, cs2_old=-127, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, 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=-127, cs2=0, cs2_new=-1, cs2_old=-127, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, 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=-127, cs2=0, cs2_new=-1, cs2_old=-127, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, 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=-127, cs2=0, cs2_new=-1, cs2_old=-127, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, 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=-127, cs2=0, cs2_new=-1, cs2_old=-127, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, 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=-127, cs2=0, cs2_new=-1, cs2_old=-127, index=1, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, 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=-127, cs2=0, cs2_new=-1, cs2_old=-127, index=1, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, 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=-127, cs2=0, cs2_new=-1, cs2_old=-127, manual_selection_History_0=-127, 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=-127, cs2=0, cs2_new=-1, cs2_old=-127, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, 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=-127, cs2=0, cs2_new=-1, cs2_old=-127, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, 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=-127, cs2=0, cs2_new=-1, cs2_old=-127, index=1, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, 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=-127, cs2=0, cs2_new=-1, cs2_old=-127, index=1, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, 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=-127, cs2=0, cs2_new=-1, cs2_old=-127, manual_selection_History_0=-127, 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=-127, cs2=0, cs2_new=-1, cs2_old=-127, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, 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=-127, cs2=0, cs2_new=-1, cs2_old=-127, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, 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=-127, cs2=0, cs2_new=-1, cs2_old=-127, index=0, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, 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=-127, cs2=0, cs2_new=-1, cs2_old=-127, manual_selection_History_0=-127, 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=-127, cs2=0, cs2_new=-1, cs2_old=-127, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, 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=-127, cs2=0, cs2_new=-1, cs2_old=-127, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, 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=-127, cs2=0, cs2_new=-1, cs2_old=-127, index=1, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, 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=-127, cs2=0, cs2_new=-1, cs2_old=-127, index=1, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, 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=-127, cs2=0, cs2_new=-1, cs2_old=-127, manual_selection_History_0=-127, 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=-127, cs2=0, cs2_new=-1, cs2_old=-127, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, 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=-127, cs2=0, cs2_new=-1, cs2_old=-127, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, 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=-127, cs2=0, cs2_new=-1, cs2_old=-127, index=1, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, 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=-127, cs2=0, cs2_new=-1, cs2_old=-127, index=1, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, 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=-127, cs2=0, cs2_new=-1, cs2_old=-127, manual_selection_History_0=-127, 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=-127, cs2=0, cs2_new=-1, cs2_old=-127, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, 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=-127, cs2=0, cs2_new=-1, cs2_old=-127, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, 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=-127, cs2=0, cs2_new=-1, cs2_old=-127, index=1, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, 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=-127, cs2=0, cs2_new=-1, cs2_old=-127, index=1, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, 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=-127, cs2=0, cs2_new=-1, cs2_old=-127, manual_selection_History_0=-127, 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=-127, cs2=0, cs2_new=-1, cs2_old=-127, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, 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=-127, cs2=0, cs2_new=-1, cs2_old=-127, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, 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=-127, cs2=0, cs2_new=-1, cs2_old=-127, index=2, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, 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=-127, cs2=0, cs2_new=-1, cs2_old=-127, index=2, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, 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=-127, cs2=0, cs2_new=-1, cs2_old=-127, index=2, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, 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=-127, cs2=0, cs2_new=-1, cs2_old=-127, manual_selection_History_0=-127, 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=-127, cs2=0, cs2_new=-1, cs2_old=-127, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, 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=-127, cs2=0, cs2_new=-1, cs2_old=-127, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, 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=-127, cs2=0, cs2_new=-1, cs2_old=-127, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, 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] [L616] 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=-127, cs2=0, cs2_new=-1, cs2_old=-127, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, 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=-127, cs2=0, cs2_new=-1, cs2_old=-127, i2=0, manual_selection_History_0=-127, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, 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 1 [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=0, active_side_History_1=-2, 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=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=-128] [L257] RET write_manual_selection_history(manual_selection) [L258] EXPR manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-127, cs2=0, cs2_new=-1, cs2_old=-127, manual_selection=-128, manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new=-128, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-128] [L258] cs1_new = manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [L259] EXPR manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-127, cs2=0, cs2_new=-1, cs2_old=-127, manual_selection=-128, manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new=-128, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-128] [L259] cs2_new = manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L260] manual_selection = (msg_t )0 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-127, cs2=0, cs2_new=-128, cs2_old=-127, manual_selection=0, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-128] [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=-128, cs1_old=-127, cs2=0, cs2_new=-128, cs2_old=-127, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, 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=-128, cs1_old=-127, cs2=0, cs2_new=-128, cs2_old=-127, manual_selection=0, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, 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=-128, cs1_old=-127, cs2=0, cs2_new=-128, cs2_old=-127, manual_selection=0, manual_selection_History_0=-128, manual_selection_History_1=-127, 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=-128, cs1_old=-127, cs2=0, cs2_new=-128, cs2_old=-127, manual_selection=0, manual_selection_History_0=-128, manual_selection_History_1=-127, 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=-128, cs1_old=-127, cs2=0, cs2_new=-128, cs2_old=-127, manual_selection=0, manual_selection_History_0=-128, manual_selection_History_1=-127, 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=-128, cs1_old=-127, cs2=0, cs2_new=-128, cs2_old=-127, manual_selection=0, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, 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=-128, cs1_old=-127, cs2=0, cs2_new=-128, cs2_old=-127, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, 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=-128, cs1_old=-127, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-127, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-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=-128, cs1_old=-127, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-127, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-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=-128, cs1_old=-127, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-127, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-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=-128, cs1_old=-127, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-127, manual_selection_History_0=-128, manual_selection_History_1=-127, 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=-128, cs1_old=-127, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-127, manual_selection_History_0=-128, manual_selection_History_1=-127, 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=-128, cs1_old=-127, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-127, manual_selection_History_0=-128, manual_selection_History_1=-127, 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=-128, cs1_old=-127, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-127, manual_selection_History_0=-128, manual_selection_History_1=-127, 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=-128, cs1_old=-127, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-127, manual_selection_History_0=-128, manual_selection_History_1=-127, 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=-128, cs1_old=-127, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-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=-128, cs1_old=-127, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-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=-128, cs1_old=-127, cs2=0, cs2_new=-128, cs2_old=-1, index=0, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-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=-128, cs1_old=-127, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=-127, 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=-128, cs1_old=-127, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-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=-128, cs1_old=-127, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-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=-128, cs1_old=-127, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-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=-128, cs1_old=-127, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-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=-128, cs1_old=-127, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-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=-128, cs1_old=-127, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-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=-128, cs1_old=-127, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, 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=-127, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, read_manual_selection_history((unsigned char)1)=-127, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, 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=-127] [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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-127, 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=-127] [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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, 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=-127, 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-127, 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=-127, 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, 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=-127, 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=0, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-127, 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=-127, 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, 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=-127, 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=0, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-127, 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=-127, 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, 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=-127, 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, 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=-127, 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, 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] [L616] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, 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] [L618] 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-127, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, 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, 206 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 136.3s, OverallIterations: 45, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 86.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 48214 SdHoareTripleChecker+Valid, 21.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 47814 mSDsluCounter, 101168 SdHoareTripleChecker+Invalid, 17.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 80841 mSDsCounter, 17356 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 35625 IncrementalHoareTripleChecker+Invalid, 52981 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17356 mSolverCounterUnsat, 20327 mSDtfsCounter, 35625 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6167 GetRequests, 5275 SyntacticMatches, 18 SemanticMatches, 874 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37896 ImplicationChecksByTransitivity, 9.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19644occurred in iteration=39, InterpolantAutomatonStates: 821, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 36.0s AutomataMinimizationTime, 44 MinimizatonAttempts, 115151 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 8505 NumberOfCodeBlocks, 8505 NumberOfCodeBlocksAsserted, 56 NumberOfCheckSat, 10252 ConstructedInterpolants, 0 QuantifiedInterpolants, 33711 SizeOfPredicates, 35 NumberOfNonLiveVariables, 9099 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:57,011 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