./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cdd691469d2e12c2dd1871c48be4dd2db0b9d27541ac5dee5ff25a04db0d98eb --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 17:42:11,792 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 17:42:11,793 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 17:42:11,832 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 17:42:11,833 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 17:42:11,834 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 17:42:11,836 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 17:42:11,838 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 17:42:11,840 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 17:42:11,845 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 17:42:11,846 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 17:42:11,848 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 17:42:11,848 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 17:42:11,850 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 17:42:11,852 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 17:42:11,855 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 17:42:11,856 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 17:42:11,858 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 17:42:11,859 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 17:42:11,864 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 17:42:11,866 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 17:42:11,867 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 17:42:11,867 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 17:42:11,868 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 17:42:11,869 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 17:42:11,874 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 17:42:11,874 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 17:42:11,874 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 17:42:11,876 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 17:42:11,876 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 17:42:11,877 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 17:42:11,877 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 17:42:11,879 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 17:42:11,879 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 17:42:11,880 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 17:42:11,880 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 17:42:11,881 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 17:42:11,881 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 17:42:11,881 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 17:42:11,882 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 17:42:11,882 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 17:42:11,884 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 17:42:11,885 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 17:42:11,926 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 17:42:11,926 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 17:42:11,926 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 17:42:11,927 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 17:42:11,927 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 17:42:11,927 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 17:42:11,928 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 17:42:11,928 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 17:42:11,928 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 17:42:11,929 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 17:42:11,929 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 17:42:11,929 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 17:42:11,929 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 17:42:11,929 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 17:42:11,929 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 17:42:11,930 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 17:42:11,930 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 17:42:11,930 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 17:42:11,930 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 17:42:11,930 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 17:42:11,930 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 17:42:11,931 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 17:42:11,931 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 17:42:11,943 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 17:42:11,944 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 17:42:11,944 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 17:42:11,944 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 17:42:11,945 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 17:42:11,945 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 17:42:11,945 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 17:42:11,945 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 17:42:11,946 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 17:42:11,946 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 17:42:11,946 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cdd691469d2e12c2dd1871c48be4dd2db0b9d27541ac5dee5ff25a04db0d98eb [2022-07-19 17:42:12,175 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 17:42:12,213 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 17:42:12,215 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 17:42:12,216 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 17:42:12,216 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 17:42:12,217 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c [2022-07-19 17:42:12,270 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb4e73491/1b70ac6fd8f040f8bf7c4962de618b5c/FLAGd441fa64d [2022-07-19 17:42:12,724 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 17:42:12,725 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c [2022-07-19 17:42:12,751 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb4e73491/1b70ac6fd8f040f8bf7c4962de618b5c/FLAGd441fa64d [2022-07-19 17:42:13,255 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb4e73491/1b70ac6fd8f040f8bf7c4962de618b5c [2022-07-19 17:42:13,257 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 17:42:13,258 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 17:42:13,259 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 17:42:13,259 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 17:42:13,262 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 17:42:13,262 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 05:42:13" (1/1) ... [2022-07-19 17:42:13,263 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a5a80dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:42:13, skipping insertion in model container [2022-07-19 17:42:13,264 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 05:42:13" (1/1) ... [2022-07-19 17:42:13,297 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 17:42:13,334 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 17:42:13,514 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c[14702,14715] [2022-07-19 17:42:13,516 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 17:42:13,524 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 17:42:13,580 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c[14702,14715] [2022-07-19 17:42:13,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 17:42:13,594 INFO L208 MainTranslator]: Completed translation [2022-07-19 17:42:13,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:42:13 WrapperNode [2022-07-19 17:42:13,595 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 17:42:13,596 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 17:42:13,596 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 17:42:13,596 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 17:42:13,602 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:42:13" (1/1) ... [2022-07-19 17:42:13,613 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:42:13" (1/1) ... [2022-07-19 17:42:13,662 INFO L137 Inliner]: procedures = 32, calls = 48, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 538 [2022-07-19 17:42:13,664 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 17:42:13,664 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 17:42:13,665 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 17:42:13,665 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 17:42:13,672 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:42:13" (1/1) ... [2022-07-19 17:42:13,672 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:42:13" (1/1) ... [2022-07-19 17:42:13,695 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:42:13" (1/1) ... [2022-07-19 17:42:13,696 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:42:13" (1/1) ... [2022-07-19 17:42:13,706 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:42:13" (1/1) ... [2022-07-19 17:42:13,714 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:42:13" (1/1) ... [2022-07-19 17:42:13,717 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:42:13" (1/1) ... [2022-07-19 17:42:13,721 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 17:42:13,721 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 17:42:13,721 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 17:42:13,722 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 17:42:13,724 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:42:13" (1/1) ... [2022-07-19 17:42:13,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 17:42:13,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:42:13,769 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-19 17:42:13,780 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-19 17:42:13,814 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2022-07-19 17:42:13,814 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2022-07-19 17:42:13,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 17:42:13,814 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2022-07-19 17:42:13,814 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2022-07-19 17:42:13,815 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2022-07-19 17:42:13,815 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2022-07-19 17:42:13,815 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2022-07-19 17:42:13,815 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2022-07-19 17:42:13,815 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-19 17:42:13,815 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-19 17:42:13,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 17:42:13,816 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2022-07-19 17:42:13,816 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2022-07-19 17:42:13,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 17:42:13,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 17:42:13,816 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2022-07-19 17:42:13,816 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2022-07-19 17:42:13,926 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 17:42:13,928 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 17:42:14,375 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 17:42:14,382 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 17:42:14,382 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-19 17:42:14,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 05:42:14 BoogieIcfgContainer [2022-07-19 17:42:14,385 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 17:42:14,386 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 17:42:14,386 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 17:42:14,389 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 17:42:14,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 05:42:13" (1/3) ... [2022-07-19 17:42:14,390 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a4ddd4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 05:42:14, skipping insertion in model container [2022-07-19 17:42:14,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 05:42:13" (2/3) ... [2022-07-19 17:42:14,390 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a4ddd4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 05:42:14, skipping insertion in model container [2022-07-19 17:42:14,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 05:42:14" (3/3) ... [2022-07-19 17:42:14,392 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_2.ufo.BOUNDED-10.pals.c [2022-07-19 17:42:14,404 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 17:42:14,404 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 17:42:14,457 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 17:42:14,463 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@679441fc, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@b3de449 [2022-07-19 17:42:14,463 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 17:42:14,469 INFO L276 IsEmpty]: Start isEmpty. Operand has 207 states, 167 states have (on average 1.5508982035928143) internal successors, (259), 168 states have internal predecessors, (259), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-07-19 17:42:14,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-19 17:42:14,491 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:42:14,491 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-19 17:42:14,492 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:42:14,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:42:14,497 INFO L85 PathProgramCache]: Analyzing trace with hash -518679476, now seen corresponding path program 1 times [2022-07-19 17:42:14,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:42:14,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544816318] [2022-07-19 17:42:14,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:42:14,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:42:14,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:14,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 17:42:14,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:14,722 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-19 17:42:14,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:42:14,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544816318] [2022-07-19 17:42:14,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544816318] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:42:14,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:42:14,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 17:42:14,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635056877] [2022-07-19 17:42:14,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:42:14,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-19 17:42:14,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:42:14,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-19 17:42:14,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 17:42:14,757 INFO L87 Difference]: Start difference. First operand has 207 states, 167 states have (on average 1.5508982035928143) internal successors, (259), 168 states have internal predecessors, (259), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 17:42:14,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:42:14,831 INFO L93 Difference]: Finished difference Result 398 states and 642 transitions. [2022-07-19 17:42:14,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-19 17:42:14,833 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-19 17:42:14,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:42:14,844 INFO L225 Difference]: With dead ends: 398 [2022-07-19 17:42:14,844 INFO L226 Difference]: Without dead ends: 203 [2022-07-19 17:42:14,848 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-19 17:42:14,851 INFO L413 NwaCegarLoop]: 312 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 17:42:14,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 17:42:14,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-07-19 17:42:14,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2022-07-19 17:42:14,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 164 states have (on average 1.5) internal successors, (246), 164 states have internal predecessors, (246), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-07-19 17:42:14,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 308 transitions. [2022-07-19 17:42:14,913 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 308 transitions. Word has length 44 [2022-07-19 17:42:14,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:42:14,914 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 308 transitions. [2022-07-19 17:42:14,914 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-19 17:42:14,914 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 308 transitions. [2022-07-19 17:42:14,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-19 17:42:14,916 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:42:14,916 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-19 17:42:14,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 17:42:14,917 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:42:14,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:42:14,918 INFO L85 PathProgramCache]: Analyzing trace with hash -527444980, now seen corresponding path program 1 times [2022-07-19 17:42:14,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:42:14,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345073350] [2022-07-19 17:42:14,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:42:14,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:42:14,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:15,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 17:42:15,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:15,066 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-19 17:42:15,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:42:15,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345073350] [2022-07-19 17:42:15,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345073350] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:42:15,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:42:15,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 17:42:15,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756058020] [2022-07-19 17:42:15,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:42:15,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 17:42:15,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:42:15,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 17:42:15,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 17:42:15,072 INFO L87 Difference]: Start difference. First operand 203 states and 308 transitions. Second operand has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 17:42:15,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:42:15,213 INFO L93 Difference]: Finished difference Result 531 states and 811 transitions. [2022-07-19 17:42:15,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 17:42:15,215 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-19 17:42:15,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:42:15,218 INFO L225 Difference]: With dead ends: 531 [2022-07-19 17:42:15,221 INFO L226 Difference]: Without dead ends: 342 [2022-07-19 17:42:15,223 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-19 17:42:15,228 INFO L413 NwaCegarLoop]: 327 mSDtfsCounter, 171 mSDsluCounter, 1257 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 1584 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 17:42:15,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 1584 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 17:42:15,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2022-07-19 17:42:15,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 203. [2022-07-19 17:42:15,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 164 states have (on average 1.4268292682926829) internal successors, (234), 164 states have internal predecessors, (234), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-07-19 17:42:15,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 296 transitions. [2022-07-19 17:42:15,271 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 296 transitions. Word has length 44 [2022-07-19 17:42:15,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:42:15,272 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 296 transitions. [2022-07-19 17:42:15,273 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-19 17:42:15,273 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 296 transitions. [2022-07-19 17:42:15,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-19 17:42:15,276 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:42:15,276 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-19 17:42:15,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 17:42:15,277 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:42:15,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:42:15,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1202945359, now seen corresponding path program 1 times [2022-07-19 17:42:15,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:42:15,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141126364] [2022-07-19 17:42:15,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:42:15,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:42:15,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:15,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 17:42:15,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:15,450 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-19 17:42:15,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:42:15,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141126364] [2022-07-19 17:42:15,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141126364] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:42:15,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:42:15,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 17:42:15,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722485334] [2022-07-19 17:42:15,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:42:15,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 17:42:15,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:42:15,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 17:42:15,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 17:42:15,455 INFO L87 Difference]: Start difference. First operand 203 states and 296 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 17:42:15,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:42:15,506 INFO L93 Difference]: Finished difference Result 393 states and 582 transitions. [2022-07-19 17:42:15,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 17:42:15,506 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-19 17:42:15,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:42:15,509 INFO L225 Difference]: With dead ends: 393 [2022-07-19 17:42:15,509 INFO L226 Difference]: Without dead ends: 207 [2022-07-19 17:42:15,511 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-19 17:42:15,516 INFO L413 NwaCegarLoop]: 290 mSDtfsCounter, 5 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 860 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 17:42:15,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 860 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 17:42:15,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-07-19 17:42:15,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2022-07-19 17:42:15,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 167 states have (on average 1.4191616766467066) internal successors, (237), 167 states have internal predecessors, (237), 31 states have call successors, (31), 8 states have call predecessors, (31), 8 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-07-19 17:42:15,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 299 transitions. [2022-07-19 17:42:15,532 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 299 transitions. Word has length 55 [2022-07-19 17:42:15,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:42:15,533 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 299 transitions. [2022-07-19 17:42:15,540 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-19 17:42:15,540 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 299 transitions. [2022-07-19 17:42:15,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-19 17:42:15,542 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:42:15,542 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-19 17:42:15,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 17:42:15,542 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:42:15,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:42:15,543 INFO L85 PathProgramCache]: Analyzing trace with hash -915994749, now seen corresponding path program 1 times [2022-07-19 17:42:15,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:42:15,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153423527] [2022-07-19 17:42:15,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:42:15,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:42:15,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:15,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 17:42:15,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:15,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-19 17:42:15,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:15,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-19 17:42:15,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:15,620 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-19 17:42:15,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:42:15,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153423527] [2022-07-19 17:42:15,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153423527] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:42:15,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:42:15,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 17:42:15,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870443917] [2022-07-19 17:42:15,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:42:15,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 17:42:15,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:42:15,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 17:42:15,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 17:42:15,623 INFO L87 Difference]: Start difference. First operand 207 states and 299 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-19 17:42:15,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:42:15,665 INFO L93 Difference]: Finished difference Result 564 states and 826 transitions. [2022-07-19 17:42:15,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 17:42:15,666 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-19 17:42:15,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:42:15,673 INFO L225 Difference]: With dead ends: 564 [2022-07-19 17:42:15,673 INFO L226 Difference]: Without dead ends: 374 [2022-07-19 17:42:15,674 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-19 17:42:15,683 INFO L413 NwaCegarLoop]: 341 mSDtfsCounter, 227 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 17:42:15,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 622 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 17:42:15,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2022-07-19 17:42:15,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 364. [2022-07-19 17:42:15,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 287 states have (on average 1.4390243902439024) internal successors, (413), 288 states have internal predecessors, (413), 60 states have call successors, (60), 16 states have call predecessors, (60), 16 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2022-07-19 17:42:15,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 533 transitions. [2022-07-19 17:42:15,724 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 533 transitions. Word has length 71 [2022-07-19 17:42:15,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:42:15,724 INFO L495 AbstractCegarLoop]: Abstraction has 364 states and 533 transitions. [2022-07-19 17:42:15,724 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-19 17:42:15,725 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 533 transitions. [2022-07-19 17:42:15,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-19 17:42:15,732 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:42:15,733 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-19 17:42:15,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 17:42:15,734 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:42:15,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:42:15,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1756914315, now seen corresponding path program 1 times [2022-07-19 17:42:15,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:42:15,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774416946] [2022-07-19 17:42:15,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:42:15,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:42:15,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:15,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 17:42:15,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:15,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-19 17:42:15,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:15,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-19 17:42:15,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:15,834 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-19 17:42:15,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:42:15,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774416946] [2022-07-19 17:42:15,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774416946] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:42:15,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:42:15,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 17:42:15,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929896729] [2022-07-19 17:42:15,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:42:15,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 17:42:15,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:42:15,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 17:42:15,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 17:42:15,839 INFO L87 Difference]: Start difference. First operand 364 states and 533 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-19 17:42:15,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:42:15,886 INFO L93 Difference]: Finished difference Result 1009 states and 1492 transitions. [2022-07-19 17:42:15,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 17:42:15,887 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-19 17:42:15,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:42:15,894 INFO L225 Difference]: With dead ends: 1009 [2022-07-19 17:42:15,894 INFO L226 Difference]: Without dead ends: 662 [2022-07-19 17:42:15,896 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-19 17:42:15,897 INFO L413 NwaCegarLoop]: 374 mSDtfsCounter, 235 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 17:42:15,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 657 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 17:42:15,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2022-07-19 17:42:15,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 645. [2022-07-19 17:42:15,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 496 states have (on average 1.4576612903225807) internal successors, (723), 499 states have internal predecessors, (723), 117 states have call successors, (117), 31 states have call predecessors, (117), 31 states have return successors, (117), 114 states have call predecessors, (117), 117 states have call successors, (117) [2022-07-19 17:42:15,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 957 transitions. [2022-07-19 17:42:15,964 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 957 transitions. Word has length 72 [2022-07-19 17:42:15,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:42:15,966 INFO L495 AbstractCegarLoop]: Abstraction has 645 states and 957 transitions. [2022-07-19 17:42:15,966 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-19 17:42:15,966 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 957 transitions. [2022-07-19 17:42:15,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-19 17:42:15,969 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:42:15,969 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-19 17:42:15,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-19 17:42:15,970 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:42:15,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:42:15,970 INFO L85 PathProgramCache]: Analyzing trace with hash 477050637, now seen corresponding path program 1 times [2022-07-19 17:42:15,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:42:15,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794517450] [2022-07-19 17:42:15,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:42:15,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:42:16,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:16,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 17:42:16,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:16,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-19 17:42:16,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:16,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-19 17:42:16,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:16,081 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-19 17:42:16,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:42:16,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794517450] [2022-07-19 17:42:16,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794517450] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:42:16,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:42:16,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 17:42:16,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477981894] [2022-07-19 17:42:16,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:42:16,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 17:42:16,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:42:16,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 17:42:16,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 17:42:16,082 INFO L87 Difference]: Start difference. First operand 645 states and 957 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-19 17:42:16,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:42:16,414 INFO L93 Difference]: Finished difference Result 1805 states and 2723 transitions. [2022-07-19 17:42:16,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 17:42:16,415 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-19 17:42:16,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:42:16,423 INFO L225 Difference]: With dead ends: 1805 [2022-07-19 17:42:16,423 INFO L226 Difference]: Without dead ends: 1177 [2022-07-19 17:42:16,425 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-19 17:42:16,426 INFO L413 NwaCegarLoop]: 289 mSDtfsCounter, 786 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 786 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 17:42:16,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [786 Valid, 778 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 17:42:16,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2022-07-19 17:42:16,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 770. [2022-07-19 17:42:16,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 770 states, 608 states have (on average 1.4358552631578947) internal successors, (873), 611 states have internal predecessors, (873), 124 states have call successors, (124), 37 states have call predecessors, (124), 37 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2022-07-19 17:42:16,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1121 transitions. [2022-07-19 17:42:16,490 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1121 transitions. Word has length 72 [2022-07-19 17:42:16,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:42:16,491 INFO L495 AbstractCegarLoop]: Abstraction has 770 states and 1121 transitions. [2022-07-19 17:42:16,491 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-19 17:42:16,491 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1121 transitions. [2022-07-19 17:42:16,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-07-19 17:42:16,493 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:42:16,493 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-19 17:42:16,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-19 17:42:16,494 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:42:16,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:42:16,494 INFO L85 PathProgramCache]: Analyzing trace with hash -221882142, now seen corresponding path program 1 times [2022-07-19 17:42:16,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:42:16,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741460218] [2022-07-19 17:42:16,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:42:16,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:42:16,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:16,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 17:42:16,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:16,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-19 17:42:16,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:16,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-19 17:42:16,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:16,578 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-19 17:42:16,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:42:16,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741460218] [2022-07-19 17:42:16,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741460218] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:42:16,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:42:16,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 17:42:16,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029227587] [2022-07-19 17:42:16,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:42:16,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 17:42:16,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:42:16,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 17:42:16,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 17:42:16,581 INFO L87 Difference]: Start difference. First operand 770 states and 1121 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-19 17:42:16,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:42:16,896 INFO L93 Difference]: Finished difference Result 1809 states and 2723 transitions. [2022-07-19 17:42:16,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 17:42:16,897 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-19 17:42:16,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:42:16,905 INFO L225 Difference]: With dead ends: 1809 [2022-07-19 17:42:16,905 INFO L226 Difference]: Without dead ends: 1181 [2022-07-19 17:42:16,908 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-19 17:42:16,909 INFO L413 NwaCegarLoop]: 289 mSDtfsCounter, 783 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 783 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 17:42:16,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [783 Valid, 780 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 17:42:16,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2022-07-19 17:42:16,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 778. [2022-07-19 17:42:16,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 778 states, 616 states have (on average 1.4301948051948052) internal successors, (881), 619 states have internal predecessors, (881), 124 states have call successors, (124), 37 states have call predecessors, (124), 37 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2022-07-19 17:42:16,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1129 transitions. [2022-07-19 17:42:16,978 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1129 transitions. Word has length 73 [2022-07-19 17:42:16,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:42:16,980 INFO L495 AbstractCegarLoop]: Abstraction has 778 states and 1129 transitions. [2022-07-19 17:42:16,980 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-19 17:42:16,980 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1129 transitions. [2022-07-19 17:42:16,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-07-19 17:42:16,981 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:42:16,982 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-19 17:42:16,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-19 17:42:16,987 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:42:16,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:42:16,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1379275244, now seen corresponding path program 1 times [2022-07-19 17:42:16,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:42:16,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950261196] [2022-07-19 17:42:16,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:42:16,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:42:17,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:17,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 17:42:17,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:17,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-19 17:42:17,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:17,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-19 17:42:17,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:17,098 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-19 17:42:17,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:42:17,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950261196] [2022-07-19 17:42:17,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950261196] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:42:17,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:42:17,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 17:42:17,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355255027] [2022-07-19 17:42:17,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:42:17,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 17:42:17,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:42:17,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 17:42:17,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 17:42:17,102 INFO L87 Difference]: Start difference. First operand 778 states and 1129 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-19 17:42:17,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:42:17,382 INFO L93 Difference]: Finished difference Result 1809 states and 2715 transitions. [2022-07-19 17:42:17,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 17:42:17,382 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-19 17:42:17,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:42:17,390 INFO L225 Difference]: With dead ends: 1809 [2022-07-19 17:42:17,390 INFO L226 Difference]: Without dead ends: 1181 [2022-07-19 17:42:17,392 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-19 17:42:17,393 INFO L413 NwaCegarLoop]: 315 mSDtfsCounter, 238 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 17:42:17,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 747 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 17:42:17,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2022-07-19 17:42:17,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 778. [2022-07-19 17:42:17,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 778 states, 616 states have (on average 1.4237012987012987) internal successors, (877), 619 states have internal predecessors, (877), 124 states have call successors, (124), 37 states have call predecessors, (124), 37 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2022-07-19 17:42:17,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1125 transitions. [2022-07-19 17:42:17,462 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1125 transitions. Word has length 75 [2022-07-19 17:42:17,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:42:17,462 INFO L495 AbstractCegarLoop]: Abstraction has 778 states and 1125 transitions. [2022-07-19 17:42:17,463 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-19 17:42:17,463 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1125 transitions. [2022-07-19 17:42:17,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-19 17:42:17,464 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:42:17,464 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-19 17:42:17,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-19 17:42:17,465 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:42:17,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:42:17,465 INFO L85 PathProgramCache]: Analyzing trace with hash -156149797, now seen corresponding path program 1 times [2022-07-19 17:42:17,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:42:17,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816164892] [2022-07-19 17:42:17,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:42:17,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:42:17,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:17,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 17:42:17,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:17,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-19 17:42:17,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:17,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-19 17:42:17,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:17,553 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-19 17:42:17,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:42:17,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816164892] [2022-07-19 17:42:17,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816164892] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:42:17,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:42:17,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 17:42:17,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899925379] [2022-07-19 17:42:17,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:42:17,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 17:42:17,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:42:17,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 17:42:17,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 17:42:17,555 INFO L87 Difference]: Start difference. First operand 778 states and 1125 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 17:42:17,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:42:17,623 INFO L93 Difference]: Finished difference Result 1426 states and 2092 transitions. [2022-07-19 17:42:17,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 17:42:17,623 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-19 17:42:17,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:42:17,628 INFO L225 Difference]: With dead ends: 1426 [2022-07-19 17:42:17,628 INFO L226 Difference]: Without dead ends: 798 [2022-07-19 17:42:17,630 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-19 17:42:17,630 INFO L413 NwaCegarLoop]: 292 mSDtfsCounter, 6 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 17:42:17,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 872 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 17:42:17,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2022-07-19 17:42:17,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 798. [2022-07-19 17:42:17,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 632 states have (on average 1.4129746835443038) internal successors, (893), 635 states have internal predecessors, (893), 124 states have call successors, (124), 41 states have call predecessors, (124), 41 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2022-07-19 17:42:17,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1141 transitions. [2022-07-19 17:42:17,683 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 1141 transitions. Word has length 76 [2022-07-19 17:42:17,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:42:17,683 INFO L495 AbstractCegarLoop]: Abstraction has 798 states and 1141 transitions. [2022-07-19 17:42:17,683 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-19 17:42:17,684 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1141 transitions. [2022-07-19 17:42:17,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-19 17:42:17,685 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:42:17,685 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-19 17:42:17,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-19 17:42:17,686 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:42:17,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:42:17,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1992242591, now seen corresponding path program 1 times [2022-07-19 17:42:17,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:42:17,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124646128] [2022-07-19 17:42:17,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:42:17,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:42:17,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:17,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 17:42:17,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:17,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-19 17:42:17,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:17,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-19 17:42:17,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:17,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-19 17:42:17,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:17,754 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-19 17:42:17,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:42:17,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124646128] [2022-07-19 17:42:17,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124646128] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:42:17,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:42:17,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 17:42:17,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943988344] [2022-07-19 17:42:17,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:42:17,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 17:42:17,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:42:17,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 17:42:17,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 17:42:17,763 INFO L87 Difference]: Start difference. First operand 798 states and 1141 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-19 17:42:17,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:42:17,838 INFO L93 Difference]: Finished difference Result 1466 states and 2136 transitions. [2022-07-19 17:42:17,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 17:42:17,838 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-19 17:42:17,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:42:17,842 INFO L225 Difference]: With dead ends: 1466 [2022-07-19 17:42:17,842 INFO L226 Difference]: Without dead ends: 818 [2022-07-19 17:42:17,845 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-19 17:42:17,845 INFO L413 NwaCegarLoop]: 289 mSDtfsCounter, 6 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 17:42:17,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 858 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 17:42:17,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2022-07-19 17:42:17,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 818. [2022-07-19 17:42:17,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 648 states have (on average 1.4027777777777777) internal successors, (909), 651 states have internal predecessors, (909), 124 states have call successors, (124), 45 states have call predecessors, (124), 45 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2022-07-19 17:42:17,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1157 transitions. [2022-07-19 17:42:17,898 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1157 transitions. Word has length 84 [2022-07-19 17:42:17,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:42:17,898 INFO L495 AbstractCegarLoop]: Abstraction has 818 states and 1157 transitions. [2022-07-19 17:42:17,899 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-19 17:42:17,899 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1157 transitions. [2022-07-19 17:42:17,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-07-19 17:42:17,900 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:42:17,901 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-19 17:42:17,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-19 17:42:17,901 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:42:17,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:42:17,902 INFO L85 PathProgramCache]: Analyzing trace with hash -115565173, now seen corresponding path program 1 times [2022-07-19 17:42:17,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:42:17,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117599121] [2022-07-19 17:42:17,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:42:17,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:42:17,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:17,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 17:42:17,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:17,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-19 17:42:17,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:17,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-19 17:42:17,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:17,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-19 17:42:17,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:17,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-19 17:42:17,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:17,960 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-19 17:42:17,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:42:17,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117599121] [2022-07-19 17:42:17,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117599121] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:42:17,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:42:17,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 17:42:17,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955137065] [2022-07-19 17:42:17,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:42:17,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 17:42:17,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:42:17,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 17:42:17,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 17:42:17,963 INFO L87 Difference]: Start difference. First operand 818 states and 1157 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-07-19 17:42:18,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:42:18,040 INFO L93 Difference]: Finished difference Result 1502 states and 2152 transitions. [2022-07-19 17:42:18,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 17:42:18,041 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-19 17:42:18,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:42:18,045 INFO L225 Difference]: With dead ends: 1502 [2022-07-19 17:42:18,045 INFO L226 Difference]: Without dead ends: 834 [2022-07-19 17:42:18,047 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-19 17:42:18,048 INFO L413 NwaCegarLoop]: 294 mSDtfsCounter, 5 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 17:42:18,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 867 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 17:42:18,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2022-07-19 17:42:18,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 834. [2022-07-19 17:42:18,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 834 states, 660 states have (on average 1.3954545454545455) internal successors, (921), 663 states have internal predecessors, (921), 124 states have call successors, (124), 49 states have call predecessors, (124), 49 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2022-07-19 17:42:18,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1169 transitions. [2022-07-19 17:42:18,098 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1169 transitions. Word has length 92 [2022-07-19 17:42:18,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:42:18,099 INFO L495 AbstractCegarLoop]: Abstraction has 834 states and 1169 transitions. [2022-07-19 17:42:18,099 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-19 17:42:18,099 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1169 transitions. [2022-07-19 17:42:18,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-07-19 17:42:18,101 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:42:18,101 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-19 17:42:18,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-19 17:42:18,101 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:42:18,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:42:18,102 INFO L85 PathProgramCache]: Analyzing trace with hash -2014073166, now seen corresponding path program 1 times [2022-07-19 17:42:18,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:42:18,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874145534] [2022-07-19 17:42:18,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:42:18,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:42:18,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:18,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 17:42:18,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:18,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-19 17:42:18,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:18,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-19 17:42:18,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:18,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-19 17:42:18,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:18,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-19 17:42:18,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:18,177 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-19 17:42:18,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:42:18,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874145534] [2022-07-19 17:42:18,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874145534] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:42:18,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:42:18,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 17:42:18,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110141126] [2022-07-19 17:42:18,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:42:18,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 17:42:18,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:42:18,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 17:42:18,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 17:42:18,179 INFO L87 Difference]: Start difference. First operand 834 states and 1169 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-07-19 17:42:18,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:42:18,260 INFO L93 Difference]: Finished difference Result 1538 states and 2192 transitions. [2022-07-19 17:42:18,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 17:42:18,261 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-19 17:42:18,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:42:18,265 INFO L225 Difference]: With dead ends: 1538 [2022-07-19 17:42:18,265 INFO L226 Difference]: Without dead ends: 854 [2022-07-19 17:42:18,267 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-19 17:42:18,267 INFO L413 NwaCegarLoop]: 289 mSDtfsCounter, 6 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 17:42:18,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 858 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 17:42:18,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2022-07-19 17:42:18,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 854. [2022-07-19 17:42:18,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 854 states, 676 states have (on average 1.386094674556213) internal successors, (937), 679 states have internal predecessors, (937), 124 states have call successors, (124), 53 states have call predecessors, (124), 53 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2022-07-19 17:42:18,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 1185 transitions. [2022-07-19 17:42:18,319 INFO L78 Accepts]: Start accepts. Automaton has 854 states and 1185 transitions. Word has length 92 [2022-07-19 17:42:18,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:42:18,319 INFO L495 AbstractCegarLoop]: Abstraction has 854 states and 1185 transitions. [2022-07-19 17:42:18,320 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-19 17:42:18,320 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1185 transitions. [2022-07-19 17:42:18,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-19 17:42:18,322 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:42:18,322 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-19 17:42:18,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-19 17:42:18,322 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:42:18,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:42:18,323 INFO L85 PathProgramCache]: Analyzing trace with hash -794519374, now seen corresponding path program 1 times [2022-07-19 17:42:18,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:42:18,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387646412] [2022-07-19 17:42:18,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:42:18,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:42:18,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:18,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 17:42:18,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:18,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-19 17:42:18,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:18,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-19 17:42:18,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:18,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-19 17:42:18,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:18,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-19 17:42:18,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:18,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-19 17:42:18,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:18,398 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-19 17:42:18,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:42:18,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387646412] [2022-07-19 17:42:18,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387646412] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:42:18,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:42:18,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 17:42:18,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559962107] [2022-07-19 17:42:18,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:42:18,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 17:42:18,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:42:18,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 17:42:18,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 17:42:18,400 INFO L87 Difference]: Start difference. First operand 854 states and 1185 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-19 17:42:18,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:42:18,468 INFO L93 Difference]: Finished difference Result 1582 states and 2220 transitions. [2022-07-19 17:42:18,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 17:42:18,469 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-19 17:42:18,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:42:18,473 INFO L225 Difference]: With dead ends: 1582 [2022-07-19 17:42:18,473 INFO L226 Difference]: Without dead ends: 878 [2022-07-19 17:42:18,475 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-19 17:42:18,476 INFO L413 NwaCegarLoop]: 293 mSDtfsCounter, 7 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 17:42:18,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 869 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 17:42:18,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2022-07-19 17:42:18,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 878. [2022-07-19 17:42:18,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 878 states, 696 states have (on average 1.375) internal successors, (957), 699 states have internal predecessors, (957), 124 states have call successors, (124), 57 states have call predecessors, (124), 57 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2022-07-19 17:42:18,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1205 transitions. [2022-07-19 17:42:18,553 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1205 transitions. Word has length 100 [2022-07-19 17:42:18,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:42:18,554 INFO L495 AbstractCegarLoop]: Abstraction has 878 states and 1205 transitions. [2022-07-19 17:42:18,554 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-19 17:42:18,554 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1205 transitions. [2022-07-19 17:42:18,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-07-19 17:42:18,556 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:42:18,556 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-19 17:42:18,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-19 17:42:18,557 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:42:18,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:42:18,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1401758325, now seen corresponding path program 1 times [2022-07-19 17:42:18,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:42:18,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794111920] [2022-07-19 17:42:18,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:42:18,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:42:18,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:18,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 17:42:18,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:18,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-19 17:42:18,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:18,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-19 17:42:18,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:18,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-19 17:42:18,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:18,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-19 17:42:18,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:18,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-19 17:42:18,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:18,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-19 17:42:18,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:18,674 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-19 17:42:18,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:42:18,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794111920] [2022-07-19 17:42:18,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794111920] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:42:18,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:42:18,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 17:42:18,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115314204] [2022-07-19 17:42:18,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:42:18,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 17:42:18,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:42:18,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 17:42:18,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-19 17:42:18,676 INFO L87 Difference]: Start difference. First operand 878 states and 1205 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 6 states have internal predecessors, (82), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-19 17:42:18,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:42:18,961 INFO L93 Difference]: Finished difference Result 2499 states and 3487 transitions. [2022-07-19 17:42:18,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 17:42:18,962 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-19 17:42:18,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:42:18,969 INFO L225 Difference]: With dead ends: 2499 [2022-07-19 17:42:18,969 INFO L226 Difference]: Without dead ends: 1771 [2022-07-19 17:42:18,971 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-19 17:42:18,972 INFO L413 NwaCegarLoop]: 419 mSDtfsCounter, 395 mSDsluCounter, 1893 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 2312 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 17:42:18,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 2312 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 17:42:18,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1771 states. [2022-07-19 17:42:19,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1771 to 1162. [2022-07-19 17:42:19,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1162 states, 907 states have (on average 1.3660418963616316) internal successors, (1239), 912 states have internal predecessors, (1239), 172 states have call successors, (172), 82 states have call predecessors, (172), 82 states have return successors, (172), 167 states have call predecessors, (172), 172 states have call successors, (172) [2022-07-19 17:42:19,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 1162 states and 1583 transitions. [2022-07-19 17:42:19,063 INFO L78 Accepts]: Start accepts. Automaton has 1162 states and 1583 transitions. Word has length 103 [2022-07-19 17:42:19,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:42:19,064 INFO L495 AbstractCegarLoop]: Abstraction has 1162 states and 1583 transitions. [2022-07-19 17:42:19,064 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-19 17:42:19,064 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 1583 transitions. [2022-07-19 17:42:19,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-19 17:42:19,066 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:42:19,066 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-19 17:42:19,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-19 17:42:19,066 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:42:19,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:42:19,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1324741963, now seen corresponding path program 1 times [2022-07-19 17:42:19,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:42:19,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732565463] [2022-07-19 17:42:19,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:42:19,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:42:19,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:19,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 17:42:19,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:19,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-19 17:42:19,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:19,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-19 17:42:19,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:19,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-19 17:42:19,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:19,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-19 17:42:19,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:19,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-19 17:42:19,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:19,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-19 17:42:19,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:19,127 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-19 17:42:19,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:42:19,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732565463] [2022-07-19 17:42:19,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732565463] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:42:19,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:42:19,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 17:42:19,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229365831] [2022-07-19 17:42:19,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:42:19,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 17:42:19,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:42:19,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 17:42:19,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 17:42:19,129 INFO L87 Difference]: Start difference. First operand 1162 states and 1583 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-19 17:42:19,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:42:19,223 INFO L93 Difference]: Finished difference Result 2130 states and 2928 transitions. [2022-07-19 17:42:19,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 17:42:19,224 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-19 17:42:19,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:42:19,229 INFO L225 Difference]: With dead ends: 2130 [2022-07-19 17:42:19,230 INFO L226 Difference]: Without dead ends: 1186 [2022-07-19 17:42:19,232 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-19 17:42:19,233 INFO L413 NwaCegarLoop]: 294 mSDtfsCounter, 5 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 17:42:19,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 867 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 17:42:19,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2022-07-19 17:42:19,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 1186. [2022-07-19 17:42:19,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1186 states, 925 states have (on average 1.358918918918919) internal successors, (1257), 930 states have internal predecessors, (1257), 172 states have call successors, (172), 88 states have call predecessors, (172), 88 states have return successors, (172), 167 states have call predecessors, (172), 172 states have call successors, (172) [2022-07-19 17:42:19,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 1601 transitions. [2022-07-19 17:42:19,317 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 1601 transitions. Word has length 107 [2022-07-19 17:42:19,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:42:19,317 INFO L495 AbstractCegarLoop]: Abstraction has 1186 states and 1601 transitions. [2022-07-19 17:42:19,317 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-19 17:42:19,317 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 1601 transitions. [2022-07-19 17:42:19,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-19 17:42:19,319 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:42:19,319 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-19 17:42:19,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-19 17:42:19,319 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:42:19,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:42:19,320 INFO L85 PathProgramCache]: Analyzing trace with hash 682815691, now seen corresponding path program 1 times [2022-07-19 17:42:19,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:42:19,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920270031] [2022-07-19 17:42:19,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:42:19,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:42:19,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:19,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 17:42:19,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:19,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-19 17:42:19,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:19,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-19 17:42:19,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:19,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-19 17:42:19,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:19,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-19 17:42:19,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:19,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-19 17:42:19,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:19,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-19 17:42:19,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:19,408 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-19 17:42:19,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:42:19,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920270031] [2022-07-19 17:42:19,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920270031] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:42:19,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:42:19,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 17:42:19,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138162820] [2022-07-19 17:42:19,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:42:19,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 17:42:19,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:42:19,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 17:42:19,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 17:42:19,410 INFO L87 Difference]: Start difference. First operand 1186 states and 1601 transitions. Second operand has 6 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-19 17:42:19,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:42:19,572 INFO L93 Difference]: Finished difference Result 1659 states and 2347 transitions. [2022-07-19 17:42:19,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 17:42:19,573 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-19 17:42:19,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:42:19,581 INFO L225 Difference]: With dead ends: 1659 [2022-07-19 17:42:19,581 INFO L226 Difference]: Without dead ends: 1657 [2022-07-19 17:42:19,582 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-19 17:42:19,582 INFO L413 NwaCegarLoop]: 517 mSDtfsCounter, 263 mSDsluCounter, 1742 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 2259 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 17:42:19,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 2259 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 17:42:19,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1657 states. [2022-07-19 17:42:19,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1657 to 1194. [2022-07-19 17:42:19,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1194 states, 929 states have (on average 1.3573735199138859) internal successors, (1261), 936 states have internal predecessors, (1261), 174 states have call successors, (174), 90 states have call predecessors, (174), 90 states have return successors, (174), 167 states have call predecessors, (174), 174 states have call successors, (174) [2022-07-19 17:42:19,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1194 states to 1194 states and 1609 transitions. [2022-07-19 17:42:19,706 INFO L78 Accepts]: Start accepts. Automaton has 1194 states and 1609 transitions. Word has length 106 [2022-07-19 17:42:19,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:42:19,706 INFO L495 AbstractCegarLoop]: Abstraction has 1194 states and 1609 transitions. [2022-07-19 17:42:19,706 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-19 17:42:19,707 INFO L276 IsEmpty]: Start isEmpty. Operand 1194 states and 1609 transitions. [2022-07-19 17:42:19,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-07-19 17:42:19,708 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:42:19,709 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-19 17:42:19,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-19 17:42:19,709 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:42:19,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:42:19,710 INFO L85 PathProgramCache]: Analyzing trace with hash -614162587, now seen corresponding path program 1 times [2022-07-19 17:42:19,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:42:19,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176867826] [2022-07-19 17:42:19,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:42:19,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:42:19,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:19,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 17:42:19,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:19,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-19 17:42:19,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:19,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-19 17:42:19,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:19,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-19 17:42:19,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:19,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-19 17:42:19,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:19,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-19 17:42:19,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:19,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-19 17:42:19,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:19,798 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-19 17:42:19,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:42:19,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176867826] [2022-07-19 17:42:19,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176867826] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:42:19,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:42:19,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 17:42:19,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756706405] [2022-07-19 17:42:19,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:42:19,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 17:42:19,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:42:19,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 17:42:19,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-19 17:42:19,801 INFO L87 Difference]: Start difference. First operand 1194 states and 1609 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 6 states have internal predecessors, (85), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-19 17:42:20,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:42:20,014 INFO L93 Difference]: Finished difference Result 2456 states and 3370 transitions. [2022-07-19 17:42:20,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 17:42:20,014 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-19 17:42:20,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:42:20,021 INFO L225 Difference]: With dead ends: 2456 [2022-07-19 17:42:20,021 INFO L226 Difference]: Without dead ends: 1562 [2022-07-19 17:42:20,024 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-19 17:42:20,024 INFO L413 NwaCegarLoop]: 412 mSDtfsCounter, 527 mSDsluCounter, 1863 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 2275 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 17:42:20,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [532 Valid, 2275 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 17:42:20,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1562 states. [2022-07-19 17:42:20,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1562 to 1240. [2022-07-19 17:42:20,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1240 states, 986 states have (on average 1.3468559837728196) internal successors, (1328), 998 states have internal predecessors, (1328), 162 states have call successors, (162), 91 states have call predecessors, (162), 91 states have return successors, (162), 150 states have call predecessors, (162), 162 states have call successors, (162) [2022-07-19 17:42:20,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1240 states to 1240 states and 1652 transitions. [2022-07-19 17:42:20,143 INFO L78 Accepts]: Start accepts. Automaton has 1240 states and 1652 transitions. Word has length 109 [2022-07-19 17:42:20,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:42:20,144 INFO L495 AbstractCegarLoop]: Abstraction has 1240 states and 1652 transitions. [2022-07-19 17:42:20,144 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-19 17:42:20,144 INFO L276 IsEmpty]: Start isEmpty. Operand 1240 states and 1652 transitions. [2022-07-19 17:42:20,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-07-19 17:42:20,145 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:42:20,145 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-19 17:42:20,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-19 17:42:20,146 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:42:20,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:42:20,146 INFO L85 PathProgramCache]: Analyzing trace with hash 326540891, now seen corresponding path program 1 times [2022-07-19 17:42:20,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:42:20,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422519566] [2022-07-19 17:42:20,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:42:20,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:42:20,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:20,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 17:42:20,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:20,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-19 17:42:20,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:20,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-19 17:42:20,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:20,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-19 17:42:20,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:20,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-19 17:42:20,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:20,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-19 17:42:20,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:20,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-19 17:42:20,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:20,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-19 17:42:20,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:20,261 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-19 17:42:20,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:42:20,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422519566] [2022-07-19 17:42:20,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422519566] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:42:20,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:42:20,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 17:42:20,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529081844] [2022-07-19 17:42:20,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:42:20,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 17:42:20,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:42:20,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 17:42:20,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-19 17:42:20,263 INFO L87 Difference]: Start difference. First operand 1240 states and 1652 transitions. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 6 states have internal predecessors, (84), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-19 17:42:20,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:42:20,517 INFO L93 Difference]: Finished difference Result 2550 states and 3481 transitions. [2022-07-19 17:42:20,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 17:42:20,517 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-19 17:42:20,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:42:20,524 INFO L225 Difference]: With dead ends: 2550 [2022-07-19 17:42:20,524 INFO L226 Difference]: Without dead ends: 1590 [2022-07-19 17:42:20,527 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-19 17:42:20,528 INFO L413 NwaCegarLoop]: 442 mSDtfsCounter, 399 mSDsluCounter, 1983 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 2425 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 17:42:20,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 2425 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 17:42:20,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1590 states. [2022-07-19 17:42:20,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1590 to 1126. [2022-07-19 17:42:20,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1126 states, 899 states have (on average 1.3481646273637375) internal successors, (1212), 909 states have internal predecessors, (1212), 145 states have call successors, (145), 81 states have call predecessors, (145), 81 states have return successors, (145), 135 states have call predecessors, (145), 145 states have call successors, (145) [2022-07-19 17:42:20,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 1126 states and 1502 transitions. [2022-07-19 17:42:20,625 INFO L78 Accepts]: Start accepts. Automaton has 1126 states and 1502 transitions. Word has length 111 [2022-07-19 17:42:20,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:42:20,625 INFO L495 AbstractCegarLoop]: Abstraction has 1126 states and 1502 transitions. [2022-07-19 17:42:20,625 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-19 17:42:20,626 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 1502 transitions. [2022-07-19 17:42:20,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-07-19 17:42:20,627 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:42:20,627 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-19 17:42:20,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-19 17:42:20,627 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:42:20,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:42:20,628 INFO L85 PathProgramCache]: Analyzing trace with hash 2059853897, now seen corresponding path program 1 times [2022-07-19 17:42:20,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:42:20,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628387438] [2022-07-19 17:42:20,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:42:20,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:42:20,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:20,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 17:42:20,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:20,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-19 17:42:20,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:20,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-19 17:42:20,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:20,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-19 17:42:20,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:20,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-19 17:42:20,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:20,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-19 17:42:20,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:20,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-19 17:42:20,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:20,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-19 17:42:20,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:20,779 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-19 17:42:20,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:42:20,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628387438] [2022-07-19 17:42:20,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628387438] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:42:20,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:42:20,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 17:42:20,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247637458] [2022-07-19 17:42:20,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:42:20,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 17:42:20,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:42:20,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 17:42:20,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-19 17:42:20,782 INFO L87 Difference]: Start difference. First operand 1126 states and 1502 transitions. Second operand has 8 states, 8 states have (on average 11.125) internal successors, (89), 7 states have internal predecessors, (89), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-07-19 17:42:21,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:42:21,432 INFO L93 Difference]: Finished difference Result 2621 states and 3588 transitions. [2022-07-19 17:42:21,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 17:42:21,433 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-19 17:42:21,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:42:21,441 INFO L225 Difference]: With dead ends: 2621 [2022-07-19 17:42:21,441 INFO L226 Difference]: Without dead ends: 1695 [2022-07-19 17:42:21,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-07-19 17:42:21,444 INFO L413 NwaCegarLoop]: 509 mSDtfsCounter, 930 mSDsluCounter, 1656 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 936 SdHoareTripleChecker+Valid, 2165 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 17:42:21,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [936 Valid, 2165 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-19 17:42:21,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1695 states. [2022-07-19 17:42:21,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1695 to 1142. [2022-07-19 17:42:21,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1142 states, 907 states have (on average 1.328555678059537) internal successors, (1205), 918 states have internal predecessors, (1205), 148 states have call successors, (148), 86 states have call predecessors, (148), 86 states have return successors, (148), 137 states have call predecessors, (148), 148 states have call successors, (148) [2022-07-19 17:42:21,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 1501 transitions. [2022-07-19 17:42:21,574 INFO L78 Accepts]: Start accepts. Automaton has 1142 states and 1501 transitions. Word has length 112 [2022-07-19 17:42:21,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:42:21,575 INFO L495 AbstractCegarLoop]: Abstraction has 1142 states and 1501 transitions. [2022-07-19 17:42:21,575 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-19 17:42:21,575 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 1501 transitions. [2022-07-19 17:42:21,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-07-19 17:42:21,576 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:42:21,576 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-19 17:42:21,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-19 17:42:21,577 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:42:21,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:42:21,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1941201166, now seen corresponding path program 1 times [2022-07-19 17:42:21,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:42:21,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605519276] [2022-07-19 17:42:21,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:42:21,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:42:21,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:21,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 17:42:21,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:21,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 17:42:21,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:21,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-19 17:42:21,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:21,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-19 17:42:21,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:21,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-19 17:42:21,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:21,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-19 17:42:21,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:21,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-19 17:42:21,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:21,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-19 17:42:21,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:21,646 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-19 17:42:21,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:42:21,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605519276] [2022-07-19 17:42:21,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605519276] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:42:21,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:42:21,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 17:42:21,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046591253] [2022-07-19 17:42:21,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:42:21,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 17:42:21,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:42:21,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 17:42:21,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 17:42:21,649 INFO L87 Difference]: Start difference. First operand 1142 states and 1501 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-19 17:42:21,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:42:21,969 INFO L93 Difference]: Finished difference Result 3187 states and 4275 transitions. [2022-07-19 17:42:21,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 17:42:21,971 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-19 17:42:21,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:42:21,981 INFO L225 Difference]: With dead ends: 3187 [2022-07-19 17:42:21,981 INFO L226 Difference]: Without dead ends: 2296 [2022-07-19 17:42:21,983 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-19 17:42:21,984 INFO L413 NwaCegarLoop]: 511 mSDtfsCounter, 440 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 1227 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 17:42:21,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 1227 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 17:42:21,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2296 states. [2022-07-19 17:42:22,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2296 to 1939. [2022-07-19 17:42:22,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1939 states, 1514 states have (on average 1.3262879788639366) internal successors, (2008), 1533 states have internal predecessors, (2008), 272 states have call successors, (272), 152 states have call predecessors, (272), 152 states have return successors, (272), 253 states have call predecessors, (272), 272 states have call successors, (272) [2022-07-19 17:42:22,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1939 states to 1939 states and 2552 transitions. [2022-07-19 17:42:22,184 INFO L78 Accepts]: Start accepts. Automaton has 1939 states and 2552 transitions. Word has length 112 [2022-07-19 17:42:22,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:42:22,184 INFO L495 AbstractCegarLoop]: Abstraction has 1939 states and 2552 transitions. [2022-07-19 17:42:22,185 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-19 17:42:22,185 INFO L276 IsEmpty]: Start isEmpty. Operand 1939 states and 2552 transitions. [2022-07-19 17:42:22,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-19 17:42:22,186 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:42:22,186 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-19 17:42:22,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-19 17:42:22,187 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:42:22,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:42:22,187 INFO L85 PathProgramCache]: Analyzing trace with hash -2103041469, now seen corresponding path program 1 times [2022-07-19 17:42:22,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:42:22,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091651272] [2022-07-19 17:42:22,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:42:22,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:42:22,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:22,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 17:42:22,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:22,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 17:42:22,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:22,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-19 17:42:22,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:22,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-19 17:42:22,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:22,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-19 17:42:22,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:22,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-19 17:42:22,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:22,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-19 17:42:22,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:22,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-19 17:42:22,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:22,315 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-19 17:42:22,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:42:22,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091651272] [2022-07-19 17:42:22,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091651272] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:42:22,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:42:22,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 17:42:22,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497615044] [2022-07-19 17:42:22,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:42:22,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 17:42:22,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:42:22,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 17:42:22,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-19 17:42:22,318 INFO L87 Difference]: Start difference. First operand 1939 states and 2552 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 6 states have internal predecessors, (91), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-19 17:42:23,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:42:23,093 INFO L93 Difference]: Finished difference Result 4400 states and 5932 transitions. [2022-07-19 17:42:23,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 17:42:23,094 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-19 17:42:23,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:42:23,106 INFO L225 Difference]: With dead ends: 4400 [2022-07-19 17:42:23,106 INFO L226 Difference]: Without dead ends: 2810 [2022-07-19 17:42:23,110 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-19 17:42:23,111 INFO L413 NwaCegarLoop]: 578 mSDtfsCounter, 806 mSDsluCounter, 1940 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 809 SdHoareTripleChecker+Valid, 2518 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 17:42:23,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [809 Valid, 2518 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-19 17:42:23,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2810 states. [2022-07-19 17:42:23,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2810 to 1958. [2022-07-19 17:42:23,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1958 states, 1520 states have (on average 1.3223684210526316) internal successors, (2010), 1540 states have internal predecessors, (2010), 280 states have call successors, (280), 157 states have call predecessors, (280), 157 states have return successors, (280), 260 states have call predecessors, (280), 280 states have call successors, (280) [2022-07-19 17:42:23,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1958 states to 1958 states and 2570 transitions. [2022-07-19 17:42:23,384 INFO L78 Accepts]: Start accepts. Automaton has 1958 states and 2570 transitions. Word has length 114 [2022-07-19 17:42:23,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:42:23,384 INFO L495 AbstractCegarLoop]: Abstraction has 1958 states and 2570 transitions. [2022-07-19 17:42:23,385 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-19 17:42:23,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1958 states and 2570 transitions. [2022-07-19 17:42:23,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-07-19 17:42:23,387 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:42:23,387 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-19 17:42:23,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-19 17:42:23,387 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:42:23,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:42:23,388 INFO L85 PathProgramCache]: Analyzing trace with hash 985009634, now seen corresponding path program 1 times [2022-07-19 17:42:23,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:42:23,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436741444] [2022-07-19 17:42:23,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:42:23,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:42:23,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:23,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 17:42:23,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:23,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-19 17:42:23,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:23,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 17:42:23,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:23,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 17:42:23,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:23,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-19 17:42:23,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:23,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-19 17:42:23,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:23,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-19 17:42:23,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:23,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-19 17:42:23,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:23,455 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-19 17:42:23,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:42:23,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436741444] [2022-07-19 17:42:23,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436741444] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:42:23,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:42:23,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 17:42:23,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996818901] [2022-07-19 17:42:23,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:42:23,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 17:42:23,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:42:23,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 17:42:23,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 17:42:23,458 INFO L87 Difference]: Start difference. First operand 1958 states and 2570 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-19 17:42:23,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:42:23,910 INFO L93 Difference]: Finished difference Result 5168 states and 6863 transitions. [2022-07-19 17:42:23,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 17:42:23,910 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-19 17:42:23,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:42:23,938 INFO L225 Difference]: With dead ends: 5168 [2022-07-19 17:42:23,938 INFO L226 Difference]: Without dead ends: 3594 [2022-07-19 17:42:23,942 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-19 17:42:23,944 INFO L413 NwaCegarLoop]: 527 mSDtfsCounter, 487 mSDsluCounter, 764 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 17:42:23,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 1291 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 17:42:23,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3594 states. [2022-07-19 17:42:24,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3594 to 3019. [2022-07-19 17:42:24,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3019 states, 2306 states have (on average 1.318733738074588) internal successors, (3041), 2337 states have internal predecessors, (3041), 460 states have call successors, (460), 252 states have call predecessors, (460), 252 states have return successors, (460), 429 states have call predecessors, (460), 460 states have call successors, (460) [2022-07-19 17:42:24,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3019 states to 3019 states and 3961 transitions. [2022-07-19 17:42:24,245 INFO L78 Accepts]: Start accepts. Automaton has 3019 states and 3961 transitions. Word has length 115 [2022-07-19 17:42:24,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:42:24,246 INFO L495 AbstractCegarLoop]: Abstraction has 3019 states and 3961 transitions. [2022-07-19 17:42:24,246 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-19 17:42:24,246 INFO L276 IsEmpty]: Start isEmpty. Operand 3019 states and 3961 transitions. [2022-07-19 17:42:24,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-07-19 17:42:24,249 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:42:24,249 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-19 17:42:24,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-19 17:42:24,250 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:42:24,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:42:24,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1237817774, now seen corresponding path program 1 times [2022-07-19 17:42:24,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:42:24,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041437798] [2022-07-19 17:42:24,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:42:24,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:42:24,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:24,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 17:42:24,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:24,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 17:42:24,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:24,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 17:42:24,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:24,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-19 17:42:24,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:24,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-19 17:42:24,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:24,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-19 17:42:24,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:24,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-19 17:42:24,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:24,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-19 17:42:24,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:24,308 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-19 17:42:24,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:42:24,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041437798] [2022-07-19 17:42:24,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041437798] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:42:24,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:42:24,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 17:42:24,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454292682] [2022-07-19 17:42:24,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:42:24,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 17:42:24,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:42:24,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 17:42:24,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 17:42:24,311 INFO L87 Difference]: Start difference. First operand 3019 states and 3961 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-19 17:42:24,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:42:24,838 INFO L93 Difference]: Finished difference Result 7140 states and 9437 transitions. [2022-07-19 17:42:24,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 17:42:24,838 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-19 17:42:24,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:42:24,853 INFO L225 Difference]: With dead ends: 7140 [2022-07-19 17:42:24,854 INFO L226 Difference]: Without dead ends: 4635 [2022-07-19 17:42:24,860 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-19 17:42:24,861 INFO L413 NwaCegarLoop]: 551 mSDtfsCounter, 434 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 1288 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 17:42:24,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 1288 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 17:42:24,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4635 states. [2022-07-19 17:42:25,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4635 to 4297. [2022-07-19 17:42:25,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4297 states, 3260 states have (on average 1.316564417177914) internal successors, (4292), 3304 states have internal predecessors, (4292), 672 states have call successors, (672), 364 states have call predecessors, (672), 364 states have return successors, (672), 628 states have call predecessors, (672), 672 states have call successors, (672) [2022-07-19 17:42:25,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4297 states to 4297 states and 5636 transitions. [2022-07-19 17:42:25,378 INFO L78 Accepts]: Start accepts. Automaton has 4297 states and 5636 transitions. Word has length 115 [2022-07-19 17:42:25,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:42:25,379 INFO L495 AbstractCegarLoop]: Abstraction has 4297 states and 5636 transitions. [2022-07-19 17:42:25,379 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-19 17:42:25,379 INFO L276 IsEmpty]: Start isEmpty. Operand 4297 states and 5636 transitions. [2022-07-19 17:42:25,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-07-19 17:42:25,381 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:42:25,382 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-19 17:42:25,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-19 17:42:25,382 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:42:25,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:42:25,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1950956728, now seen corresponding path program 1 times [2022-07-19 17:42:25,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:42:25,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832888043] [2022-07-19 17:42:25,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:42:25,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:42:25,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:25,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 17:42:25,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:25,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 17:42:25,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:25,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-19 17:42:25,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:25,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-19 17:42:25,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:25,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-19 17:42:25,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:25,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 17:42:25,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:25,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-19 17:42:25,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:25,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-19 17:42:25,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:25,427 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-19 17:42:25,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:42:25,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832888043] [2022-07-19 17:42:25,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832888043] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:42:25,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:42:25,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 17:42:25,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539098645] [2022-07-19 17:42:25,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:42:25,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 17:42:25,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:42:25,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 17:42:25,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 17:42:25,430 INFO L87 Difference]: Start difference. First operand 4297 states and 5636 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-19 17:42:26,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:42:26,111 INFO L93 Difference]: Finished difference Result 9720 states and 13194 transitions. [2022-07-19 17:42:26,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 17:42:26,112 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-19 17:42:26,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:42:26,132 INFO L225 Difference]: With dead ends: 9720 [2022-07-19 17:42:26,132 INFO L226 Difference]: Without dead ends: 5828 [2022-07-19 17:42:26,142 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-19 17:42:26,144 INFO L413 NwaCegarLoop]: 458 mSDtfsCounter, 152 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 17:42:26,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 704 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 17:42:26,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5828 states. [2022-07-19 17:42:26,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5828 to 4303. [2022-07-19 17:42:26,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4303 states, 3266 states have (on average 1.3159828536436007) internal successors, (4298), 3310 states have internal predecessors, (4298), 672 states have call successors, (672), 364 states have call predecessors, (672), 364 states have return successors, (672), 628 states have call predecessors, (672), 672 states have call successors, (672) [2022-07-19 17:42:26,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4303 states to 4303 states and 5642 transitions. [2022-07-19 17:42:26,599 INFO L78 Accepts]: Start accepts. Automaton has 4303 states and 5642 transitions. Word has length 116 [2022-07-19 17:42:26,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:42:26,600 INFO L495 AbstractCegarLoop]: Abstraction has 4303 states and 5642 transitions. [2022-07-19 17:42:26,600 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-19 17:42:26,600 INFO L276 IsEmpty]: Start isEmpty. Operand 4303 states and 5642 transitions. [2022-07-19 17:42:26,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-19 17:42:26,602 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:42:26,603 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-19 17:42:26,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-19 17:42:26,603 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:42:26,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:42:26,604 INFO L85 PathProgramCache]: Analyzing trace with hash -2025473139, now seen corresponding path program 1 times [2022-07-19 17:42:26,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:42:26,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057130640] [2022-07-19 17:42:26,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:42:26,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:42:26,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:26,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 17:42:26,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:26,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 17:42:26,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:26,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 17:42:26,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:26,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-19 17:42:26,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:26,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-19 17:42:26,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:26,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-19 17:42:26,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:26,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-19 17:42:26,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:26,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-19 17:42:26,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:26,679 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-19 17:42:26,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:42:26,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057130640] [2022-07-19 17:42:26,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057130640] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:42:26,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:42:26,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 17:42:26,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813679459] [2022-07-19 17:42:26,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:42:26,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 17:42:26,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:42:26,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 17:42:26,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 17:42:26,681 INFO L87 Difference]: Start difference. First operand 4303 states and 5642 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-19 17:42:27,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:42:27,163 INFO L93 Difference]: Finished difference Result 9016 states and 12080 transitions. [2022-07-19 17:42:27,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 17:42:27,164 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-19 17:42:27,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:42:27,178 INFO L225 Difference]: With dead ends: 9016 [2022-07-19 17:42:27,178 INFO L226 Difference]: Without dead ends: 4810 [2022-07-19 17:42:27,186 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-19 17:42:27,187 INFO L413 NwaCegarLoop]: 335 mSDtfsCounter, 370 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 17:42:27,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 884 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 17:42:27,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4810 states. [2022-07-19 17:42:27,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4810 to 3870. [2022-07-19 17:42:27,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3870 states, 2916 states have (on average 1.3223593964334706) internal successors, (3856), 2950 states have internal predecessors, (3856), 620 states have call successors, (620), 333 states have call predecessors, (620), 333 states have return successors, (620), 586 states have call predecessors, (620), 620 states have call successors, (620) [2022-07-19 17:42:27,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3870 states to 3870 states and 5096 transitions. [2022-07-19 17:42:27,595 INFO L78 Accepts]: Start accepts. Automaton has 3870 states and 5096 transitions. Word has length 117 [2022-07-19 17:42:27,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:42:27,596 INFO L495 AbstractCegarLoop]: Abstraction has 3870 states and 5096 transitions. [2022-07-19 17:42:27,596 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-19 17:42:27,596 INFO L276 IsEmpty]: Start isEmpty. Operand 3870 states and 5096 transitions. [2022-07-19 17:42:27,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-07-19 17:42:27,598 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:42:27,598 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-19 17:42:27,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-19 17:42:27,598 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:42:27,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:42:27,599 INFO L85 PathProgramCache]: Analyzing trace with hash 183157843, now seen corresponding path program 1 times [2022-07-19 17:42:27,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:42:27,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501408286] [2022-07-19 17:42:27,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:42:27,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:42:27,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:27,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 17:42:27,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:27,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 17:42:27,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:27,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-19 17:42:27,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:27,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-19 17:42:27,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:27,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-19 17:42:27,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:27,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 17:42:27,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:27,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-19 17:42:27,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:27,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-19 17:42:27,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:27,639 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-19 17:42:27,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:42:27,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501408286] [2022-07-19 17:42:27,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501408286] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:42:27,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:42:27,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 17:42:27,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052035392] [2022-07-19 17:42:27,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:42:27,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 17:42:27,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:42:27,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 17:42:27,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 17:42:27,642 INFO L87 Difference]: Start difference. First operand 3870 states and 5096 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-19 17:42:28,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:42:28,246 INFO L93 Difference]: Finished difference Result 8518 states and 11512 transitions. [2022-07-19 17:42:28,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 17:42:28,247 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-19 17:42:28,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:42:28,262 INFO L225 Difference]: With dead ends: 8518 [2022-07-19 17:42:28,262 INFO L226 Difference]: Without dead ends: 4861 [2022-07-19 17:42:28,270 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-19 17:42:28,271 INFO L413 NwaCegarLoop]: 438 mSDtfsCounter, 152 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 17:42:28,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 683 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 17:42:28,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4861 states. [2022-07-19 17:42:28,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4861 to 3880. [2022-07-19 17:42:28,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3880 states, 2926 states have (on average 1.3212576896787422) internal successors, (3866), 2960 states have internal predecessors, (3866), 620 states have call successors, (620), 333 states have call predecessors, (620), 333 states have return successors, (620), 586 states have call predecessors, (620), 620 states have call successors, (620) [2022-07-19 17:42:28,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3880 states to 3880 states and 5106 transitions. [2022-07-19 17:42:28,676 INFO L78 Accepts]: Start accepts. Automaton has 3880 states and 5106 transitions. Word has length 118 [2022-07-19 17:42:28,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:42:28,676 INFO L495 AbstractCegarLoop]: Abstraction has 3880 states and 5106 transitions. [2022-07-19 17:42:28,676 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-19 17:42:28,676 INFO L276 IsEmpty]: Start isEmpty. Operand 3880 states and 5106 transitions. [2022-07-19 17:42:28,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-07-19 17:42:28,678 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:42:28,679 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-19 17:42:28,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-19 17:42:28,679 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:42:28,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:42:28,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1515793806, now seen corresponding path program 1 times [2022-07-19 17:42:28,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:42:28,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161515757] [2022-07-19 17:42:28,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:42:28,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:42:28,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:28,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 17:42:28,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:28,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 17:42:28,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:28,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-19 17:42:28,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:28,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-19 17:42:28,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:28,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-19 17:42:28,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:28,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 17:42:28,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:28,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-19 17:42:28,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:28,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-19 17:42:28,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:28,745 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-19 17:42:28,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:42:28,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161515757] [2022-07-19 17:42:28,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161515757] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:42:28,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:42:28,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 17:42:28,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082985365] [2022-07-19 17:42:28,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:42:28,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 17:42:28,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:42:28,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 17:42:28,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 17:42:28,747 INFO L87 Difference]: Start difference. First operand 3880 states and 5106 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-19 17:42:29,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:42:29,193 INFO L93 Difference]: Finished difference Result 8465 states and 11428 transitions. [2022-07-19 17:42:29,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 17:42:29,194 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-19 17:42:29,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:42:29,209 INFO L225 Difference]: With dead ends: 8465 [2022-07-19 17:42:29,209 INFO L226 Difference]: Without dead ends: 4731 [2022-07-19 17:42:29,219 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-19 17:42:29,219 INFO L413 NwaCegarLoop]: 360 mSDtfsCounter, 285 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 915 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 17:42:29,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 915 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 17:42:29,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4731 states. [2022-07-19 17:42:29,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4731 to 2927. [2022-07-19 17:42:29,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2927 states, 2207 states have (on average 1.313094698685999) internal successors, (2898), 2226 states have internal predecessors, (2898), 469 states have call successors, (469), 250 states have call predecessors, (469), 250 states have return successors, (469), 450 states have call predecessors, (469), 469 states have call successors, (469) [2022-07-19 17:42:29,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2927 states to 2927 states and 3836 transitions. [2022-07-19 17:42:29,563 INFO L78 Accepts]: Start accepts. Automaton has 2927 states and 3836 transitions. Word has length 118 [2022-07-19 17:42:29,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:42:29,563 INFO L495 AbstractCegarLoop]: Abstraction has 2927 states and 3836 transitions. [2022-07-19 17:42:29,563 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-19 17:42:29,564 INFO L276 IsEmpty]: Start isEmpty. Operand 2927 states and 3836 transitions. [2022-07-19 17:42:29,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-07-19 17:42:29,569 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:42:29,569 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:42:29,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-19 17:42:29,569 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:42:29,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:42:29,570 INFO L85 PathProgramCache]: Analyzing trace with hash -402462666, now seen corresponding path program 1 times [2022-07-19 17:42:29,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:42:29,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112073865] [2022-07-19 17:42:29,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:42:29,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:42:29,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:29,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 17:42:29,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:29,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-19 17:42:29,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:29,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-19 17:42:29,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:29,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-19 17:42:29,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:29,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-19 17:42:29,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:29,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-19 17:42:29,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:29,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-19 17:42:29,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:29,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-19 17:42:29,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:29,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-19 17:42:29,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:29,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-19 17:42:29,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:29,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-19 17:42:29,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:29,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-19 17:42:29,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:29,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-19 17:42:29,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:29,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-19 17:42:29,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:29,721 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-19 17:42:29,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:42:29,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112073865] [2022-07-19 17:42:29,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112073865] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:42:29,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921329973] [2022-07-19 17:42:29,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:42:29,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:42:29,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:42:29,727 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-19 17:42:29,771 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-19 17:42:29,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:29,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 748 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-19 17:42:29,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:42:30,168 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-19 17:42:30,168 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 17:42:30,336 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-19 17:42:30,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1921329973] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 17:42:30,337 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 17:42:30,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-07-19 17:42:30,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341622156] [2022-07-19 17:42:30,337 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 17:42:30,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-19 17:42:30,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:42:30,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-19 17:42:30,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-07-19 17:42:30,339 INFO L87 Difference]: Start difference. First operand 2927 states and 3836 transitions. Second operand has 14 states, 14 states have (on average 18.857142857142858) internal successors, (264), 13 states have internal predecessors, (264), 6 states have call successors, (37), 4 states have call predecessors, (37), 6 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) [2022-07-19 17:42:34,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:42:34,037 INFO L93 Difference]: Finished difference Result 10002 states and 14000 transitions. [2022-07-19 17:42:34,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-07-19 17:42:34,037 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 18.857142857142858) internal successors, (264), 13 states have internal predecessors, (264), 6 states have call successors, (37), 4 states have call predecessors, (37), 6 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) Word has length 186 [2022-07-19 17:42:34,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:42:34,060 INFO L225 Difference]: With dead ends: 10002 [2022-07-19 17:42:34,060 INFO L226 Difference]: Without dead ends: 7362 [2022-07-19 17:42:34,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 404 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1358 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=749, Invalid=3411, Unknown=0, NotChecked=0, Total=4160 [2022-07-19 17:42:34,069 INFO L413 NwaCegarLoop]: 337 mSDtfsCounter, 4481 mSDsluCounter, 2949 mSDsCounter, 0 mSdLazyCounter, 2038 mSolverCounterSat, 1308 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4481 SdHoareTripleChecker+Valid, 3286 SdHoareTripleChecker+Invalid, 3346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1308 IncrementalHoareTripleChecker+Valid, 2038 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-19 17:42:34,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4481 Valid, 3286 Invalid, 3346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1308 Valid, 2038 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-07-19 17:42:34,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7362 states. [2022-07-19 17:42:34,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7362 to 3451. [2022-07-19 17:42:34,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3451 states, 2624 states have (on average 1.3090701219512195) internal successors, (3435), 2644 states have internal predecessors, (3435), 531 states have call successors, (531), 295 states have call predecessors, (531), 295 states have return successors, (531), 511 states have call predecessors, (531), 531 states have call successors, (531) [2022-07-19 17:42:34,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3451 states to 3451 states and 4497 transitions. [2022-07-19 17:42:34,614 INFO L78 Accepts]: Start accepts. Automaton has 3451 states and 4497 transitions. Word has length 186 [2022-07-19 17:42:34,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:42:34,614 INFO L495 AbstractCegarLoop]: Abstraction has 3451 states and 4497 transitions. [2022-07-19 17:42:34,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 18.857142857142858) internal successors, (264), 13 states have internal predecessors, (264), 6 states have call successors, (37), 4 states have call predecessors, (37), 6 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) [2022-07-19 17:42:34,614 INFO L276 IsEmpty]: Start isEmpty. Operand 3451 states and 4497 transitions. [2022-07-19 17:42:34,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-07-19 17:42:34,621 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:42:34,621 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:42:34,650 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-19 17:42:34,843 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-19 17:42:34,843 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:42:34,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:42:34,844 INFO L85 PathProgramCache]: Analyzing trace with hash 141381451, now seen corresponding path program 1 times [2022-07-19 17:42:34,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:42:34,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10460944] [2022-07-19 17:42:34,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:42:34,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:42:34,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:34,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 17:42:34,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:34,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 17:42:34,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:34,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-19 17:42:34,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:34,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-19 17:42:34,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:34,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-19 17:42:34,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:34,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-19 17:42:34,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:34,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-19 17:42:34,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:34,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-19 17:42:34,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:34,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-19 17:42:34,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:34,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-19 17:42:34,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:34,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-19 17:42:34,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:34,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-19 17:42:34,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:34,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-19 17:42:34,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:35,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-19 17:42:35,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:35,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-19 17:42:35,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:35,015 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-19 17:42:35,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:42:35,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10460944] [2022-07-19 17:42:35,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10460944] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:42:35,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206557680] [2022-07-19 17:42:35,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:42:35,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:42:35,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:42:35,017 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-19 17:42:35,046 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-19 17:42:35,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:35,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 793 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-19 17:42:35,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:42:35,488 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-19 17:42:35,489 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 17:42:35,678 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-19 17:42:35,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [206557680] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 17:42:35,678 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 17:42:35,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2022-07-19 17:42:35,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922568494] [2022-07-19 17:42:35,679 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 17:42:35,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-19 17:42:35,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:42:35,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-19 17:42:35,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2022-07-19 17:42:35,681 INFO L87 Difference]: Start difference. First operand 3451 states and 4497 transitions. Second operand has 16 states, 16 states have (on average 16.625) internal successors, (266), 14 states have internal predecessors, (266), 6 states have call successors, (43), 4 states have call predecessors, (43), 7 states have return successors, (42), 8 states have call predecessors, (42), 6 states have call successors, (42) [2022-07-19 17:42:43,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:42:43,532 INFO L93 Difference]: Finished difference Result 17532 states and 23957 transitions. [2022-07-19 17:42:43,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2022-07-19 17:42:43,533 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 16.625) internal successors, (266), 14 states have internal predecessors, (266), 6 states have call successors, (43), 4 states have call predecessors, (43), 7 states have return successors, (42), 8 states have call predecessors, (42), 6 states have call successors, (42) Word has length 194 [2022-07-19 17:42:43,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:42:43,582 INFO L225 Difference]: With dead ends: 17532 [2022-07-19 17:42:43,582 INFO L226 Difference]: Without dead ends: 14377 [2022-07-19 17:42:43,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 594 GetRequests, 476 SyntacticMatches, 1 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5045 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1835, Invalid=12207, Unknown=0, NotChecked=0, Total=14042 [2022-07-19 17:42:43,596 INFO L413 NwaCegarLoop]: 1832 mSDtfsCounter, 5889 mSDsluCounter, 13834 mSDsCounter, 0 mSdLazyCounter, 5456 mSolverCounterSat, 3535 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5889 SdHoareTripleChecker+Valid, 15666 SdHoareTripleChecker+Invalid, 8991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3535 IncrementalHoareTripleChecker+Valid, 5456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-19 17:42:43,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5889 Valid, 15666 Invalid, 8991 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3535 Valid, 5456 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-07-19 17:42:43,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14377 states. [2022-07-19 17:42:44,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14377 to 6318. [2022-07-19 17:42:44,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6318 states, 4774 states have (on average 1.3112693757855047) internal successors, (6260), 4812 states have internal predecessors, (6260), 992 states have call successors, (992), 551 states have call predecessors, (992), 551 states have return successors, (992), 954 states have call predecessors, (992), 992 states have call successors, (992) [2022-07-19 17:42:44,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6318 states to 6318 states and 8244 transitions. [2022-07-19 17:42:44,512 INFO L78 Accepts]: Start accepts. Automaton has 6318 states and 8244 transitions. Word has length 194 [2022-07-19 17:42:44,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:42:44,512 INFO L495 AbstractCegarLoop]: Abstraction has 6318 states and 8244 transitions. [2022-07-19 17:42:44,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 16.625) internal successors, (266), 14 states have internal predecessors, (266), 6 states have call successors, (43), 4 states have call predecessors, (43), 7 states have return successors, (42), 8 states have call predecessors, (42), 6 states have call successors, (42) [2022-07-19 17:42:44,513 INFO L276 IsEmpty]: Start isEmpty. Operand 6318 states and 8244 transitions. [2022-07-19 17:42:44,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-07-19 17:42:44,523 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:42:44,523 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:42:44,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-19 17:42:44,747 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-19 17:42:44,748 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:42:44,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:42:44,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1389154626, now seen corresponding path program 1 times [2022-07-19 17:42:44,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:42:44,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039777129] [2022-07-19 17:42:44,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:42:44,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:42:44,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:44,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 17:42:44,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:44,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 17:42:44,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:44,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 17:42:44,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:44,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 17:42:44,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:44,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-19 17:42:44,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:44,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-19 17:42:44,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:44,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-19 17:42:44,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:44,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-19 17:42:44,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:44,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-19 17:42:44,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:44,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-19 17:42:44,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:44,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-19 17:42:44,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:44,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-19 17:42:44,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:44,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-07-19 17:42:44,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:44,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-19 17:42:44,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:44,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-07-19 17:42:44,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:44,854 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-19 17:42:44,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:42:44,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039777129] [2022-07-19 17:42:44,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039777129] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:42:44,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:42:44,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 17:42:44,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133414591] [2022-07-19 17:42:44,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:42:44,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 17:42:44,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:42:44,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 17:42:44,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-19 17:42:44,857 INFO L87 Difference]: Start difference. First operand 6318 states and 8244 transitions. Second operand has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 6 states have internal predecessors, (117), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-19 17:42:46,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:42:46,927 INFO L93 Difference]: Finished difference Result 21338 states and 28586 transitions. [2022-07-19 17:42:46,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 17:42:46,928 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 6 states have internal predecessors, (117), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 196 [2022-07-19 17:42:46,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:42:46,971 INFO L225 Difference]: With dead ends: 21338 [2022-07-19 17:42:46,971 INFO L226 Difference]: Without dead ends: 15378 [2022-07-19 17:42:46,984 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-19 17:42:46,985 INFO L413 NwaCegarLoop]: 574 mSDtfsCounter, 817 mSDsluCounter, 2520 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 836 SdHoareTripleChecker+Valid, 3094 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 17:42:46,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [836 Valid, 3094 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 17:42:46,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15378 states. [2022-07-19 17:42:48,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15378 to 8160. [2022-07-19 17:42:48,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8160 states, 6104 states have (on average 1.3086500655307995) internal successors, (7988), 6155 states have internal predecessors, (7988), 1335 states have call successors, (1335), 720 states have call predecessors, (1335), 720 states have return successors, (1335), 1284 states have call predecessors, (1335), 1335 states have call successors, (1335) [2022-07-19 17:42:48,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8160 states to 8160 states and 10658 transitions. [2022-07-19 17:42:48,085 INFO L78 Accepts]: Start accepts. Automaton has 8160 states and 10658 transitions. Word has length 196 [2022-07-19 17:42:48,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:42:48,086 INFO L495 AbstractCegarLoop]: Abstraction has 8160 states and 10658 transitions. [2022-07-19 17:42:48,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 6 states have internal predecessors, (117), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-19 17:42:48,086 INFO L276 IsEmpty]: Start isEmpty. Operand 8160 states and 10658 transitions. [2022-07-19 17:42:48,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2022-07-19 17:42:48,099 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:42:48,100 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:42:48,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-19 17:42:48,100 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:42:48,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:42:48,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1333769863, now seen corresponding path program 1 times [2022-07-19 17:42:48,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:42:48,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390278938] [2022-07-19 17:42:48,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:42:48,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:42:48,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:48,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 17:42:48,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:48,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 17:42:48,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:48,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 17:42:48,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:48,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 17:42:48,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:48,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-19 17:42:48,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:48,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-19 17:42:48,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:48,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-19 17:42:48,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:48,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-19 17:42:48,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:48,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-19 17:42:48,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:48,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-19 17:42:48,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:48,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-19 17:42:48,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:48,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-19 17:42:48,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:48,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-19 17:42:48,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:48,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-07-19 17:42:48,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:48,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-19 17:42:48,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:48,227 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-19 17:42:48,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:42:48,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390278938] [2022-07-19 17:42:48,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390278938] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:42:48,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935643192] [2022-07-19 17:42:48,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:42:48,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:42:48,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:42:48,232 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-19 17:42:48,236 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-19 17:42:48,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:48,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 798 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-19 17:42:48,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:42:48,465 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-19 17:42:48,465 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 17:42:48,562 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-19 17:42:48,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [935643192] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-19 17:42:48,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-19 17:42:48,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8, 7] total 14 [2022-07-19 17:42:48,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401134459] [2022-07-19 17:42:48,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:42:48,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 17:42:48,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:42:48,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 17:42:48,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-07-19 17:42:48,565 INFO L87 Difference]: Start difference. First operand 8160 states and 10658 transitions. Second operand has 5 states, 4 states have (on average 28.75) internal successors, (115), 5 states have internal predecessors, (115), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2022-07-19 17:42:49,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:42:49,266 INFO L93 Difference]: Finished difference Result 13442 states and 17611 transitions. [2022-07-19 17:42:49,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 17:42:49,267 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 28.75) internal successors, (115), 5 states have internal predecessors, (115), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 198 [2022-07-19 17:42:49,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:42:49,281 INFO L225 Difference]: With dead ends: 13442 [2022-07-19 17:42:49,281 INFO L226 Difference]: Without dead ends: 5488 [2022-07-19 17:42:49,294 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 419 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-07-19 17:42:49,295 INFO L413 NwaCegarLoop]: 293 mSDtfsCounter, 2 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 17:42:49,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 870 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 17:42:49,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5488 states. [2022-07-19 17:42:50,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5488 to 5488. [2022-07-19 17:42:50,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5488 states, 4106 states have (on average 1.3080857282026304) internal successors, (5371), 4140 states have internal predecessors, (5371), 901 states have call successors, (901), 480 states have call predecessors, (901), 480 states have return successors, (901), 867 states have call predecessors, (901), 901 states have call successors, (901) [2022-07-19 17:42:50,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5488 states to 5488 states and 7173 transitions. [2022-07-19 17:42:50,132 INFO L78 Accepts]: Start accepts. Automaton has 5488 states and 7173 transitions. Word has length 198 [2022-07-19 17:42:50,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:42:50,133 INFO L495 AbstractCegarLoop]: Abstraction has 5488 states and 7173 transitions. [2022-07-19 17:42:50,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 28.75) internal successors, (115), 5 states have internal predecessors, (115), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2022-07-19 17:42:50,133 INFO L276 IsEmpty]: Start isEmpty. Operand 5488 states and 7173 transitions. [2022-07-19 17:42:50,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2022-07-19 17:42:50,142 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:42:50,142 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:42:50,168 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-19 17:42:50,367 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-19 17:42:50,368 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:42:50,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:42:50,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1056461284, now seen corresponding path program 1 times [2022-07-19 17:42:50,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:42:50,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559523660] [2022-07-19 17:42:50,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:42:50,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:42:50,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:50,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 17:42:50,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:50,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 17:42:50,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:50,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 17:42:50,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:50,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 17:42:50,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:50,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-19 17:42:50,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:50,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-19 17:42:50,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:50,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-19 17:42:50,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:50,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-19 17:42:50,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:50,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-19 17:42:50,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:50,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-19 17:42:50,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:50,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-19 17:42:50,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:50,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-19 17:42:50,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:50,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-19 17:42:50,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:50,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-07-19 17:42:50,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:50,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-19 17:42:50,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:50,550 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-19 17:42:50,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:42:50,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559523660] [2022-07-19 17:42:50,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559523660] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:42:50,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022712208] [2022-07-19 17:42:50,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:42:50,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:42:50,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:42:50,553 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-19 17:42:50,554 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-19 17:42:50,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:42:50,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 824 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-19 17:42:50,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:42:51,172 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-19 17:42:51,172 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 17:42:51,478 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-19 17:42:51,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2022712208] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 17:42:51,479 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 17:42:51,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 8] total 24 [2022-07-19 17:42:51,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902426406] [2022-07-19 17:42:51,479 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 17:42:51,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-19 17:42:51,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:42:51,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-19 17:42:51,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=488, Unknown=0, NotChecked=0, Total=552 [2022-07-19 17:42:51,481 INFO L87 Difference]: Start difference. First operand 5488 states and 7173 transitions. Second operand has 24 states, 24 states have (on average 14.375) internal successors, (345), 24 states have internal predecessors, (345), 9 states have call successors, (41), 5 states have call predecessors, (41), 5 states have return successors, (40), 9 states have call predecessors, (40), 9 states have call successors, (40) [2022-07-19 17:43:05,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:43:05,593 INFO L93 Difference]: Finished difference Result 27311 states and 38275 transitions. [2022-07-19 17:43:05,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 203 states. [2022-07-19 17:43:05,594 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 14.375) internal successors, (345), 24 states have internal predecessors, (345), 9 states have call successors, (41), 5 states have call predecessors, (41), 5 states have return successors, (40), 9 states have call predecessors, (40), 9 states have call successors, (40) Word has length 198 [2022-07-19 17:43:05,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:43:05,658 INFO L225 Difference]: With dead ends: 27311 [2022-07-19 17:43:05,658 INFO L226 Difference]: Without dead ends: 22107 [2022-07-19 17:43:05,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 640 GetRequests, 417 SyntacticMatches, 1 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20333 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5256, Invalid=44696, Unknown=0, NotChecked=0, Total=49952 [2022-07-19 17:43:05,680 INFO L413 NwaCegarLoop]: 698 mSDtfsCounter, 10125 mSDsluCounter, 8131 mSDsCounter, 0 mSdLazyCounter, 12316 mSolverCounterSat, 4950 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10125 SdHoareTripleChecker+Valid, 8829 SdHoareTripleChecker+Invalid, 17266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4950 IncrementalHoareTripleChecker+Valid, 12316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-07-19 17:43:05,680 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10125 Valid, 8829 Invalid, 17266 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4950 Valid, 12316 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2022-07-19 17:43:05,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22107 states. [2022-07-19 17:43:07,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22107 to 11273. [2022-07-19 17:43:07,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11273 states, 8504 states have (on average 1.3065616180620885) internal successors, (11111), 8570 states have internal predecessors, (11111), 1785 states have call successors, (1785), 983 states have call predecessors, (1785), 983 states have return successors, (1785), 1719 states have call predecessors, (1785), 1785 states have call successors, (1785) [2022-07-19 17:43:07,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11273 states to 11273 states and 14681 transitions. [2022-07-19 17:43:07,470 INFO L78 Accepts]: Start accepts. Automaton has 11273 states and 14681 transitions. Word has length 198 [2022-07-19 17:43:07,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:43:07,471 INFO L495 AbstractCegarLoop]: Abstraction has 11273 states and 14681 transitions. [2022-07-19 17:43:07,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 14.375) internal successors, (345), 24 states have internal predecessors, (345), 9 states have call successors, (41), 5 states have call predecessors, (41), 5 states have return successors, (40), 9 states have call predecessors, (40), 9 states have call successors, (40) [2022-07-19 17:43:07,471 INFO L276 IsEmpty]: Start isEmpty. Operand 11273 states and 14681 transitions. [2022-07-19 17:43:07,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2022-07-19 17:43:07,487 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:43:07,488 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:43:07,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-19 17:43:07,703 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-19 17:43:07,703 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:43:07,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:43:07,704 INFO L85 PathProgramCache]: Analyzing trace with hash 988856049, now seen corresponding path program 1 times [2022-07-19 17:43:07,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:43:07,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686647820] [2022-07-19 17:43:07,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:43:07,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:43:07,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:07,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 17:43:07,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:07,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 17:43:07,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:07,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 17:43:07,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:07,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 17:43:07,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:07,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-19 17:43:07,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:07,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-19 17:43:07,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:07,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-19 17:43:07,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:07,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-19 17:43:07,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:07,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-19 17:43:07,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:07,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-19 17:43:07,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:07,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-19 17:43:07,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:07,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-19 17:43:07,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:07,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-19 17:43:07,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:07,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-07-19 17:43:07,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:07,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-19 17:43:07,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:07,815 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-19 17:43:07,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:43:07,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686647820] [2022-07-19 17:43:07,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686647820] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:43:07,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:43:07,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 17:43:07,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296906484] [2022-07-19 17:43:07,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:43:07,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 17:43:07,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:43:07,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 17:43:07,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-19 17:43:07,818 INFO L87 Difference]: Start difference. First operand 11273 states and 14681 transitions. Second operand has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-19 17:43:09,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:43:09,038 INFO L93 Difference]: Finished difference Result 21529 states and 28129 transitions. [2022-07-19 17:43:09,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 17:43:09,038 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 198 [2022-07-19 17:43:09,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:43:09,069 INFO L225 Difference]: With dead ends: 21529 [2022-07-19 17:43:09,069 INFO L226 Difference]: Without dead ends: 10523 [2022-07-19 17:43:09,083 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-19 17:43:09,084 INFO L413 NwaCegarLoop]: 255 mSDtfsCounter, 287 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 17:43:09,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 442 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 17:43:09,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10523 states. [2022-07-19 17:43:10,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10523 to 10523. [2022-07-19 17:43:10,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10523 states, 7946 states have (on average 1.30845708532595) internal successors, (10397), 8008 states have internal predecessors, (10397), 1663 states have call successors, (1663), 913 states have call predecessors, (1663), 913 states have return successors, (1663), 1601 states have call predecessors, (1663), 1663 states have call successors, (1663) [2022-07-19 17:43:10,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10523 states to 10523 states and 13723 transitions. [2022-07-19 17:43:10,444 INFO L78 Accepts]: Start accepts. Automaton has 10523 states and 13723 transitions. Word has length 198 [2022-07-19 17:43:10,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:43:10,444 INFO L495 AbstractCegarLoop]: Abstraction has 10523 states and 13723 transitions. [2022-07-19 17:43:10,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 2 states have call successors, (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-19 17:43:10,444 INFO L276 IsEmpty]: Start isEmpty. Operand 10523 states and 13723 transitions. [2022-07-19 17:43:10,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-07-19 17:43:10,456 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:43:10,457 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:43:10,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-07-19 17:43:10,457 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:43:10,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:43:10,458 INFO L85 PathProgramCache]: Analyzing trace with hash 2041661109, now seen corresponding path program 1 times [2022-07-19 17:43:10,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:43:10,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198040287] [2022-07-19 17:43:10,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:43:10,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:43:10,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:10,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 17:43:10,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:10,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 17:43:10,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:10,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 17:43:10,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:10,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 17:43:10,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:10,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-19 17:43:10,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:10,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-19 17:43:10,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:10,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-19 17:43:10,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:10,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-19 17:43:10,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:10,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-19 17:43:10,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:10,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-19 17:43:10,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:10,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-19 17:43:10,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:10,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-19 17:43:10,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:10,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-19 17:43:10,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:10,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-19 17:43:10,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:10,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-19 17:43:10,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:10,648 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-19 17:43:10,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:43:10,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198040287] [2022-07-19 17:43:10,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198040287] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:43:10,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772017528] [2022-07-19 17:43:10,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:43:10,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:43:10,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:43:10,651 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-19 17:43:10,652 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-19 17:43:10,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:10,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 823 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-19 17:43:10,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:43:10,969 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-19 17:43:10,969 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 17:43:11,105 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-19 17:43:11,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772017528] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 17:43:11,106 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 17:43:11,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 17 [2022-07-19 17:43:11,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052188966] [2022-07-19 17:43:11,106 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 17:43:11,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-19 17:43:11,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:43:11,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-19 17:43:11,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2022-07-19 17:43:11,112 INFO L87 Difference]: Start difference. First operand 10523 states and 13723 transitions. Second operand has 17 states, 17 states have (on average 15.235294117647058) internal successors, (259), 16 states have internal predecessors, (259), 6 states have call successors, (37), 4 states have call predecessors, (37), 6 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) [2022-07-19 17:43:17,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:43:17,971 INFO L93 Difference]: Finished difference Result 32522 states and 44939 transitions. [2022-07-19 17:43:17,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-07-19 17:43:17,972 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 15.235294117647058) internal successors, (259), 16 states have internal predecessors, (259), 6 states have call successors, (37), 4 states have call predecessors, (37), 6 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) Word has length 199 [2022-07-19 17:43:17,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:43:18,035 INFO L225 Difference]: With dead ends: 32522 [2022-07-19 17:43:18,036 INFO L226 Difference]: Without dead ends: 22305 [2022-07-19 17:43:18,054 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 430 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2052 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=886, Invalid=5594, Unknown=0, NotChecked=0, Total=6480 [2022-07-19 17:43:18,055 INFO L413 NwaCegarLoop]: 644 mSDtfsCounter, 3052 mSDsluCounter, 6315 mSDsCounter, 0 mSdLazyCounter, 5308 mSolverCounterSat, 1476 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3052 SdHoareTripleChecker+Valid, 6959 SdHoareTripleChecker+Invalid, 6784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1476 IncrementalHoareTripleChecker+Valid, 5308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-07-19 17:43:18,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3052 Valid, 6959 Invalid, 6784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1476 Valid, 5308 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-07-19 17:43:18,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22305 states. [2022-07-19 17:43:19,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22305 to 11869. [2022-07-19 17:43:19,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11869 states, 8972 states have (on average 1.3039456085599643) internal successors, (11699), 9042 states have internal predecessors, (11699), 1863 states have call successors, (1863), 1033 states have call predecessors, (1863), 1033 states have return successors, (1863), 1793 states have call predecessors, (1863), 1863 states have call successors, (1863) [2022-07-19 17:43:19,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11869 states to 11869 states and 15425 transitions. [2022-07-19 17:43:19,858 INFO L78 Accepts]: Start accepts. Automaton has 11869 states and 15425 transitions. Word has length 199 [2022-07-19 17:43:19,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:43:19,858 INFO L495 AbstractCegarLoop]: Abstraction has 11869 states and 15425 transitions. [2022-07-19 17:43:19,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 15.235294117647058) internal successors, (259), 16 states have internal predecessors, (259), 6 states have call successors, (37), 4 states have call predecessors, (37), 6 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) [2022-07-19 17:43:19,859 INFO L276 IsEmpty]: Start isEmpty. Operand 11869 states and 15425 transitions. [2022-07-19 17:43:19,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-07-19 17:43:19,871 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:43:19,872 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:43:19,898 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-19 17:43:20,087 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-19 17:43:20,088 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:43:20,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:43:20,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1117795559, now seen corresponding path program 1 times [2022-07-19 17:43:20,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:43:20,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781116655] [2022-07-19 17:43:20,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:43:20,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:43:20,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:20,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 17:43:20,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:20,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 17:43:20,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:20,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 17:43:20,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:20,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 17:43:20,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:20,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-19 17:43:20,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:20,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-19 17:43:20,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:20,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-19 17:43:20,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:20,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-19 17:43:20,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:20,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-19 17:43:20,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:20,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-19 17:43:20,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:20,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-19 17:43:20,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:20,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-19 17:43:20,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:20,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-19 17:43:20,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:20,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-19 17:43:20,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:20,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-19 17:43:20,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:20,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-19 17:43:20,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:20,153 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-19 17:43:20,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:43:20,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781116655] [2022-07-19 17:43:20,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781116655] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:43:20,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:43:20,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 17:43:20,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352640107] [2022-07-19 17:43:20,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:43:20,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 17:43:20,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:43:20,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 17:43:20,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-19 17:43:20,155 INFO L87 Difference]: Start difference. First operand 11869 states and 15425 transitions. Second operand has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-19 17:43:21,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:43:21,566 INFO L93 Difference]: Finished difference Result 22325 states and 29122 transitions. [2022-07-19 17:43:21,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 17:43:21,566 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 207 [2022-07-19 17:43:21,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:43:21,586 INFO L225 Difference]: With dead ends: 22325 [2022-07-19 17:43:21,586 INFO L226 Difference]: Without dead ends: 10725 [2022-07-19 17:43:21,597 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-19 17:43:21,598 INFO L413 NwaCegarLoop]: 265 mSDtfsCounter, 233 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 17:43:21,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 492 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 17:43:21,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10725 states. [2022-07-19 17:43:22,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10725 to 10693. [2022-07-19 17:43:22,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10693 states, 8112 states have (on average 1.3037475345167653) internal successors, (10576), 8174 states have internal predecessors, (10576), 1665 states have call successors, (1665), 915 states have call predecessors, (1665), 915 states have return successors, (1665), 1603 states have call predecessors, (1665), 1665 states have call successors, (1665) [2022-07-19 17:43:22,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10693 states to 10693 states and 13906 transitions. [2022-07-19 17:43:22,887 INFO L78 Accepts]: Start accepts. Automaton has 10693 states and 13906 transitions. Word has length 207 [2022-07-19 17:43:22,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:43:22,949 INFO L495 AbstractCegarLoop]: Abstraction has 10693 states and 13906 transitions. [2022-07-19 17:43:22,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-19 17:43:22,950 INFO L276 IsEmpty]: Start isEmpty. Operand 10693 states and 13906 transitions. [2022-07-19 17:43:22,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-07-19 17:43:22,962 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:43:22,962 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:43:22,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-07-19 17:43:22,962 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:43:22,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:43:22,962 INFO L85 PathProgramCache]: Analyzing trace with hash 147970794, now seen corresponding path program 1 times [2022-07-19 17:43:22,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:43:22,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148235185] [2022-07-19 17:43:22,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:43:22,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:43:22,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:23,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 17:43:23,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:23,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 17:43:23,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:23,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-19 17:43:23,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:23,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-19 17:43:23,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:23,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-19 17:43:23,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:23,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-19 17:43:23,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:23,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-19 17:43:23,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:23,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-19 17:43:23,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:23,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-19 17:43:23,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:23,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-19 17:43:23,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:23,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-19 17:43:23,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:23,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-19 17:43:23,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:23,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-19 17:43:23,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:23,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-19 17:43:23,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:23,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-19 17:43:23,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:23,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-07-19 17:43:23,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:23,082 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-19 17:43:23,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:43:23,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148235185] [2022-07-19 17:43:23,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148235185] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:43:23,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009237146] [2022-07-19 17:43:23,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:43:23,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:43:23,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:43:23,088 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-19 17:43:23,090 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-19 17:43:23,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:23,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 842 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-19 17:43:23,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:43:23,502 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-19 17:43:23,502 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 17:43:23,714 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-19 17:43:23,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1009237146] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 17:43:23,714 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 17:43:23,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 10 [2022-07-19 17:43:23,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388155515] [2022-07-19 17:43:23,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 17:43:23,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 17:43:23,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:43:23,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 17:43:23,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-19 17:43:23,716 INFO L87 Difference]: Start difference. First operand 10693 states and 13906 transitions. Second operand has 10 states, 10 states have (on average 18.8) internal successors, (188), 9 states have internal predecessors, (188), 4 states have call successors, (34), 5 states have call predecessors, (34), 7 states have return successors, (33), 4 states have call predecessors, (33), 3 states have call successors, (33) [2022-07-19 17:43:26,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:43:26,795 INFO L93 Difference]: Finished difference Result 33530 states and 43784 transitions. [2022-07-19 17:43:26,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-19 17:43:26,796 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 18.8) internal successors, (188), 9 states have internal predecessors, (188), 4 states have call successors, (34), 5 states have call predecessors, (34), 7 states have return successors, (33), 4 states have call predecessors, (33), 3 states have call successors, (33) Word has length 208 [2022-07-19 17:43:26,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:43:26,838 INFO L225 Difference]: With dead ends: 33530 [2022-07-19 17:43:26,838 INFO L226 Difference]: Without dead ends: 23272 [2022-07-19 17:43:26,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 466 GetRequests, 447 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2022-07-19 17:43:26,860 INFO L413 NwaCegarLoop]: 403 mSDtfsCounter, 784 mSDsluCounter, 2226 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 789 SdHoareTripleChecker+Valid, 2629 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 17:43:26,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [789 Valid, 2629 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 17:43:26,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23272 states. [2022-07-19 17:43:29,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23272 to 16703. [2022-07-19 17:43:29,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16703 states, 12786 states have (on average 1.288596902862506) internal successors, (16476), 12901 states have internal predecessors, (16476), 2494 states have call successors, (2494), 1422 states have call predecessors, (2494), 1422 states have return successors, (2494), 2379 states have call predecessors, (2494), 2494 states have call successors, (2494) [2022-07-19 17:43:29,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16703 states to 16703 states and 21464 transitions. [2022-07-19 17:43:29,122 INFO L78 Accepts]: Start accepts. Automaton has 16703 states and 21464 transitions. Word has length 208 [2022-07-19 17:43:29,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:43:29,123 INFO L495 AbstractCegarLoop]: Abstraction has 16703 states and 21464 transitions. [2022-07-19 17:43:29,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.8) internal successors, (188), 9 states have internal predecessors, (188), 4 states have call successors, (34), 5 states have call predecessors, (34), 7 states have return successors, (33), 4 states have call predecessors, (33), 3 states have call successors, (33) [2022-07-19 17:43:29,123 INFO L276 IsEmpty]: Start isEmpty. Operand 16703 states and 21464 transitions. [2022-07-19 17:43:29,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-07-19 17:43:29,130 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:43:29,131 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:43:29,148 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-19 17:43:29,331 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-19 17:43:29,331 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:43:29,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:43:29,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1640642370, now seen corresponding path program 1 times [2022-07-19 17:43:29,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:43:29,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896098603] [2022-07-19 17:43:29,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:43:29,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:43:29,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:29,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 17:43:29,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:29,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 17:43:29,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:29,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 17:43:29,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:29,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 17:43:29,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:29,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-19 17:43:29,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:29,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-19 17:43:29,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:29,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-19 17:43:29,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:29,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-19 17:43:29,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:29,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-19 17:43:29,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:29,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-19 17:43:29,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:29,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-19 17:43:29,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:29,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-19 17:43:29,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:29,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-19 17:43:29,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:29,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-19 17:43:29,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:29,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-19 17:43:29,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:29,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-19 17:43:29,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:29,465 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-19 17:43:29,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:43:29,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896098603] [2022-07-19 17:43:29,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896098603] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:43:29,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790944509] [2022-07-19 17:43:29,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:43:29,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:43:29,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:43:29,468 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-19 17:43:29,469 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-19 17:43:29,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:29,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 842 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-19 17:43:29,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:43:29,748 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-19 17:43:29,748 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 17:43:29,880 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-19 17:43:29,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790944509] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 17:43:29,881 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 17:43:29,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2022-07-19 17:43:29,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455739316] [2022-07-19 17:43:29,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 17:43:29,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 17:43:29,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:43:29,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 17:43:29,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-19 17:43:29,883 INFO L87 Difference]: Start difference. First operand 16703 states and 21464 transitions. Second operand has 9 states, 9 states have (on average 20.333333333333332) internal successors, (183), 8 states have internal predecessors, (183), 3 states have call successors, (30), 4 states have call predecessors, (30), 7 states have return successors, (31), 4 states have call predecessors, (31), 3 states have call successors, (31) [2022-07-19 17:43:33,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:43:33,220 INFO L93 Difference]: Finished difference Result 38927 states and 51697 transitions. [2022-07-19 17:43:33,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 17:43:33,221 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 20.333333333333332) internal successors, (183), 8 states have internal predecessors, (183), 3 states have call successors, (30), 4 states have call predecessors, (30), 7 states have return successors, (31), 4 states have call predecessors, (31), 3 states have call successors, (31) Word has length 208 [2022-07-19 17:43:33,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:43:33,266 INFO L225 Difference]: With dead ends: 38927 [2022-07-19 17:43:33,266 INFO L226 Difference]: Without dead ends: 22530 [2022-07-19 17:43:33,283 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 445 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-07-19 17:43:33,284 INFO L413 NwaCegarLoop]: 425 mSDtfsCounter, 284 mSDsluCounter, 1865 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 2290 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 17:43:33,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 2290 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 17:43:33,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22530 states. [2022-07-19 17:43:35,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22530 to 16703. [2022-07-19 17:43:35,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16703 states, 12786 states have (on average 1.2882058501486) internal successors, (16471), 12901 states have internal predecessors, (16471), 2494 states have call successors, (2494), 1422 states have call predecessors, (2494), 1422 states have return successors, (2494), 2379 states have call predecessors, (2494), 2494 states have call successors, (2494) [2022-07-19 17:43:35,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16703 states to 16703 states and 21459 transitions. [2022-07-19 17:43:35,653 INFO L78 Accepts]: Start accepts. Automaton has 16703 states and 21459 transitions. Word has length 208 [2022-07-19 17:43:35,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:43:35,653 INFO L495 AbstractCegarLoop]: Abstraction has 16703 states and 21459 transitions. [2022-07-19 17:43:35,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 20.333333333333332) internal successors, (183), 8 states have internal predecessors, (183), 3 states have call successors, (30), 4 states have call predecessors, (30), 7 states have return successors, (31), 4 states have call predecessors, (31), 3 states have call successors, (31) [2022-07-19 17:43:35,654 INFO L276 IsEmpty]: Start isEmpty. Operand 16703 states and 21459 transitions. [2022-07-19 17:43:35,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2022-07-19 17:43:35,663 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:43:35,664 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:43:35,690 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-19 17:43:35,879 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-19 17:43:35,880 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:43:35,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:43:35,880 INFO L85 PathProgramCache]: Analyzing trace with hash 2029022934, now seen corresponding path program 1 times [2022-07-19 17:43:35,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:43:35,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669659886] [2022-07-19 17:43:35,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:43:35,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:43:35,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:36,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 17:43:36,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:36,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 17:43:36,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:36,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 17:43:36,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:36,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 17:43:36,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:36,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-19 17:43:36,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:36,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-19 17:43:36,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:36,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-19 17:43:36,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:36,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-19 17:43:36,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:36,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-19 17:43:36,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:36,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-19 17:43:36,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:36,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-19 17:43:36,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:36,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-19 17:43:36,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:36,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-19 17:43:36,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:36,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-19 17:43:36,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:36,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-19 17:43:36,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:36,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-19 17:43:36,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:36,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-07-19 17:43:36,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:36,164 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-19 17:43:36,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:43:36,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669659886] [2022-07-19 17:43:36,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669659886] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:43:36,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269957876] [2022-07-19 17:43:36,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:43:36,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:43:36,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:43:36,168 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-19 17:43:36,197 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-19 17:43:36,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:36,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 859 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-19 17:43:36,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:43:37,094 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-19 17:43:37,095 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 17:43:37,853 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-19 17:43:37,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269957876] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 17:43:37,853 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 17:43:37,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 10] total 22 [2022-07-19 17:43:37,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812533036] [2022-07-19 17:43:37,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 17:43:37,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-19 17:43:37,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:43:37,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-19 17:43:37,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2022-07-19 17:43:37,855 INFO L87 Difference]: Start difference. First operand 16703 states and 21459 transitions. Second operand has 22 states, 22 states have (on average 16.954545454545453) internal successors, (373), 22 states have internal predecessors, (373), 10 states have call successors, (47), 5 states have call predecessors, (47), 5 states have return successors, (46), 10 states have call predecessors, (46), 10 states have call successors, (46) [2022-07-19 17:43:44,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:43:44,227 INFO L93 Difference]: Finished difference Result 39985 states and 53432 transitions. [2022-07-19 17:43:44,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-07-19 17:43:44,228 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 16.954545454545453) internal successors, (373), 22 states have internal predecessors, (373), 10 states have call successors, (47), 5 states have call predecessors, (47), 5 states have return successors, (46), 10 states have call predecessors, (46), 10 states have call successors, (46) Word has length 215 [2022-07-19 17:43:44,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:43:44,305 INFO L225 Difference]: With dead ends: 39985 [2022-07-19 17:43:44,306 INFO L226 Difference]: Without dead ends: 26697 [2022-07-19 17:43:44,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 504 GetRequests, 452 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 603 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=643, Invalid=1907, Unknown=0, NotChecked=0, Total=2550 [2022-07-19 17:43:44,325 INFO L413 NwaCegarLoop]: 452 mSDtfsCounter, 3590 mSDsluCounter, 2589 mSDsCounter, 0 mSdLazyCounter, 2703 mSolverCounterSat, 785 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3591 SdHoareTripleChecker+Valid, 3041 SdHoareTripleChecker+Invalid, 3488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 785 IncrementalHoareTripleChecker+Valid, 2703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-19 17:43:44,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3591 Valid, 3041 Invalid, 3488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [785 Valid, 2703 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-19 17:43:44,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26697 states. [2022-07-19 17:43:46,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26697 to 14070. [2022-07-19 17:43:46,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14070 states, 10675 states have (on average 1.2816861826697892) internal successors, (13682), 10776 states have internal predecessors, (13682), 2181 states have call successors, (2181), 1213 states have call predecessors, (2181), 1213 states have return successors, (2181), 2080 states have call predecessors, (2181), 2181 states have call successors, (2181) [2022-07-19 17:43:46,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14070 states to 14070 states and 18044 transitions. [2022-07-19 17:43:46,466 INFO L78 Accepts]: Start accepts. Automaton has 14070 states and 18044 transitions. Word has length 215 [2022-07-19 17:43:46,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:43:46,467 INFO L495 AbstractCegarLoop]: Abstraction has 14070 states and 18044 transitions. [2022-07-19 17:43:46,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 16.954545454545453) internal successors, (373), 22 states have internal predecessors, (373), 10 states have call successors, (47), 5 states have call predecessors, (47), 5 states have return successors, (46), 10 states have call predecessors, (46), 10 states have call successors, (46) [2022-07-19 17:43:46,467 INFO L276 IsEmpty]: Start isEmpty. Operand 14070 states and 18044 transitions. [2022-07-19 17:43:46,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2022-07-19 17:43:46,473 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:43:46,474 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:43:46,491 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-19 17:43:46,674 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-19 17:43:46,674 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:43:46,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:43:46,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1439794329, now seen corresponding path program 1 times [2022-07-19 17:43:46,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:43:46,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346158369] [2022-07-19 17:43:46,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:43:46,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:43:46,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:46,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 17:43:46,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:46,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 17:43:46,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:46,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 17:43:46,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:46,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 17:43:46,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:46,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-19 17:43:46,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:46,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-19 17:43:46,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:46,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-19 17:43:46,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:46,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-19 17:43:46,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:46,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-19 17:43:46,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:46,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-19 17:43:46,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:46,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-19 17:43:46,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:46,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-19 17:43:46,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:46,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-19 17:43:46,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:46,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-19 17:43:46,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:46,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-19 17:43:46,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:46,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-19 17:43:46,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:46,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-07-19 17:43:46,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:46,804 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-19 17:43:46,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:43:46,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346158369] [2022-07-19 17:43:46,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346158369] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:43:46,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388669651] [2022-07-19 17:43:46,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:43:46,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:43:46,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:43:46,808 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-19 17:43:46,809 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-19 17:43:46,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:46,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 861 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-19 17:43:46,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:43:47,088 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-19 17:43:47,089 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 17:43:47,361 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-19 17:43:47,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1388669651] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 17:43:47,361 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 17:43:47,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 8] total 14 [2022-07-19 17:43:47,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618474179] [2022-07-19 17:43:47,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 17:43:47,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-19 17:43:47,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:43:47,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-19 17:43:47,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-07-19 17:43:47,363 INFO L87 Difference]: Start difference. First operand 14070 states and 18044 transitions. Second operand has 14 states, 14 states have (on average 18.428571428571427) internal successors, (258), 14 states have internal predecessors, (258), 6 states have call successors, (45), 4 states have call predecessors, (45), 4 states have return successors, (44), 6 states have call predecessors, (44), 6 states have call successors, (44) [2022-07-19 17:43:54,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:43:54,702 INFO L93 Difference]: Finished difference Result 43858 states and 59285 transitions. [2022-07-19 17:43:54,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-07-19 17:43:54,703 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 18.428571428571427) internal successors, (258), 14 states have internal predecessors, (258), 6 states have call successors, (45), 4 states have call predecessors, (45), 4 states have return successors, (44), 6 states have call predecessors, (44), 6 states have call successors, (44) Word has length 216 [2022-07-19 17:43:54,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:43:54,767 INFO L225 Difference]: With dead ends: 43858 [2022-07-19 17:43:54,767 INFO L226 Difference]: Without dead ends: 31438 [2022-07-19 17:43:54,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 549 GetRequests, 473 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2124 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=952, Invalid=5054, Unknown=0, NotChecked=0, Total=6006 [2022-07-19 17:43:54,784 INFO L413 NwaCegarLoop]: 982 mSDtfsCounter, 2474 mSDsluCounter, 6173 mSDsCounter, 0 mSdLazyCounter, 1554 mSolverCounterSat, 806 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2574 SdHoareTripleChecker+Valid, 7155 SdHoareTripleChecker+Invalid, 2360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 806 IncrementalHoareTripleChecker+Valid, 1554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-19 17:43:54,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2574 Valid, 7155 Invalid, 2360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [806 Valid, 1554 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-19 17:43:54,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31438 states. [2022-07-19 17:43:57,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31438 to 17971. [2022-07-19 17:43:57,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17971 states, 13831 states have (on average 1.2728653025811583) internal successors, (17605), 13950 states have internal predecessors, (17605), 2623 states have call successors, (2623), 1516 states have call predecessors, (2623), 1516 states have return successors, (2623), 2504 states have call predecessors, (2623), 2623 states have call successors, (2623) [2022-07-19 17:43:57,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17971 states to 17971 states and 22851 transitions. [2022-07-19 17:43:57,557 INFO L78 Accepts]: Start accepts. Automaton has 17971 states and 22851 transitions. Word has length 216 [2022-07-19 17:43:57,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:43:57,557 INFO L495 AbstractCegarLoop]: Abstraction has 17971 states and 22851 transitions. [2022-07-19 17:43:57,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 18.428571428571427) internal successors, (258), 14 states have internal predecessors, (258), 6 states have call successors, (45), 4 states have call predecessors, (45), 4 states have return successors, (44), 6 states have call predecessors, (44), 6 states have call successors, (44) [2022-07-19 17:43:57,557 INFO L276 IsEmpty]: Start isEmpty. Operand 17971 states and 22851 transitions. [2022-07-19 17:43:57,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2022-07-19 17:43:57,565 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:43:57,565 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:43:57,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-19 17:43:57,766 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-19 17:43:57,766 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:43:57,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:43:57,766 INFO L85 PathProgramCache]: Analyzing trace with hash 71333719, now seen corresponding path program 1 times [2022-07-19 17:43:57,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:43:57,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436994968] [2022-07-19 17:43:57,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:43:57,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:43:57,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:57,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 17:43:57,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:57,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 17:43:57,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:57,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 17:43:57,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:57,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 17:43:57,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:57,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-19 17:43:57,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:57,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-19 17:43:57,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:57,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-19 17:43:57,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:57,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-19 17:43:57,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:57,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-19 17:43:57,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:57,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-19 17:43:57,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:57,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-19 17:43:57,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:57,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-19 17:43:57,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:57,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-19 17:43:57,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:57,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-19 17:43:57,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:57,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-19 17:43:57,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:57,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-19 17:43:57,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:57,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-07-19 17:43:57,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:43:57,836 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-19 17:43:57,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:43:57,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436994968] [2022-07-19 17:43:57,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436994968] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:43:57,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:43:57,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 17:43:57,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948579497] [2022-07-19 17:43:57,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:43:57,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 17:43:57,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:43:57,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 17:43:57,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-19 17:43:57,839 INFO L87 Difference]: Start difference. First operand 17971 states and 22851 transitions. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-19 17:43:59,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:43:59,912 INFO L93 Difference]: Finished difference Result 30612 states and 39107 transitions. [2022-07-19 17:43:59,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 17:43:59,912 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 216 [2022-07-19 17:43:59,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:43:59,939 INFO L225 Difference]: With dead ends: 30612 [2022-07-19 17:43:59,939 INFO L226 Difference]: Without dead ends: 13650 [2022-07-19 17:43:59,958 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-19 17:43:59,959 INFO L413 NwaCegarLoop]: 261 mSDtfsCounter, 239 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 17:43:59,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 488 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 17:43:59,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13650 states. [2022-07-19 17:44:01,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13650 to 13607. [2022-07-19 17:44:01,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13607 states, 10554 states have (on average 1.2748720864127345) internal successors, (13455), 10636 states have internal predecessors, (13455), 1931 states have call successors, (1931), 1121 states have call predecessors, (1931), 1121 states have return successors, (1931), 1849 states have call predecessors, (1931), 1931 states have call successors, (1931) [2022-07-19 17:44:02,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13607 states to 13607 states and 17317 transitions. [2022-07-19 17:44:02,007 INFO L78 Accepts]: Start accepts. Automaton has 13607 states and 17317 transitions. Word has length 216 [2022-07-19 17:44:02,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:44:02,007 INFO L495 AbstractCegarLoop]: Abstraction has 13607 states and 17317 transitions. [2022-07-19 17:44:02,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-19 17:44:02,008 INFO L276 IsEmpty]: Start isEmpty. Operand 13607 states and 17317 transitions. [2022-07-19 17:44:02,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2022-07-19 17:44:02,013 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:44:02,013 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:44:02,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-07-19 17:44:02,013 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:44:02,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:44:02,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1981403120, now seen corresponding path program 1 times [2022-07-19 17:44:02,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:44:02,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045559336] [2022-07-19 17:44:02,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:44:02,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:44:02,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:44:02,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 17:44:02,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:44:02,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 17:44:02,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:44:02,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-19 17:44:02,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:44:02,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-19 17:44:02,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:44:02,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-19 17:44:02,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:44:02,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-19 17:44:02,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:44:02,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-19 17:44:02,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:44:02,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-19 17:44:02,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:44:02,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-19 17:44:02,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:44:02,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-19 17:44:02,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:44:02,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-19 17:44:02,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:44:02,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-19 17:44:02,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:44:02,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-07-19 17:44:02,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:44:02,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-19 17:44:02,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:44:02,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-19 17:44:02,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:44:02,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-19 17:44:02,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:44:02,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-07-19 17:44:02,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:44:02,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-07-19 17:44:02,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:44:02,103 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-19 17:44:02,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:44:02,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045559336] [2022-07-19 17:44:02,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045559336] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:44:02,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:44:02,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 17:44:02,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160245557] [2022-07-19 17:44:02,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:44:02,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 17:44:02,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:44:02,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 17:44:02,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-19 17:44:02,107 INFO L87 Difference]: Start difference. First operand 13607 states and 17317 transitions. Second operand has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 6 states have internal predecessors, (115), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-19 17:44:06,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:44:06,539 INFO L93 Difference]: Finished difference Result 35344 states and 45987 transitions. [2022-07-19 17:44:06,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 17:44:06,539 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 6 states have internal predecessors, (115), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) Word has length 217 [2022-07-19 17:44:06,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:44:06,582 INFO L225 Difference]: With dead ends: 35344 [2022-07-19 17:44:06,582 INFO L226 Difference]: Without dead ends: 25650 [2022-07-19 17:44:06,594 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-19 17:44:06,594 INFO L413 NwaCegarLoop]: 586 mSDtfsCounter, 615 mSDsluCounter, 2428 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 3014 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 17:44:06,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [630 Valid, 3014 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 17:44:06,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25650 states. [2022-07-19 17:44:09,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25650 to 16802. [2022-07-19 17:44:09,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16802 states, 12872 states have (on average 1.2675574891236794) internal successors, (16316), 12986 states have internal predecessors, (16316), 2488 states have call successors, (2488), 1441 states have call predecessors, (2488), 1441 states have return successors, (2488), 2374 states have call predecessors, (2488), 2488 states have call successors, (2488) [2022-07-19 17:44:09,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16802 states to 16802 states and 21292 transitions. [2022-07-19 17:44:09,201 INFO L78 Accepts]: Start accepts. Automaton has 16802 states and 21292 transitions. Word has length 217 [2022-07-19 17:44:09,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:44:09,201 INFO L495 AbstractCegarLoop]: Abstraction has 16802 states and 21292 transitions. [2022-07-19 17:44:09,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 6 states have internal predecessors, (115), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-19 17:44:09,201 INFO L276 IsEmpty]: Start isEmpty. Operand 16802 states and 21292 transitions. [2022-07-19 17:44:09,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2022-07-19 17:44:09,207 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:44:09,207 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:44:09,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-07-19 17:44:09,207 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:44:09,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:44:09,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1125932149, now seen corresponding path program 1 times [2022-07-19 17:44:09,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:44:09,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944306999] [2022-07-19 17:44:09,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:44:09,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:44:09,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:44:09,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 17:44:09,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:44:09,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 17:44:09,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:44:09,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-19 17:44:09,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:44:09,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-19 17:44:09,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:44:09,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-19 17:44:09,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:44:09,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-19 17:44:09,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:44:09,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-19 17:44:09,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:44:09,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-19 17:44:09,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:44:09,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-19 17:44:09,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:44:09,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-19 17:44:09,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:44:09,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-19 17:44:09,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:44:09,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-19 17:44:09,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:44:09,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-19 17:44:09,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:44:09,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-19 17:44:09,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:44:09,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-19 17:44:09,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:44:09,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-07-19 17:44:09,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:44:09,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-07-19 17:44:09,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:44:09,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2022-07-19 17:44:09,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:44:09,382 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-19 17:44:09,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:44:09,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944306999] [2022-07-19 17:44:09,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944306999] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:44:09,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042592184] [2022-07-19 17:44:09,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:44:09,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:44:09,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:44:09,387 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-19 17:44:09,391 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-19 17:44:09,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:44:09,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 873 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-19 17:44:09,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:44:09,686 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-19 17:44:09,687 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 17:44:09,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2042592184] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:44:09,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 17:44:09,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2022-07-19 17:44:09,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143418120] [2022-07-19 17:44:09,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:44:09,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 17:44:09,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:44:09,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 17:44:09,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2022-07-19 17:44:09,689 INFO L87 Difference]: Start difference. First operand 16802 states and 21292 transitions. Second operand has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 6 states have internal predecessors, (152), 3 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2022-07-19 17:44:13,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:44:13,245 INFO L93 Difference]: Finished difference Result 36219 states and 47080 transitions. [2022-07-19 17:44:13,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 17:44:13,246 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 6 states have internal predecessors, (152), 3 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) Word has length 218 [2022-07-19 17:44:13,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:44:13,290 INFO L225 Difference]: With dead ends: 36219 [2022-07-19 17:44:13,290 INFO L226 Difference]: Without dead ends: 20739 [2022-07-19 17:44:13,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2022-07-19 17:44:13,310 INFO L413 NwaCegarLoop]: 612 mSDtfsCounter, 674 mSDsluCounter, 1610 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 674 SdHoareTripleChecker+Valid, 2222 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 17:44:13,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [674 Valid, 2222 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 17:44:13,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20739 states. [2022-07-19 17:44:16,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20739 to 16802. [2022-07-19 17:44:16,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16802 states, 12872 states have (on average 1.2608763206960845) internal successors, (16230), 12986 states have internal predecessors, (16230), 2488 states have call successors, (2488), 1441 states have call predecessors, (2488), 1441 states have return successors, (2488), 2374 states have call predecessors, (2488), 2488 states have call successors, (2488) [2022-07-19 17:44:16,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16802 states to 16802 states and 21206 transitions. [2022-07-19 17:44:16,071 INFO L78 Accepts]: Start accepts. Automaton has 16802 states and 21206 transitions. Word has length 218 [2022-07-19 17:44:16,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:44:16,071 INFO L495 AbstractCegarLoop]: Abstraction has 16802 states and 21206 transitions. [2022-07-19 17:44:16,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 6 states have internal predecessors, (152), 3 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2022-07-19 17:44:16,071 INFO L276 IsEmpty]: Start isEmpty. Operand 16802 states and 21206 transitions. [2022-07-19 17:44:16,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2022-07-19 17:44:16,079 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:44:16,079 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:44:16,104 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-19 17:44:16,303 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-19 17:44:16,303 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:44:16,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:44:16,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1772199745, now seen corresponding path program 1 times [2022-07-19 17:44:16,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:44:16,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90951667] [2022-07-19 17:44:16,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:44:16,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:44:16,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:44:16,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 17:44:16,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:44:16,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 17:44:16,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:44:16,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 17:44:16,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:44:16,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 17:44:16,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:44:16,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-19 17:44:16,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:44:16,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-19 17:44:16,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:44:16,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-19 17:44:16,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:44:16,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-19 17:44:16,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:44:16,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-19 17:44:16,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:44:16,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-19 17:44:16,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:44:16,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-19 17:44:16,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:44:16,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-19 17:44:16,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:44:16,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-19 17:44:16,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:44:16,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-19 17:44:16,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:44:16,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-19 17:44:16,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:44:16,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-19 17:44:16,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:44:16,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-07-19 17:44:16,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:44:16,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-07-19 17:44:16,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:44:16,461 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-19 17:44:16,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:44:16,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90951667] [2022-07-19 17:44:16,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90951667] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 17:44:16,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159573348] [2022-07-19 17:44:16,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:44:16,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 17:44:16,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 17:44:16,464 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-19 17:44:16,465 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-19 17:44:16,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:44:16,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 880 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-19 17:44:16,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 17:44:16,850 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-19 17:44:16,851 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 17:44:17,058 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-19 17:44:17,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [159573348] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 17:44:17,058 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 17:44:17,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 12 [2022-07-19 17:44:17,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126332470] [2022-07-19 17:44:17,059 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 17:44:17,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-19 17:44:17,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:44:17,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-19 17:44:17,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-07-19 17:44:17,060 INFO L87 Difference]: Start difference. First operand 16802 states and 21206 transitions. Second operand has 12 states, 12 states have (on average 19.333333333333332) internal successors, (232), 11 states have internal predecessors, (232), 5 states have call successors, (37), 4 states have call predecessors, (37), 7 states have return successors, (37), 6 states have call predecessors, (37), 5 states have call successors, (37) [2022-07-19 17:44:20,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:44:20,868 INFO L93 Difference]: Finished difference Result 32039 states and 40782 transitions. [2022-07-19 17:44:20,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-19 17:44:20,868 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 19.333333333333332) internal successors, (232), 11 states have internal predecessors, (232), 5 states have call successors, (37), 4 states have call predecessors, (37), 7 states have return successors, (37), 6 states have call predecessors, (37), 5 states have call successors, (37) Word has length 224 [2022-07-19 17:44:20,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:44:20,909 INFO L225 Difference]: With dead ends: 32039 [2022-07-19 17:44:20,909 INFO L226 Difference]: Without dead ends: 19596 [2022-07-19 17:44:20,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 481 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2022-07-19 17:44:20,931 INFO L413 NwaCegarLoop]: 846 mSDtfsCounter, 1267 mSDsluCounter, 3101 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 337 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1279 SdHoareTripleChecker+Valid, 3947 SdHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 337 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-19 17:44:20,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1279 Valid, 3947 Invalid, 872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [337 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-19 17:44:20,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19596 states. [2022-07-19 17:44:23,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19596 to 16802. [2022-07-19 17:44:23,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16802 states, 12872 states have (on average 1.2569142324425109) internal successors, (16179), 12986 states have internal predecessors, (16179), 2488 states have call successors, (2488), 1441 states have call predecessors, (2488), 1441 states have return successors, (2488), 2374 states have call predecessors, (2488), 2488 states have call successors, (2488) [2022-07-19 17:44:23,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16802 states to 16802 states and 21155 transitions. [2022-07-19 17:44:23,996 INFO L78 Accepts]: Start accepts. Automaton has 16802 states and 21155 transitions. Word has length 224 [2022-07-19 17:44:23,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:44:23,997 INFO L495 AbstractCegarLoop]: Abstraction has 16802 states and 21155 transitions. [2022-07-19 17:44:23,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 19.333333333333332) internal successors, (232), 11 states have internal predecessors, (232), 5 states have call successors, (37), 4 states have call predecessors, (37), 7 states have return successors, (37), 6 states have call predecessors, (37), 5 states have call successors, (37) [2022-07-19 17:44:23,997 INFO L276 IsEmpty]: Start isEmpty. Operand 16802 states and 21155 transitions. [2022-07-19 17:44:24,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2022-07-19 17:44:24,004 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:44:24,004 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:44:24,020 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-19 17:44:24,204 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-19 17:44:24,205 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:44:24,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:44:24,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1176450, now seen corresponding path program 1 times [2022-07-19 17:44:24,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:44:24,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446455357] [2022-07-19 17:44:24,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:44:24,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:44:24,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:44:24,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 17:44:24,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:44:24,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 17:44:24,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:44:24,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 17:44:24,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:44:24,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 17:44:24,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:44:24,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-19 17:44:24,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:44:24,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-19 17:44:24,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:44:24,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-19 17:44:24,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:44:24,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-19 17:44:24,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:44:24,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-19 17:44:24,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:44:24,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-19 17:44:24,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:44:24,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-19 17:44:24,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:44:24,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-19 17:44:24,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:44:24,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-19 17:44:24,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:44:24,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-19 17:44:24,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:44:24,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-19 17:44:24,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:44:24,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-19 17:44:24,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:44:24,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-07-19 17:44:24,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:44:24,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2022-07-19 17:44:24,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 17:44:24,324 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-19 17:44:24,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 17:44:24,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446455357] [2022-07-19 17:44:24,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446455357] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 17:44:24,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 17:44:24,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 17:44:24,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399750363] [2022-07-19 17:44:24,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 17:44:24,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 17:44:24,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 17:44:24,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 17:44:24,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-19 17:44:24,326 INFO L87 Difference]: Start difference. First operand 16802 states and 21155 transitions. Second operand has 7 states, 7 states have (on average 20.285714285714285) internal successors, (142), 6 states have internal predecessors, (142), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-19 17:44:28,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 17:44:28,260 INFO L93 Difference]: Finished difference Result 32701 states and 42222 transitions. [2022-07-19 17:44:28,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 17:44:28,261 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.285714285714285) internal successors, (142), 6 states have internal predecessors, (142), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) Word has length 224 [2022-07-19 17:44:28,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 17:44:28,302 INFO L225 Difference]: With dead ends: 32701 [2022-07-19 17:44:28,303 INFO L226 Difference]: Without dead ends: 20749 [2022-07-19 17:44:28,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-07-19 17:44:28,318 INFO L413 NwaCegarLoop]: 616 mSDtfsCounter, 702 mSDsluCounter, 1996 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 2612 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 17:44:28,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [705 Valid, 2612 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 17:44:28,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20749 states. [2022-07-19 17:44:31,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20749 to 16793. [2022-07-19 17:44:31,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16793 states, 12863 states have (on average 1.2556946280027987) internal successors, (16152), 12977 states have internal predecessors, (16152), 2488 states have call successors, (2488), 1441 states have call predecessors, (2488), 1441 states have return successors, (2488), 2374 states have call predecessors, (2488), 2488 states have call successors, (2488) [2022-07-19 17:44:31,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16793 states to 16793 states and 21128 transitions. [2022-07-19 17:44:31,067 INFO L78 Accepts]: Start accepts. Automaton has 16793 states and 21128 transitions. Word has length 224 [2022-07-19 17:44:31,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 17:44:31,068 INFO L495 AbstractCegarLoop]: Abstraction has 16793 states and 21128 transitions. [2022-07-19 17:44:31,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.285714285714285) internal successors, (142), 6 states have internal predecessors, (142), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-19 17:44:31,068 INFO L276 IsEmpty]: Start isEmpty. Operand 16793 states and 21128 transitions. [2022-07-19 17:44:31,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2022-07-19 17:44:31,076 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 17:44:31,077 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 17:44:31,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-07-19 17:44:31,077 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 17:44:31,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 17:44:31,077 INFO L85 PathProgramCache]: Analyzing trace with hash 442167154, now seen corresponding path program 1 times [2022-07-19 17:44:31,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 17:44:31,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133020803] [2022-07-19 17:44:31,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 17:44:31,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 17:44:31,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 17:44:31,119 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-19 17:44:31,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 17:44:31,251 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-19 17:44:31,251 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-19 17:44:31,252 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-19 17:44:31,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-07-19 17:44:31,257 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-19 17:44:31,261 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 17:44:31,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 05:44:31 BoogieIcfgContainer [2022-07-19 17:44:31,473 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 17:44:31,474 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 17:44:31,474 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 17:44:31,474 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 17:44:31,475 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 05:42:14" (3/4) ... [2022-07-19 17:44:31,476 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-19 17:44:31,663 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-19 17:44:31,664 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 17:44:31,664 INFO L158 Benchmark]: Toolchain (without parser) took 138406.40ms. Allocated memory was 100.7MB in the beginning and 4.1GB in the end (delta: 4.0GB). Free memory was 74.7MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. [2022-07-19 17:44:31,664 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 77.6MB. Free memory is still 52.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 17:44:31,664 INFO L158 Benchmark]: CACSL2BoogieTranslator took 336.66ms. Allocated memory is still 100.7MB. Free memory was 74.4MB in the beginning and 63.3MB in the end (delta: 11.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-19 17:44:31,665 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.71ms. Allocated memory is still 100.7MB. Free memory was 63.3MB in the beginning and 60.0MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-19 17:44:31,665 INFO L158 Benchmark]: Boogie Preprocessor took 56.19ms. Allocated memory is still 100.7MB. Free memory was 60.0MB in the beginning and 57.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 17:44:31,665 INFO L158 Benchmark]: RCFGBuilder took 663.43ms. Allocated memory is still 100.7MB. Free memory was 57.5MB in the beginning and 56.2MB in the end (delta: 1.3MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. [2022-07-19 17:44:31,665 INFO L158 Benchmark]: TraceAbstraction took 137087.36ms. Allocated memory was 100.7MB in the beginning and 4.1GB in the end (delta: 4.0GB). Free memory was 55.6MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2022-07-19 17:44:31,665 INFO L158 Benchmark]: Witness Printer took 189.92ms. Allocated memory is still 4.1GB. Free memory was 2.4GB in the beginning and 2.3GB in the end (delta: 35.9MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2022-07-19 17:44:31,673 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.20ms. Allocated memory is still 77.6MB. Free memory is still 52.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 336.66ms. Allocated memory is still 100.7MB. Free memory was 74.4MB in the beginning and 63.3MB in the end (delta: 11.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.71ms. Allocated memory is still 100.7MB. Free memory was 63.3MB in the beginning and 60.0MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.19ms. Allocated memory is still 100.7MB. Free memory was 60.0MB in the beginning and 57.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 663.43ms. Allocated memory is still 100.7MB. Free memory was 57.5MB in the beginning and 56.2MB in the end (delta: 1.3MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. * TraceAbstraction took 137087.36ms. Allocated memory was 100.7MB in the beginning and 4.1GB in the end (delta: 4.0GB). Free memory was 55.6MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. * Witness Printer took 189.92ms. Allocated memory is still 4.1GB. Free memory was 2.4GB in the beginning and 2.3GB in the end (delta: 35.9MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 619]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] msg_t nomsg = (msg_t )-1; [L25] port_t cs1 ; [L26] int8_t cs1_old ; [L27] int8_t cs1_new ; [L28] port_t cs2 ; [L29] int8_t cs2_old ; [L30] int8_t cs2_new ; [L31] port_t s1s2 ; [L32] int8_t s1s2_old ; [L33] int8_t s1s2_new ; [L34] port_t s1s1 ; [L35] int8_t s1s1_old ; [L36] int8_t s1s1_new ; [L37] port_t s2s1 ; [L38] int8_t s2s1_old ; [L39] int8_t s2s1_new ; [L40] port_t s2s2 ; [L41] int8_t s2s2_old ; [L42] int8_t s2s2_new ; [L43] port_t s1p ; [L44] int8_t s1p_old ; [L45] int8_t s1p_new ; [L46] port_t s2p ; [L47] int8_t s2p_old ; [L48] int8_t s2p_new ; [L51] _Bool side1Failed ; [L52] _Bool side2Failed ; [L53] msg_t side1_written ; [L54] msg_t side2_written ; [L60] static _Bool side1Failed_History_0 ; [L61] static _Bool side1Failed_History_1 ; [L62] static _Bool side1Failed_History_2 ; [L63] static _Bool side2Failed_History_0 ; [L64] static _Bool side2Failed_History_1 ; [L65] static _Bool side2Failed_History_2 ; [L66] static int8_t active_side_History_0 ; [L67] static int8_t active_side_History_1 ; [L68] static int8_t active_side_History_2 ; [L69] static msg_t manual_selection_History_0 ; [L70] static msg_t manual_selection_History_1 ; [L71] static msg_t manual_selection_History_2 ; VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=0, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L542] int c1 ; [L543] int i2 ; [L546] c1 = 0 [L547] side1Failed = __VERIFIER_nondet_bool() [L548] side2Failed = __VERIFIER_nondet_bool() [L549] side1_written = __VERIFIER_nondet_char() [L550] side2_written = __VERIFIER_nondet_char() [L551] side1Failed_History_0 = __VERIFIER_nondet_bool() [L552] side1Failed_History_1 = __VERIFIER_nondet_bool() [L553] side1Failed_History_2 = __VERIFIER_nondet_bool() [L554] side2Failed_History_0 = __VERIFIER_nondet_bool() [L555] side2Failed_History_1 = __VERIFIER_nondet_bool() [L556] side2Failed_History_2 = __VERIFIER_nondet_bool() [L557] active_side_History_0 = __VERIFIER_nondet_char() [L558] active_side_History_1 = __VERIFIER_nondet_char() [L559] active_side_History_2 = __VERIFIER_nondet_char() [L560] manual_selection_History_0 = __VERIFIER_nondet_char() [L561] manual_selection_History_1 = __VERIFIER_nondet_char() [L562] manual_selection_History_2 = __VERIFIER_nondet_char() [L563] CALL, EXPR init() [L197] COND FALSE !((int )side1Failed_History_0 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side2_written=0] [L200] COND FALSE !((int )side2Failed_History_0 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side2_written=0, side2Failed_History_0=0] [L203] COND FALSE !((int )active_side_History_0 != -2) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side2_written=0, side2Failed_History_0=0] [L206] COND FALSE !((int )manual_selection_History_0 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side2_written=0, side2Failed_History_0=0] [L209] COND FALSE !((int )side1Failed_History_1 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side2_written=0, side2Failed_History_0=0] [L212] COND FALSE !((int )side2Failed_History_1 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0] [L215] COND FALSE !((int )active_side_History_1 != -2) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0] [L218] COND FALSE !((int )manual_selection_History_1 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0] [L221] COND FALSE !((int )side1Failed_History_2 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0] [L224] COND FALSE !((int )side2Failed_History_2 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L227] COND FALSE !((int )active_side_History_2 != -2) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L230] COND FALSE !((int )manual_selection_History_2 != 0) [L233] return (1); VAL [\result=1, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L563] RET, EXPR init() [L563] i2 = init() [L564] CALL assume_abort_if_not(i2) VAL [\old(cond)=1, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L58] COND FALSE !(!cond) VAL [\old(cond)=1, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cond=1, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L564] RET assume_abort_if_not(i2) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, c1=0, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, i2=1, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L565] cs1_old = nomsg [L566] cs1_new = nomsg [L567] cs2_old = nomsg [L568] cs2_new = nomsg [L569] s1s2_old = nomsg [L570] s1s2_new = nomsg [L571] s1s1_old = nomsg [L572] s1s1_new = nomsg [L573] s2s1_old = nomsg [L574] s2s1_new = nomsg [L575] s2s2_old = nomsg [L576] s2s2_new = nomsg [L577] s1p_old = nomsg [L578] s1p_new = nomsg [L579] s2p_old = nomsg [L580] s2p_new = nomsg [L581] i2 = 0 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, c1=0, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, i2=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L582] COND TRUE i2 < 10 [L584] CALL Console_task_each_pals_period() [L251] msg_t manual_selection ; [L252] char tmp ; [L255] tmp = __VERIFIER_nondet_char() [L256] manual_selection = tmp [L257] CALL write_manual_selection_history(manual_selection) [L167] manual_selection_History_2 = manual_selection_History_1 [L168] manual_selection_History_1 = manual_selection_History_0 [L169] manual_selection_History_0 = val VAL [\old(val)=-128, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=-128] [L257] RET write_manual_selection_history(manual_selection) [L258] EXPR manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-128, manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-128] [L258] cs1_new = manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [L259] EXPR manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-128, manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-128] [L259] cs2_new = manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L260] manual_selection = (msg_t )0 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=0, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-128] [L584] RET Console_task_each_pals_period() [L585] CALL Side1_activestandby_task_each_pals_period() [L266] int8_t side1 ; [L267] int8_t side2 ; [L268] msg_t manual_selection ; [L269] int8_t next_state ; [L272] side1 = nomsg [L273] side2 = nomsg [L274] manual_selection = (msg_t )0 [L275] side1Failed = __VERIFIER_nondet_bool() [L276] CALL write_side1_failed_history(side1Failed) [L77] side1Failed_History_2 = side1Failed_History_1 [L78] side1Failed_History_1 = side1Failed_History_0 [L79] side1Failed_History_0 = val VAL [\old(val)=-255, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=-255] [L276] RET write_side1_failed_history(side1Failed) [L277] COND TRUE \read(side1Failed) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=0, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L278] EXPR nomsg != nomsg && s1s1_new == nomsg ? nomsg : s1s1_new VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=0, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, nomsg != nomsg && s1s1_new == nomsg ? nomsg : s1s1_new=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L278] s1s1_new = nomsg != nomsg && s1s1_new == nomsg ? nomsg : s1s1_new [L279] EXPR nomsg != nomsg && s1s2_new == nomsg ? nomsg : s1s2_new VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=0, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, nomsg != nomsg && s1s2_new == nomsg ? nomsg : s1s2_new=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L279] s1s2_new = nomsg != nomsg && s1s2_new == nomsg ? nomsg : s1s2_new [L280] EXPR nomsg != nomsg && s1p_new == nomsg ? nomsg : s1p_new VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=0, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, nomsg != nomsg && s1p_new == nomsg ? nomsg : s1p_new=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L280] s1p_new = nomsg != nomsg && s1p_new == nomsg ? nomsg : s1p_new [L281] side1_written = nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=0, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L585] RET Side1_activestandby_task_each_pals_period() [L586] CALL Side2_activestandby_task_each_pals_period() [L323] int8_t side1 ; [L324] int8_t side2 ; [L325] msg_t manual_selection ; [L326] int8_t next_state ; [L329] side1 = nomsg [L330] side2 = nomsg [L331] manual_selection = (msg_t )0 [L332] side2Failed = __VERIFIER_nondet_bool() [L333] CALL write_side2_failed_history(side2Failed) [L107] side2Failed_History_2 = side2Failed_History_1 [L108] side2Failed_History_1 = side2Failed_History_0 [L109] side2Failed_History_0 = val VAL [\old(val)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=0] [L333] RET write_side2_failed_history(side2Failed) [L334] COND FALSE !(\read(side2Failed)) [L341] side1 = s1s2_old [L342] s1s2_old = nomsg [L343] side2 = s2s2_old [L344] s2s2_old = nomsg [L345] manual_selection = cs2_old [L346] cs2_old = nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L347] COND TRUE (int )side1 == (int )side2 [L348] next_state = (int8_t )0 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, next_state=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L371] EXPR next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, next_state=0, next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L371] s2s1_new = next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new [L372] EXPR next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, next_state=0, next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L372] s2s2_new = next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new [L373] EXPR next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, next_state=0, next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L373] s2p_new = next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new [L374] side2_written = next_state VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, next_state=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L586] RET Side2_activestandby_task_each_pals_period() [L587] CALL Pendulum_prism_task_each_pals_period() [L380] int8_t active_side ; [L381] int8_t tmp ; [L382] int8_t side1 ; [L383] int8_t side2 ; VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L386] CALL, EXPR read_active_side_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L148] COND TRUE (int )index == 0 [L149] return (active_side_History_0); VAL [\old(index)=0, \result=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, index=0, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L386] RET, EXPR read_active_side_history((unsigned char)0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_active_side_history((unsigned char)0)=-2, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L386] tmp = read_active_side_history((unsigned char)0) [L387] active_side = tmp [L388] side1 = nomsg [L389] side2 = nomsg [L390] side1 = s1p_old [L391] s1p_old = nomsg [L392] side2 = s2p_old [L393] s2p_old = nomsg VAL [active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L394] COND FALSE !((int )side1 == 1) VAL [active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L397] COND FALSE !((int )side2 == 1) VAL [active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L400] COND FALSE !((int )side1 == 0) VAL [active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L408] COND TRUE (int )side1 == (int )nomsg VAL [active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L409] COND FALSE !((int )side2 == 0) [L412] active_side = (int8_t )0 VAL [active_side=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L417] CALL write_active_side_history(active_side) [L137] active_side_History_2 = active_side_History_1 [L138] active_side_History_1 = active_side_History_0 [L139] active_side_History_0 = val VAL [\old(val)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=0] [L417] RET write_active_side_history(active_side) [L587] RET Pendulum_prism_task_each_pals_period() [L588] cs1_old = cs1_new [L589] cs1_new = nomsg [L590] cs2_old = cs2_new [L591] cs2_new = nomsg [L592] s1s2_old = s1s2_new [L593] s1s2_new = nomsg [L594] s1s1_old = s1s1_new [L595] s1s1_new = nomsg [L596] s2s1_old = s2s1_new [L597] s2s1_new = nomsg [L598] s2s2_old = s2s2_new [L599] s2s2_new = nomsg [L600] s1p_old = s1p_new [L601] s1p_new = nomsg [L602] s2p_old = s2p_new [L603] s2p_new = nomsg [L604] CALL, EXPR check() [L423] int tmp ; [L424] msg_t tmp___0 ; [L425] _Bool tmp___1 ; [L426] _Bool tmp___2 ; [L427] _Bool tmp___3 ; [L428] _Bool tmp___4 ; [L429] int8_t tmp___5 ; [L430] _Bool tmp___6 ; [L431] _Bool tmp___7 ; [L432] _Bool tmp___8 ; [L433] int8_t tmp___9 ; [L434] _Bool tmp___10 ; [L435] _Bool tmp___11 ; [L436] _Bool tmp___12 ; [L437] msg_t tmp___13 ; [L438] _Bool tmp___14 ; [L439] _Bool tmp___15 ; [L440] _Bool tmp___16 ; [L441] _Bool tmp___17 ; [L442] int8_t tmp___18 ; [L443] int8_t tmp___19 ; [L444] int8_t tmp___20 ; VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L447] COND FALSE !(! side1Failed) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L450] COND TRUE ! side2Failed [L451] tmp = 1 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L455] CALL assume_abort_if_not((_Bool )tmp) VAL [\old(cond)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L58] COND FALSE !(!cond) VAL [\old(cond)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cond=1, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L455] RET assume_abort_if_not((_Bool )tmp) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L456] CALL, EXPR read_manual_selection_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L178] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L181] COND TRUE (int )index == 1 [L182] return (manual_selection_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L456] RET, EXPR read_manual_selection_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_manual_selection_history((unsigned char)1)=0, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L456] tmp___0 = read_manual_selection_history((unsigned char)1) [L457] COND TRUE ! tmp___0 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0] [L458] CALL, EXPR read_side1_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L88] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L458] RET, EXPR read_side1_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side1_failed_history((unsigned char)1)=0, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0] [L458] tmp___1 = read_side1_failed_history((unsigned char)1) [L459] COND TRUE ! tmp___1 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0] [L460] CALL, EXPR read_side1_failed_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L88] COND TRUE (int )index == 0 [L89] return (side1Failed_History_0); VAL [\old(index)=0, \result=-255, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=0, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L460] RET, EXPR read_side1_failed_history((unsigned char)0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side1_failed_history((unsigned char)0)=-255, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0] [L460] tmp___2 = read_side1_failed_history((unsigned char)0) [L461] COND FALSE !(! tmp___2) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=1] [L486] CALL, EXPR read_side1_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L88] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L486] RET, EXPR read_side1_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side1_failed_history((unsigned char)1)=0, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=1] [L486] tmp___7 = read_side1_failed_history((unsigned char)1) [L487] COND FALSE !(\read(tmp___7)) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=1, tmp___7=0] [L502] CALL, EXPR read_side1_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L88] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L502] RET, EXPR read_side1_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side1_failed_history((unsigned char)1)=0, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=1, tmp___7=0] [L502] tmp___11 = read_side1_failed_history((unsigned char)1) [L503] COND TRUE ! tmp___11 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___2=1, tmp___7=0] [L504] CALL, EXPR read_side2_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L118] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L121] COND TRUE (int )index == 1 [L122] return (side2Failed_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L504] RET, EXPR read_side2_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side2_failed_history((unsigned char)1)=0, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___2=1, tmp___7=0] [L504] tmp___12 = read_side2_failed_history((unsigned char)1) [L505] COND FALSE !(\read(tmp___12)) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___12=0, tmp___2=1, tmp___7=0] [L518] CALL, EXPR read_active_side_history((unsigned char)2) VAL [\old(index)=2, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L148] COND FALSE !((int )index == 0) VAL [\old(index)=2, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=2, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L151] COND FALSE !((int )index == 1) VAL [\old(index)=2, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=2, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L154] COND TRUE (int )index == 2 [L155] return (active_side_History_2); VAL [\old(index)=2, \result=-2, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=2, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L518] RET, EXPR read_active_side_history((unsigned char)2) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_active_side_history((unsigned char)2)=-2, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___12=0, tmp___2=1, tmp___7=0] [L518] tmp___20 = read_active_side_history((unsigned char)2) [L519] COND FALSE !((int )tmp___20 > -2) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___12=0, tmp___2=1, tmp___20=-2, tmp___7=0] [L537] return (1); VAL [\result=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___12=0, tmp___2=1, tmp___20=-2, tmp___7=0] [L604] RET, EXPR check() [L604] c1 = check() [L605] CALL assert(c1) VAL [\old(arg)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L617] COND FALSE !(! arg) VAL [\old(arg)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, arg=1, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L605] RET assert(c1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, c1=1, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, i2=0, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L606] i2 ++ VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, c1=1, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, i2=1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L582] COND TRUE i2 < 10 [L584] CALL Console_task_each_pals_period() [L251] msg_t manual_selection ; [L252] char tmp ; [L255] tmp = __VERIFIER_nondet_char() [L256] manual_selection = tmp [L257] CALL write_manual_selection_history(manual_selection) [L167] manual_selection_History_2 = manual_selection_History_1 [L168] manual_selection_History_1 = manual_selection_History_0 [L169] manual_selection_History_0 = val VAL [\old(val)=127, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=127] [L257] RET write_manual_selection_history(manual_selection) [L258] EXPR manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection=127, manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new=127, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=127] [L258] cs1_new = manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [L259] EXPR manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection=127, manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new=127, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=127] [L259] cs2_new = manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L260] manual_selection = (msg_t )0 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-128, cs2=0, cs2_new=127, cs2_old=-128, manual_selection=0, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=127] [L584] RET Console_task_each_pals_period() [L585] CALL Side1_activestandby_task_each_pals_period() [L266] int8_t side1 ; [L267] int8_t side2 ; [L268] msg_t manual_selection ; [L269] int8_t next_state ; [L272] side1 = nomsg [L273] side2 = nomsg [L274] manual_selection = (msg_t )0 [L275] side1Failed = __VERIFIER_nondet_bool() [L276] CALL write_side1_failed_history(side1Failed) [L77] side1Failed_History_2 = side1Failed_History_1 [L78] side1Failed_History_1 = side1Failed_History_0 [L79] side1Failed_History_0 = val VAL [\old(val)=257, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-128, cs2=0, cs2_new=127, cs2_old=-128, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=257] [L276] RET write_side1_failed_history(side1Failed) [L277] COND TRUE \read(side1Failed) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-128, cs2=0, cs2_new=127, cs2_old=-128, manual_selection=0, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L278] EXPR nomsg != nomsg && s1s1_new == nomsg ? nomsg : s1s1_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-128, cs2=0, cs2_new=127, cs2_old=-128, manual_selection=0, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, nomsg != nomsg && s1s1_new == nomsg ? nomsg : s1s1_new=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L278] s1s1_new = nomsg != nomsg && s1s1_new == nomsg ? nomsg : s1s1_new [L279] EXPR nomsg != nomsg && s1s2_new == nomsg ? nomsg : s1s2_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-128, cs2=0, cs2_new=127, cs2_old=-128, manual_selection=0, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, nomsg != nomsg && s1s2_new == nomsg ? nomsg : s1s2_new=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L279] s1s2_new = nomsg != nomsg && s1s2_new == nomsg ? nomsg : s1s2_new [L280] EXPR nomsg != nomsg && s1p_new == nomsg ? nomsg : s1p_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-128, cs2=0, cs2_new=127, cs2_old=-128, manual_selection=0, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, nomsg != nomsg && s1p_new == nomsg ? nomsg : s1p_new=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L280] s1p_new = nomsg != nomsg && s1p_new == nomsg ? nomsg : s1p_new [L281] side1_written = nomsg VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-128, cs2=0, cs2_new=127, cs2_old=-128, manual_selection=0, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L585] RET Side1_activestandby_task_each_pals_period() [L586] CALL Side2_activestandby_task_each_pals_period() [L323] int8_t side1 ; [L324] int8_t side2 ; [L325] msg_t manual_selection ; [L326] int8_t next_state ; [L329] side1 = nomsg [L330] side2 = nomsg [L331] manual_selection = (msg_t )0 [L332] side2Failed = __VERIFIER_nondet_bool() [L333] CALL write_side2_failed_history(side2Failed) [L107] side2Failed_History_2 = side2Failed_History_1 [L108] side2Failed_History_1 = side2Failed_History_0 [L109] side2Failed_History_0 = val VAL [\old(val)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-128, cs2=0, cs2_new=127, cs2_old=-128, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=0] [L333] RET write_side2_failed_history(side2Failed) [L334] COND FALSE !(\read(side2Failed)) [L341] side1 = s1s2_old [L342] s1s2_old = nomsg [L343] side2 = s2s2_old [L344] s2s2_old = nomsg [L345] manual_selection = cs2_old [L346] cs2_old = nomsg VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-128, cs2=0, cs2_new=127, cs2_old=-1, manual_selection=-128, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L347] COND FALSE !((int )side1 == (int )side2) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-128, cs2=0, cs2_new=127, cs2_old=-1, manual_selection=-128, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L350] COND TRUE (int )side1 == (int )nomsg VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-128, cs2=0, cs2_new=127, cs2_old=-1, manual_selection=-128, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L351] COND TRUE (int )side2 != (int )nomsg [L352] next_state = (int8_t )0 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-128, cs2=0, cs2_new=127, cs2_old=-1, manual_selection=-128, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, next_state=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L371] EXPR next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-128, cs2=0, cs2_new=127, cs2_old=-1, manual_selection=-128, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, next_state=0, next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L371] s2s1_new = next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new [L372] EXPR next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-128, cs2=0, cs2_new=127, cs2_old=-1, manual_selection=-128, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, next_state=0, next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L372] s2s2_new = next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new [L373] EXPR next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-128, cs2=0, cs2_new=127, cs2_old=-1, manual_selection=-128, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, next_state=0, next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L373] s2p_new = next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new [L374] side2_written = next_state VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-128, cs2=0, cs2_new=127, cs2_old=-1, manual_selection=-128, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, next_state=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L586] RET Side2_activestandby_task_each_pals_period() [L587] CALL Pendulum_prism_task_each_pals_period() [L380] int8_t active_side ; [L381] int8_t tmp ; [L382] int8_t side1 ; [L383] int8_t side2 ; VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-128, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L386] CALL, EXPR read_active_side_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-128, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L148] COND TRUE (int )index == 0 [L149] return (active_side_History_0); VAL [\old(index)=0, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-128, cs2=0, cs2_new=127, cs2_old=-1, index=0, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L386] RET, EXPR read_active_side_history((unsigned char)0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-128, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, read_active_side_history((unsigned char)0)=0, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L386] tmp = read_active_side_history((unsigned char)0) [L387] active_side = tmp [L388] side1 = nomsg [L389] side2 = nomsg [L390] side1 = s1p_old [L391] s1p_old = nomsg [L392] side2 = s2p_old [L393] s2p_old = nomsg VAL [active_side=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-128, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=0] [L394] COND FALSE !((int )side1 == 1) VAL [active_side=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-128, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=0] [L397] COND FALSE !((int )side2 == 1) VAL [active_side=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-128, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=0] [L400] COND FALSE !((int )side1 == 0) VAL [active_side=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-128, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=0] [L408] COND TRUE (int )side1 == (int )nomsg VAL [active_side=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-128, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=0] [L409] COND TRUE (int )side2 == 0 [L410] active_side = (int8_t )2 VAL [active_side=2, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-128, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=0] [L417] CALL write_active_side_history(active_side) [L137] active_side_History_2 = active_side_History_1 [L138] active_side_History_1 = active_side_History_0 [L139] active_side_History_0 = val VAL [\old(val)=2, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=127, cs1_old=-128, cs2=0, cs2_new=127, cs2_old=-1, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=2] [L417] RET write_active_side_history(active_side) [L587] RET Pendulum_prism_task_each_pals_period() [L588] cs1_old = cs1_new [L589] cs1_new = nomsg [L590] cs2_old = cs2_new [L591] cs2_new = nomsg [L592] s1s2_old = s1s2_new [L593] s1s2_new = nomsg [L594] s1s1_old = s1s1_new [L595] s1s1_new = nomsg [L596] s2s1_old = s2s1_new [L597] s2s1_new = nomsg [L598] s2s2_old = s2s2_new [L599] s2s2_new = nomsg [L600] s1p_old = s1p_new [L601] s1p_new = nomsg [L602] s2p_old = s2p_new [L603] s2p_new = nomsg [L604] CALL, EXPR check() [L423] int tmp ; [L424] msg_t tmp___0 ; [L425] _Bool tmp___1 ; [L426] _Bool tmp___2 ; [L427] _Bool tmp___3 ; [L428] _Bool tmp___4 ; [L429] int8_t tmp___5 ; [L430] _Bool tmp___6 ; [L431] _Bool tmp___7 ; [L432] _Bool tmp___8 ; [L433] int8_t tmp___9 ; [L434] _Bool tmp___10 ; [L435] _Bool tmp___11 ; [L436] _Bool tmp___12 ; [L437] msg_t tmp___13 ; [L438] _Bool tmp___14 ; [L439] _Bool tmp___15 ; [L440] _Bool tmp___16 ; [L441] _Bool tmp___17 ; [L442] int8_t tmp___18 ; [L443] int8_t tmp___19 ; [L444] int8_t tmp___20 ; VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L447] COND FALSE !(! side1Failed) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L450] COND TRUE ! side2Failed [L451] tmp = 1 VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L455] CALL assume_abort_if_not((_Bool )tmp) VAL [\old(cond)=1, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L58] COND FALSE !(!cond) VAL [\old(cond)=1, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cond=1, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L455] RET assume_abort_if_not((_Bool )tmp) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L456] CALL, EXPR read_manual_selection_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L178] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L181] COND TRUE (int )index == 1 [L182] return (manual_selection_History_1); VAL [\old(index)=1, \result=-128, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L456] RET, EXPR read_manual_selection_history((unsigned char)1) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, read_manual_selection_history((unsigned char)1)=-128, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L456] tmp___0 = read_manual_selection_history((unsigned char)1) [L457] COND FALSE !(! tmp___0) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=-128] [L486] CALL, EXPR read_side1_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L88] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [\old(index)=1, \result=-255, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L486] RET, EXPR read_side1_failed_history((unsigned char)1) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, read_side1_failed_history((unsigned char)1)=-255, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=-128] [L486] tmp___7 = read_side1_failed_history((unsigned char)1) [L487] COND TRUE \read(tmp___7) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=-128, tmp___7=1] [L488] CALL, EXPR read_side2_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L118] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L121] COND TRUE (int )index == 1 [L122] return (side2Failed_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=1, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L488] RET, EXPR read_side2_failed_history((unsigned char)1) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, read_side2_failed_history((unsigned char)1)=0, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=-128, tmp___7=1] [L488] tmp___8 = read_side2_failed_history((unsigned char)1) [L489] COND TRUE ! tmp___8 VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=-128, tmp___7=1, tmp___8=0] [L490] CALL, EXPR read_active_side_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L148] COND TRUE (int )index == 0 [L149] return (active_side_History_0); VAL [\old(index)=0, \result=2, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=0, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L490] RET, EXPR read_active_side_history((unsigned char)0) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, read_active_side_history((unsigned char)0)=2, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=-128, tmp___7=1, tmp___8=0] [L490] tmp___5 = read_active_side_history((unsigned char)0) [L491] COND FALSE !(! ((int )tmp___5 == 2)) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=-128, tmp___5=2, tmp___7=1, tmp___8=0] [L494] CALL, EXPR read_side2_failed_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L118] COND TRUE (int )index == 0 [L119] return (side2Failed_History_0); VAL [\old(index)=0, \result=0, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, index=0, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L494] RET, EXPR read_side2_failed_history((unsigned char)0) VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, read_side2_failed_history((unsigned char)0)=0, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=-128, tmp___5=2, tmp___7=1, tmp___8=0] [L494] tmp___6 = read_side2_failed_history((unsigned char)0) [L495] COND TRUE ! tmp___6 VAL [active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=-128, tmp___5=2, tmp___6=0, tmp___7=1, tmp___8=0] [L496] COND TRUE ! ((int )side2_written == 1) [L497] return (0); VAL [\result=0, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=-128, tmp___5=2, tmp___6=0, tmp___7=1, tmp___8=0] [L604] RET, EXPR check() [L604] c1 = check() [L605] CALL assert(c1) VAL [\old(arg)=0, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L617] COND TRUE ! arg VAL [\old(arg)=0, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, arg=0, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L619] reach_error() VAL [\old(arg)=0, active_side_History_0=2, active_side_History_1=0, active_side_History_2=-2, arg=0, cs1=0, cs1_new=-1, cs1_old=127, cs2=0, cs2_new=-1, cs2_old=127, manual_selection_History_0=127, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 207 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 136.8s, OverallIterations: 45, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 85.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 44035 SdHoareTripleChecker+Valid, 22.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 43635 mSDsluCounter, 99513 SdHoareTripleChecker+Invalid, 18.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 79087 mSDsCounter, 14595 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 34438 IncrementalHoareTripleChecker+Invalid, 49033 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14595 mSolverCounterUnsat, 20426 mSDtfsCounter, 34438 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6160 GetRequests, 5296 SyntacticMatches, 18 SemanticMatches, 846 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31848 ImplicationChecksByTransitivity, 10.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17971occurred in iteration=39, InterpolantAutomatonStates: 793, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 36.5s AutomataMinimizationTime, 44 MinimizatonAttempts, 109720 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 8.6s InterpolantComputationTime, 8534 NumberOfCodeBlocks, 8534 NumberOfCodeBlocksAsserted, 56 NumberOfCheckSat, 10290 ConstructedInterpolants, 0 QuantifiedInterpolants, 33793 SizeOfPredicates, 35 NumberOfNonLiveVariables, 9143 ConjunctsInSsa, 146 ConjunctsInUnsatCore, 65 InterpolantComputations, 35 PerfectInterpolantSequences, 4133/4807 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-07-19 17:44:31,698 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