/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf -i ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-16 02:27:21,663 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-16 02:27:21,667 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-16 02:27:21,721 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-16 02:27:21,722 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-16 02:27:21,723 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-16 02:27:21,725 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-16 02:27:21,728 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-16 02:27:21,730 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-16 02:27:21,732 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-16 02:27:21,733 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-16 02:27:21,735 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-16 02:27:21,736 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-16 02:27:21,737 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-16 02:27:21,738 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-16 02:27:21,740 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-16 02:27:21,741 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-16 02:27:21,742 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-16 02:27:21,744 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-16 02:27:21,747 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-16 02:27:21,749 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-16 02:27:21,755 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-16 02:27:21,756 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-16 02:27:21,758 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-16 02:27:21,770 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-16 02:27:21,770 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-16 02:27:21,770 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-16 02:27:21,775 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-16 02:27:21,776 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-16 02:27:21,781 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-16 02:27:21,781 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-16 02:27:21,782 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-16 02:27:21,785 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-16 02:27:21,786 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-16 02:27:21,787 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-16 02:27:21,787 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-16 02:27:21,788 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-16 02:27:21,788 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-16 02:27:21,788 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-16 02:27:21,789 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-16 02:27:21,790 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-16 02:27:21,791 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-10-16 02:27:21,822 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-16 02:27:21,822 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-16 02:27:21,823 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-16 02:27:21,824 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-16 02:27:21,825 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-16 02:27:21,825 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-16 02:27:21,828 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-16 02:27:21,828 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-16 02:27:21,829 INFO L138 SettingsManager]: * Use SBE=true [2022-10-16 02:27:21,829 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-16 02:27:21,830 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-16 02:27:21,830 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-16 02:27:21,830 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-16 02:27:21,831 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-16 02:27:21,831 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-16 02:27:21,831 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-16 02:27:21,831 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-16 02:27:21,831 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-16 02:27:21,831 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-16 02:27:21,832 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-16 02:27:21,832 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-16 02:27:21,832 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-16 02:27:21,832 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-16 02:27:21,833 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-16 02:27:21,833 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-16 02:27:21,833 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 02:27:21,833 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-16 02:27:21,833 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-16 02:27:21,834 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-16 02:27:21,834 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-16 02:27:21,834 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 [2022-10-16 02:27:22,224 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-16 02:27:22,264 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-16 02:27:22,268 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-16 02:27:22,270 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-16 02:27:22,270 INFO L275 PluginConnector]: CDTParser initialized [2022-10-16 02:27:22,272 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c [2022-10-16 02:27:22,366 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b52c77698/b3e69b684424492ab142cc9ff662c91c/FLAG8917aff7f [2022-10-16 02:27:23,073 INFO L306 CDTParser]: Found 1 translation units. [2022-10-16 02:27:23,074 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c [2022-10-16 02:27:23,097 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b52c77698/b3e69b684424492ab142cc9ff662c91c/FLAG8917aff7f [2022-10-16 02:27:23,388 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b52c77698/b3e69b684424492ab142cc9ff662c91c [2022-10-16 02:27:23,391 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-16 02:27:23,397 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-16 02:27:23,402 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-16 02:27:23,402 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-16 02:27:23,407 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-16 02:27:23,409 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 02:27:23" (1/1) ... [2022-10-16 02:27:23,412 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b50b371 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:27:23, skipping insertion in model container [2022-10-16 02:27:23,412 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 02:27:23" (1/1) ... [2022-10-16 02:27:23,426 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-16 02:27:23,482 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-16 02:27:23,771 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c[14540,14553] [2022-10-16 02:27:23,774 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 02:27:23,786 INFO L203 MainTranslator]: Completed pre-run [2022-10-16 02:27:23,860 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c[14540,14553] [2022-10-16 02:27:23,861 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 02:27:23,887 INFO L208 MainTranslator]: Completed translation [2022-10-16 02:27:23,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:27:23 WrapperNode [2022-10-16 02:27:23,890 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-16 02:27:23,892 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-16 02:27:23,892 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-16 02:27:23,892 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-16 02:27:23,916 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:27:23" (1/1) ... [2022-10-16 02:27:23,945 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:27:23" (1/1) ... [2022-10-16 02:27:24,005 INFO L138 Inliner]: procedures = 32, calls = 48, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 533 [2022-10-16 02:27:24,005 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-16 02:27:24,006 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-16 02:27:24,006 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-16 02:27:24,007 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-16 02:27:24,018 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:27:23" (1/1) ... [2022-10-16 02:27:24,018 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:27:23" (1/1) ... [2022-10-16 02:27:24,025 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:27:23" (1/1) ... [2022-10-16 02:27:24,025 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:27:23" (1/1) ... [2022-10-16 02:27:24,039 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:27:23" (1/1) ... [2022-10-16 02:27:24,050 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:27:23" (1/1) ... [2022-10-16 02:27:24,054 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:27:23" (1/1) ... [2022-10-16 02:27:24,057 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:27:23" (1/1) ... [2022-10-16 02:27:24,065 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-16 02:27:24,066 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-16 02:27:24,066 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-16 02:27:24,066 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-16 02:27:24,067 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:27:23" (1/1) ... [2022-10-16 02:27:24,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 02:27:24,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 02:27:24,126 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-10-16 02:27:24,133 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-10-16 02:27:24,199 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2022-10-16 02:27:24,199 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2022-10-16 02:27:24,199 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-16 02:27:24,200 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2022-10-16 02:27:24,200 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2022-10-16 02:27:24,201 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2022-10-16 02:27:24,201 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2022-10-16 02:27:24,202 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2022-10-16 02:27:24,202 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2022-10-16 02:27:24,202 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-10-16 02:27:24,202 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-10-16 02:27:24,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-16 02:27:24,208 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2022-10-16 02:27:24,208 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2022-10-16 02:27:24,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-16 02:27:24,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-16 02:27:24,208 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2022-10-16 02:27:24,208 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2022-10-16 02:27:24,405 INFO L235 CfgBuilder]: Building ICFG [2022-10-16 02:27:24,408 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-16 02:27:25,288 INFO L276 CfgBuilder]: Performing block encoding [2022-10-16 02:27:25,308 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-16 02:27:25,308 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-10-16 02:27:25,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 02:27:25 BoogieIcfgContainer [2022-10-16 02:27:25,312 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-16 02:27:25,317 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-16 02:27:25,317 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-16 02:27:25,321 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-16 02:27:25,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 02:27:23" (1/3) ... [2022-10-16 02:27:25,323 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@764a0bec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 02:27:25, skipping insertion in model container [2022-10-16 02:27:25,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:27:23" (2/3) ... [2022-10-16 02:27:25,323 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@764a0bec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 02:27:25, skipping insertion in model container [2022-10-16 02:27:25,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 02:27:25" (3/3) ... [2022-10-16 02:27:25,325 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_1.ufo.BOUNDED-10.pals.c [2022-10-16 02:27:25,349 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-16 02:27:25,349 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-10-16 02:27:25,451 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-16 02:27:25,462 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=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3affeb29, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-16 02:27:25,464 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-10-16 02:27:25,472 INFO L276 IsEmpty]: Start isEmpty. Operand has 206 states, 165 states have (on average 1.5515151515151515) internal successors, (256), 167 states have internal predecessors, (256), 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-10-16 02:27:25,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-16 02:27:25,483 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 02:27:25,484 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 02:27:25,484 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [assertErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 02:27:25,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 02:27:25,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1359659690, now seen corresponding path program 1 times [2022-10-16 02:27:25,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 02:27:25,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346498566] [2022-10-16 02:27:25,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:27:25,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 02:27:25,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:25,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-10-16 02:27:25,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:25,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 02:27:25,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 02:27:25,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346498566] [2022-10-16 02:27:25,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346498566] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 02:27:25,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 02:27:25,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-16 02:27:25,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058710191] [2022-10-16 02:27:25,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 02:27:25,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-16 02:27:25,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 02:27:25,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-16 02:27:25,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-16 02:27:25,781 INFO L87 Difference]: Start difference. First operand has 206 states, 165 states have (on average 1.5515151515151515) internal successors, (256), 167 states have internal predecessors, (256), 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 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-16 02:27:25,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 02:27:25,828 INFO L93 Difference]: Finished difference Result 206 states and 309 transitions. [2022-10-16 02:27:25,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-16 02:27:25,831 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-10-16 02:27:25,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 02:27:25,844 INFO L225 Difference]: With dead ends: 206 [2022-10-16 02:27:25,845 INFO L226 Difference]: Without dead ends: 204 [2022-10-16 02:27:25,847 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-10-16 02:27:25,852 INFO L413 NwaCegarLoop]: 309 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, 309 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-10-16 02:27:25,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 02:27:25,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-10-16 02:27:25,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2022-10-16 02:27:25,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 164 states have (on average 1.4939024390243902) internal successors, (245), 165 states have internal predecessors, (245), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-10-16 02:27:25,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 307 transitions. [2022-10-16 02:27:25,937 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 307 transitions. Word has length 13 [2022-10-16 02:27:25,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 02:27:25,938 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 307 transitions. [2022-10-16 02:27:25,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-16 02:27:25,938 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 307 transitions. [2022-10-16 02:27:25,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-16 02:27:25,940 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 02:27:25,940 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 02:27:25,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-16 02:27:25,941 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [assertErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 02:27:25,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 02:27:25,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1160300244, now seen corresponding path program 1 times [2022-10-16 02:27:25,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 02:27:25,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477353957] [2022-10-16 02:27:25,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:27:25,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 02:27:25,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:26,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-10-16 02:27:26,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:26,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 02:27:26,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 02:27:26,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477353957] [2022-10-16 02:27:26,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477353957] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 02:27:26,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 02:27:26,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-16 02:27:26,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421250652] [2022-10-16 02:27:26,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 02:27:26,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 02:27:26,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 02:27:26,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 02:27:26,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-16 02:27:26,281 INFO L87 Difference]: Start difference. First operand 204 states and 307 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-16 02:27:26,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 02:27:26,449 INFO L93 Difference]: Finished difference Result 343 states and 526 transitions. [2022-10-16 02:27:26,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-16 02:27:26,450 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-10-16 02:27:26,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 02:27:26,458 INFO L225 Difference]: With dead ends: 343 [2022-10-16 02:27:26,459 INFO L226 Difference]: Without dead ends: 341 [2022-10-16 02:27:26,459 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-10-16 02:27:26,464 INFO L413 NwaCegarLoop]: 326 mSDtfsCounter, 167 mSDsluCounter, 1252 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 1578 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 02:27:26,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 1578 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 02:27:26,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2022-10-16 02:27:26,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 205. [2022-10-16 02:27:26,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 165 states have (on average 1.4181818181818182) internal successors, (234), 166 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-10-16 02:27:26,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 296 transitions. [2022-10-16 02:27:26,520 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 296 transitions. Word has length 13 [2022-10-16 02:27:26,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 02:27:26,521 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 296 transitions. [2022-10-16 02:27:26,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-16 02:27:26,524 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 296 transitions. [2022-10-16 02:27:26,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-10-16 02:27:26,530 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 02:27:26,531 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-10-16 02:27:26,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-16 02:27:26,531 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [assertErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 02:27:26,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 02:27:26,533 INFO L85 PathProgramCache]: Analyzing trace with hash 580303868, now seen corresponding path program 1 times [2022-10-16 02:27:26,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 02:27:26,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348529161] [2022-10-16 02:27:26,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:27:26,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 02:27:26,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:27,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 02:27:27,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:27,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 02:27:27,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 02:27:27,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348529161] [2022-10-16 02:27:27,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348529161] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 02:27:27,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 02:27:27,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 02:27:27,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059547687] [2022-10-16 02:27:27,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 02:27:27,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 02:27:27,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 02:27:27,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 02:27:27,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 02:27:27,048 INFO L87 Difference]: Start difference. First operand 205 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-10-16 02:27:27,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 02:27:27,117 INFO L93 Difference]: Finished difference Result 209 states and 299 transitions. [2022-10-16 02:27:27,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 02:27:27,117 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-10-16 02:27:27,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 02:27:27,120 INFO L225 Difference]: With dead ends: 209 [2022-10-16 02:27:27,120 INFO L226 Difference]: Without dead ends: 209 [2022-10-16 02:27:27,121 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-10-16 02:27:27,124 INFO L413 NwaCegarLoop]: 289 mSDtfsCounter, 5 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 02:27:27,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 857 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 02:27:27,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-10-16 02:27:27,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2022-10-16 02:27:27,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 168 states have (on average 1.4107142857142858) internal successors, (237), 169 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-10-16 02:27:27,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 299 transitions. [2022-10-16 02:27:27,145 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 299 transitions. Word has length 55 [2022-10-16 02:27:27,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 02:27:27,146 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 299 transitions. [2022-10-16 02:27:27,146 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-10-16 02:27:27,146 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 299 transitions. [2022-10-16 02:27:27,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-10-16 02:27:27,149 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 02:27:27,150 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 02:27:27,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-16 02:27:27,150 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [assertErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 02:27:27,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 02:27:27,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1932444078, now seen corresponding path program 1 times [2022-10-16 02:27:27,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 02:27:27,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397530761] [2022-10-16 02:27:27,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:27:27,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 02:27:27,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:27,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 02:27:27,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:27,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-10-16 02:27:27,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:27,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-10-16 02:27:27,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:27,338 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-16 02:27:27,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 02:27:27,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397530761] [2022-10-16 02:27:27,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397530761] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 02:27:27,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 02:27:27,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 02:27:27,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758775804] [2022-10-16 02:27:27,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 02:27:27,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 02:27:27,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 02:27:27,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 02:27:27,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 02:27:27,347 INFO L87 Difference]: Start difference. First operand 209 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-10-16 02:27:27,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 02:27:27,391 INFO L93 Difference]: Finished difference Result 377 states and 543 transitions. [2022-10-16 02:27:27,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 02:27:27,392 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-10-16 02:27:27,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 02:27:27,401 INFO L225 Difference]: With dead ends: 377 [2022-10-16 02:27:27,401 INFO L226 Difference]: Without dead ends: 377 [2022-10-16 02:27:27,402 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-10-16 02:27:27,414 INFO L413 NwaCegarLoop]: 340 mSDtfsCounter, 226 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 02:27:27,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 620 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 02:27:27,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-10-16 02:27:27,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 364. [2022-10-16 02:27:27,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 286 states have (on average 1.43006993006993) internal successors, (409), 288 states have internal predecessors, (409), 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-10-16 02:27:27,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 529 transitions. [2022-10-16 02:27:27,479 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 529 transitions. Word has length 71 [2022-10-16 02:27:27,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 02:27:27,482 INFO L495 AbstractCegarLoop]: Abstraction has 364 states and 529 transitions. [2022-10-16 02:27:27,482 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-10-16 02:27:27,482 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 529 transitions. [2022-10-16 02:27:27,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-10-16 02:27:27,492 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 02:27:27,492 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-10-16 02:27:27,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-16 02:27:27,493 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [assertErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 02:27:27,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 02:27:27,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1068613866, now seen corresponding path program 1 times [2022-10-16 02:27:27,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 02:27:27,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632905756] [2022-10-16 02:27:27,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:27:27,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 02:27:27,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:27,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 02:27:27,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:27,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-10-16 02:27:27,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:27,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-10-16 02:27:27,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:27,661 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-16 02:27:27,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 02:27:27,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632905756] [2022-10-16 02:27:27,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632905756] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 02:27:27,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 02:27:27,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 02:27:27,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874555646] [2022-10-16 02:27:27,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 02:27:27,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 02:27:27,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 02:27:27,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 02:27:27,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 02:27:27,678 INFO L87 Difference]: Start difference. First operand 364 states and 529 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-10-16 02:27:27,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 02:27:27,733 INFO L93 Difference]: Finished difference Result 661 states and 967 transitions. [2022-10-16 02:27:27,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 02:27:27,734 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-10-16 02:27:27,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 02:27:27,745 INFO L225 Difference]: With dead ends: 661 [2022-10-16 02:27:27,745 INFO L226 Difference]: Without dead ends: 661 [2022-10-16 02:27:27,745 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-10-16 02:27:27,754 INFO L413 NwaCegarLoop]: 373 mSDtfsCounter, 234 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 02:27:27,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 655 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 02:27:27,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2022-10-16 02:27:27,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 641. [2022-10-16 02:27:27,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 491 states have (on average 1.45010183299389) internal successors, (712), 495 states have internal predecessors, (712), 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-10-16 02:27:27,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 946 transitions. [2022-10-16 02:27:27,812 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 946 transitions. Word has length 72 [2022-10-16 02:27:27,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 02:27:27,812 INFO L495 AbstractCegarLoop]: Abstraction has 641 states and 946 transitions. [2022-10-16 02:27:27,813 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-10-16 02:27:27,813 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 946 transitions. [2022-10-16 02:27:27,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-10-16 02:27:27,817 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 02:27:27,817 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-10-16 02:27:27,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-16 02:27:27,822 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [assertErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 02:27:27,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 02:27:27,823 INFO L85 PathProgramCache]: Analyzing trace with hash -211249812, now seen corresponding path program 1 times [2022-10-16 02:27:27,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 02:27:27,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236197224] [2022-10-16 02:27:27,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:27:27,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 02:27:27,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:28,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 02:27:28,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:28,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-10-16 02:27:28,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:28,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-10-16 02:27:28,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:28,092 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-16 02:27:28,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 02:27:28,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236197224] [2022-10-16 02:27:28,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236197224] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 02:27:28,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 02:27:28,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 02:27:28,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508475001] [2022-10-16 02:27:28,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 02:27:28,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 02:27:28,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 02:27:28,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 02:27:28,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-16 02:27:28,096 INFO L87 Difference]: Start difference. First operand 641 states and 946 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-10-16 02:27:28,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 02:27:28,426 INFO L93 Difference]: Finished difference Result 1171 states and 1760 transitions. [2022-10-16 02:27:28,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 02:27:28,426 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-10-16 02:27:28,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 02:27:28,436 INFO L225 Difference]: With dead ends: 1171 [2022-10-16 02:27:28,436 INFO L226 Difference]: Without dead ends: 1171 [2022-10-16 02:27:28,436 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-10-16 02:27:28,437 INFO L413 NwaCegarLoop]: 290 mSDtfsCounter, 779 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 779 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 02:27:28,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [779 Valid, 785 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 02:27:28,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2022-10-16 02:27:28,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 765. [2022-10-16 02:27:28,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 765 states, 602 states have (on average 1.430232558139535) internal successors, (861), 606 states have internal predecessors, (861), 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-10-16 02:27:28,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 1109 transitions. [2022-10-16 02:27:28,487 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 1109 transitions. Word has length 72 [2022-10-16 02:27:28,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 02:27:28,488 INFO L495 AbstractCegarLoop]: Abstraction has 765 states and 1109 transitions. [2022-10-16 02:27:28,488 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-10-16 02:27:28,489 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1109 transitions. [2022-10-16 02:27:28,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-10-16 02:27:28,490 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 02:27:28,490 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-10-16 02:27:28,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-16 02:27:28,491 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [assertErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 02:27:28,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 02:27:28,492 INFO L85 PathProgramCache]: Analyzing trace with hash 509126145, now seen corresponding path program 1 times [2022-10-16 02:27:28,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 02:27:28,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076462096] [2022-10-16 02:27:28,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:27:28,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 02:27:28,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:28,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 02:27:28,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:28,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-10-16 02:27:28,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:28,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-10-16 02:27:28,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:28,640 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-16 02:27:28,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 02:27:28,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076462096] [2022-10-16 02:27:28,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076462096] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 02:27:28,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 02:27:28,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 02:27:28,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881093280] [2022-10-16 02:27:28,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 02:27:28,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 02:27:28,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 02:27:28,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 02:27:28,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-16 02:27:28,644 INFO L87 Difference]: Start difference. First operand 765 states and 1109 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-10-16 02:27:28,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 02:27:28,963 INFO L93 Difference]: Finished difference Result 1171 states and 1756 transitions. [2022-10-16 02:27:28,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 02:27:28,964 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-10-16 02:27:28,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 02:27:28,972 INFO L225 Difference]: With dead ends: 1171 [2022-10-16 02:27:28,973 INFO L226 Difference]: Without dead ends: 1171 [2022-10-16 02:27:28,973 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-10-16 02:27:28,974 INFO L413 NwaCegarLoop]: 291 mSDtfsCounter, 775 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 02:27:28,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 788 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 02:27:28,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2022-10-16 02:27:29,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 765. [2022-10-16 02:27:29,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 765 states, 602 states have (on average 1.4235880398671097) internal successors, (857), 606 states have internal predecessors, (857), 124 states have call successors, (124), 37 states have call predecessors, (124), 37 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2022-10-16 02:27:29,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 1105 transitions. [2022-10-16 02:27:29,020 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 1105 transitions. Word has length 73 [2022-10-16 02:27:29,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 02:27:29,021 INFO L495 AbstractCegarLoop]: Abstraction has 765 states and 1105 transitions. [2022-10-16 02:27:29,021 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-10-16 02:27:29,021 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1105 transitions. [2022-10-16 02:27:29,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-10-16 02:27:29,023 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 02:27:29,023 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 02:27:29,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-16 02:27:29,024 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [assertErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 02:27:29,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 02:27:29,024 INFO L85 PathProgramCache]: Analyzing trace with hash 346196703, now seen corresponding path program 1 times [2022-10-16 02:27:29,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 02:27:29,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125676923] [2022-10-16 02:27:29,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:27:29,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 02:27:29,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:29,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 02:27:29,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:29,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-10-16 02:27:29,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:29,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-10-16 02:27:29,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:29,304 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-16 02:27:29,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 02:27:29,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125676923] [2022-10-16 02:27:29,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125676923] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 02:27:29,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 02:27:29,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 02:27:29,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717836128] [2022-10-16 02:27:29,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 02:27:29,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 02:27:29,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 02:27:29,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 02:27:29,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 02:27:29,308 INFO L87 Difference]: Start difference. First operand 765 states and 1105 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-16 02:27:29,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 02:27:29,346 INFO L93 Difference]: Finished difference Result 785 states and 1121 transitions. [2022-10-16 02:27:29,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 02:27:29,346 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 74 [2022-10-16 02:27:29,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 02:27:29,352 INFO L225 Difference]: With dead ends: 785 [2022-10-16 02:27:29,352 INFO L226 Difference]: Without dead ends: 785 [2022-10-16 02:27:29,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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-10-16 02:27:29,353 INFO L413 NwaCegarLoop]: 291 mSDtfsCounter, 6 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 02:27:29,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 869 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 02:27:29,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2022-10-16 02:27:29,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 785. [2022-10-16 02:27:29,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 785 states, 618 states have (on average 1.412621359223301) internal successors, (873), 622 states have internal predecessors, (873), 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-10-16 02:27:29,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 1121 transitions. [2022-10-16 02:27:29,389 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 1121 transitions. Word has length 74 [2022-10-16 02:27:29,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 02:27:29,390 INFO L495 AbstractCegarLoop]: Abstraction has 785 states and 1121 transitions. [2022-10-16 02:27:29,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-16 02:27:29,390 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 1121 transitions. [2022-10-16 02:27:29,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-10-16 02:27:29,392 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 02:27:29,392 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 02:27:29,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-16 02:27:29,393 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [assertErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 02:27:29,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 02:27:29,393 INFO L85 PathProgramCache]: Analyzing trace with hash -576890646, now seen corresponding path program 1 times [2022-10-16 02:27:29,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 02:27:29,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784404976] [2022-10-16 02:27:29,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:27:29,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 02:27:29,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:29,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 02:27:29,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:29,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-10-16 02:27:29,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:29,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-10-16 02:27:29,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:29,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-10-16 02:27:29,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:29,641 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-16 02:27:29,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 02:27:29,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784404976] [2022-10-16 02:27:29,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784404976] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 02:27:29,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 02:27:29,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 02:27:29,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404524754] [2022-10-16 02:27:29,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 02:27:29,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 02:27:29,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 02:27:29,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 02:27:29,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 02:27:29,645 INFO L87 Difference]: Start difference. First operand 785 states and 1121 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-10-16 02:27:29,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 02:27:29,693 INFO L93 Difference]: Finished difference Result 805 states and 1137 transitions. [2022-10-16 02:27:29,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 02:27:29,694 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 82 [2022-10-16 02:27:29,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 02:27:29,699 INFO L225 Difference]: With dead ends: 805 [2022-10-16 02:27:29,700 INFO L226 Difference]: Without dead ends: 805 [2022-10-16 02:27:29,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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-10-16 02:27:29,703 INFO L413 NwaCegarLoop]: 288 mSDtfsCounter, 6 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 02:27:29,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 855 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 02:27:29,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2022-10-16 02:27:29,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 805. [2022-10-16 02:27:29,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 634 states have (on average 1.4022082018927444) internal successors, (889), 638 states have internal predecessors, (889), 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-10-16 02:27:29,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1137 transitions. [2022-10-16 02:27:29,736 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1137 transitions. Word has length 82 [2022-10-16 02:27:29,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 02:27:29,736 INFO L495 AbstractCegarLoop]: Abstraction has 805 states and 1137 transitions. [2022-10-16 02:27:29,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-10-16 02:27:29,737 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1137 transitions. [2022-10-16 02:27:29,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-10-16 02:27:29,739 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 02:27:29,739 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 02:27:29,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-16 02:27:29,740 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [assertErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 02:27:29,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 02:27:29,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1239749238, now seen corresponding path program 1 times [2022-10-16 02:27:29,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 02:27:29,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864711227] [2022-10-16 02:27:29,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:27:29,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 02:27:29,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:29,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 02:27:29,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:29,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-10-16 02:27:29,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:29,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-10-16 02:27:29,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:30,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-10-16 02:27:30,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:30,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-10-16 02:27:30,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:30,017 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-16 02:27:30,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 02:27:30,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864711227] [2022-10-16 02:27:30,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864711227] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 02:27:30,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 02:27:30,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 02:27:30,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686662487] [2022-10-16 02:27:30,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 02:27:30,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 02:27:30,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 02:27:30,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 02:27:30,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 02:27:30,020 INFO L87 Difference]: Start difference. First operand 805 states and 1137 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-10-16 02:27:30,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 02:27:30,066 INFO L93 Difference]: Finished difference Result 825 states and 1153 transitions. [2022-10-16 02:27:30,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 02:27:30,069 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 90 [2022-10-16 02:27:30,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 02:27:30,074 INFO L225 Difference]: With dead ends: 825 [2022-10-16 02:27:30,075 INFO L226 Difference]: Without dead ends: 825 [2022-10-16 02:27:30,075 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-10-16 02:27:30,076 INFO L413 NwaCegarLoop]: 288 mSDtfsCounter, 6 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 02:27:30,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 855 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 02:27:30,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2022-10-16 02:27:30,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 825. [2022-10-16 02:27:30,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 825 states, 650 states have (on average 1.3923076923076922) internal successors, (905), 654 states have internal predecessors, (905), 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-10-16 02:27:30,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1153 transitions. [2022-10-16 02:27:30,113 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 1153 transitions. Word has length 90 [2022-10-16 02:27:30,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 02:27:30,113 INFO L495 AbstractCegarLoop]: Abstraction has 825 states and 1153 transitions. [2022-10-16 02:27:30,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-10-16 02:27:30,115 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1153 transitions. [2022-10-16 02:27:30,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-10-16 02:27:30,117 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 02:27:30,117 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 02:27:30,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-16 02:27:30,118 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [assertErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 02:27:30,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 02:27:30,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1156710065, now seen corresponding path program 1 times [2022-10-16 02:27:30,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 02:27:30,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003827023] [2022-10-16 02:27:30,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:27:30,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 02:27:30,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:30,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 02:27:30,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:30,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-10-16 02:27:30,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:30,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-10-16 02:27:30,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:30,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-10-16 02:27:30,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:30,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-10-16 02:27:30,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:30,478 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-16 02:27:30,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 02:27:30,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003827023] [2022-10-16 02:27:30,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003827023] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 02:27:30,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 02:27:30,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 02:27:30,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561268855] [2022-10-16 02:27:30,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 02:27:30,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 02:27:30,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 02:27:30,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 02:27:30,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 02:27:30,482 INFO L87 Difference]: Start difference. First operand 825 states and 1153 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-10-16 02:27:30,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 02:27:30,524 INFO L93 Difference]: Finished difference Result 841 states and 1165 transitions. [2022-10-16 02:27:30,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 02:27:30,525 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 90 [2022-10-16 02:27:30,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 02:27:30,530 INFO L225 Difference]: With dead ends: 841 [2022-10-16 02:27:30,531 INFO L226 Difference]: Without dead ends: 841 [2022-10-16 02:27:30,531 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-10-16 02:27:30,532 INFO L413 NwaCegarLoop]: 293 mSDtfsCounter, 5 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 02:27:30,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 864 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 02:27:30,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2022-10-16 02:27:30,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 841. [2022-10-16 02:27:30,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 662 states have (on average 1.3851963746223566) internal successors, (917), 666 states have internal predecessors, (917), 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-10-16 02:27:30,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1165 transitions. [2022-10-16 02:27:30,564 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1165 transitions. Word has length 90 [2022-10-16 02:27:30,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 02:27:30,564 INFO L495 AbstractCegarLoop]: Abstraction has 841 states and 1165 transitions. [2022-10-16 02:27:30,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-10-16 02:27:30,565 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1165 transitions. [2022-10-16 02:27:30,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-10-16 02:27:30,568 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 02:27:30,569 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 02:27:30,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-16 02:27:30,569 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [assertErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 02:27:30,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 02:27:30,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1876343318, now seen corresponding path program 1 times [2022-10-16 02:27:30,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 02:27:30,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616371448] [2022-10-16 02:27:30,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:27:30,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 02:27:30,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:30,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 02:27:30,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:30,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-10-16 02:27:30,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:30,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-10-16 02:27:30,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:30,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-10-16 02:27:30,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:30,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-10-16 02:27:30,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:30,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-10-16 02:27:30,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:30,888 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-10-16 02:27:30,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 02:27:30,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616371448] [2022-10-16 02:27:30,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616371448] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 02:27:30,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 02:27:30,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 02:27:30,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758543642] [2022-10-16 02:27:30,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 02:27:30,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 02:27:30,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 02:27:30,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 02:27:30,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 02:27:30,891 INFO L87 Difference]: Start difference. First operand 841 states and 1165 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-10-16 02:27:30,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 02:27:30,928 INFO L93 Difference]: Finished difference Result 865 states and 1185 transitions. [2022-10-16 02:27:30,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 02:27:30,929 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 98 [2022-10-16 02:27:30,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 02:27:30,935 INFO L225 Difference]: With dead ends: 865 [2022-10-16 02:27:30,935 INFO L226 Difference]: Without dead ends: 865 [2022-10-16 02:27:30,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 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-10-16 02:27:30,937 INFO L413 NwaCegarLoop]: 292 mSDtfsCounter, 7 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 866 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 02:27:30,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 866 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 02:27:30,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2022-10-16 02:27:30,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 865. [2022-10-16 02:27:30,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 865 states, 682 states have (on average 1.3739002932551319) internal successors, (937), 686 states have internal predecessors, (937), 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-10-16 02:27:30,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1185 transitions. [2022-10-16 02:27:30,968 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1185 transitions. Word has length 98 [2022-10-16 02:27:30,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 02:27:30,969 INFO L495 AbstractCegarLoop]: Abstraction has 865 states and 1185 transitions. [2022-10-16 02:27:30,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-10-16 02:27:30,969 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1185 transitions. [2022-10-16 02:27:30,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-10-16 02:27:30,975 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 02:27:30,976 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 02:27:30,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-10-16 02:27:30,976 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [assertErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 02:27:30,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 02:27:30,977 INFO L85 PathProgramCache]: Analyzing trace with hash -734373445, now seen corresponding path program 1 times [2022-10-16 02:27:30,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 02:27:30,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200185633] [2022-10-16 02:27:30,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:27:30,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 02:27:31,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:31,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 02:27:31,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:31,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-10-16 02:27:31,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:31,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-10-16 02:27:31,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:31,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-10-16 02:27:31,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:31,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-10-16 02:27:31,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:31,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-10-16 02:27:31,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:31,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-10-16 02:27:31,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:31,472 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-10-16 02:27:31,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 02:27:31,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200185633] [2022-10-16 02:27:31,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200185633] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 02:27:31,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 02:27:31,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-16 02:27:31,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195947376] [2022-10-16 02:27:31,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 02:27:31,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 02:27:31,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 02:27:31,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 02:27:31,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-16 02:27:31,475 INFO L87 Difference]: Start difference. First operand 865 states and 1185 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 6 states have internal predecessors, (80), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-10-16 02:27:31,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 02:27:31,737 INFO L93 Difference]: Finished difference Result 1759 states and 2440 transitions. [2022-10-16 02:27:31,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-16 02:27:31,737 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 6 states have internal predecessors, (80), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 101 [2022-10-16 02:27:31,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 02:27:31,749 INFO L225 Difference]: With dead ends: 1759 [2022-10-16 02:27:31,749 INFO L226 Difference]: Without dead ends: 1759 [2022-10-16 02:27:31,750 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-10-16 02:27:31,751 INFO L413 NwaCegarLoop]: 417 mSDtfsCounter, 400 mSDsluCounter, 1899 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 2316 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-16 02:27:31,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 2316 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-16 02:27:31,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1759 states. [2022-10-16 02:27:31,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1759 to 1149. [2022-10-16 02:27:31,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1149 states, 893 states have (on average 1.3650615901455767) internal successors, (1219), 899 states have internal predecessors, (1219), 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-10-16 02:27:31,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 1563 transitions. [2022-10-16 02:27:31,827 INFO L78 Accepts]: Start accepts. Automaton has 1149 states and 1563 transitions. Word has length 101 [2022-10-16 02:27:31,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 02:27:31,827 INFO L495 AbstractCegarLoop]: Abstraction has 1149 states and 1563 transitions. [2022-10-16 02:27:31,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 6 states have internal predecessors, (80), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-10-16 02:27:31,828 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 1563 transitions. [2022-10-16 02:27:31,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-10-16 02:27:31,831 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 02:27:31,831 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 02:27:31,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-10-16 02:27:31,832 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [assertErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 02:27:31,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 02:27:31,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1534750961, now seen corresponding path program 1 times [2022-10-16 02:27:31,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 02:27:31,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69993613] [2022-10-16 02:27:31,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:27:31,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 02:27:31,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:32,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 02:27:32,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:32,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-10-16 02:27:32,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:32,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-10-16 02:27:32,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:32,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-10-16 02:27:32,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:32,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-10-16 02:27:32,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:32,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-10-16 02:27:32,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:32,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-10-16 02:27:32,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:32,222 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-10-16 02:27:32,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 02:27:32,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69993613] [2022-10-16 02:27:32,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69993613] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 02:27:32,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 02:27:32,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-16 02:27:32,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534168393] [2022-10-16 02:27:32,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 02:27:32,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-16 02:27:32,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 02:27:32,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-16 02:27:32,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-16 02:27:32,226 INFO L87 Difference]: Start difference. First operand 1149 states and 1563 transitions. Second operand has 6 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-10-16 02:27:32,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 02:27:32,328 INFO L93 Difference]: Finished difference Result 1615 states and 2290 transitions. [2022-10-16 02:27:32,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-16 02:27:32,328 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 104 [2022-10-16 02:27:32,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 02:27:32,339 INFO L225 Difference]: With dead ends: 1615 [2022-10-16 02:27:32,341 INFO L226 Difference]: Without dead ends: 1615 [2022-10-16 02:27:32,342 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-10-16 02:27:32,344 INFO L413 NwaCegarLoop]: 515 mSDtfsCounter, 261 mSDsluCounter, 1736 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 2251 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 02:27:32,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 2251 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 02:27:32,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1615 states. [2022-10-16 02:27:32,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1615 to 1157. [2022-10-16 02:27:32,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1157 states, 897 states have (on average 1.3634336677814938) internal successors, (1223), 905 states have internal predecessors, (1223), 174 states have call successors, (174), 84 states have call predecessors, (174), 84 states have return successors, (174), 167 states have call predecessors, (174), 174 states have call successors, (174) [2022-10-16 02:27:32,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1571 transitions. [2022-10-16 02:27:32,410 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1571 transitions. Word has length 104 [2022-10-16 02:27:32,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 02:27:32,410 INFO L495 AbstractCegarLoop]: Abstraction has 1157 states and 1571 transitions. [2022-10-16 02:27:32,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-10-16 02:27:32,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1571 transitions. [2022-10-16 02:27:32,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-10-16 02:27:32,413 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 02:27:32,413 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 02:27:32,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-10-16 02:27:32,414 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [assertErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 02:27:32,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 02:27:32,414 INFO L85 PathProgramCache]: Analyzing trace with hash -673396995, now seen corresponding path program 1 times [2022-10-16 02:27:32,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 02:27:32,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829197097] [2022-10-16 02:27:32,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:27:32,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 02:27:32,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:32,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 02:27:32,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:32,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-10-16 02:27:32,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:32,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-10-16 02:27:32,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:32,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-10-16 02:27:32,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:32,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-10-16 02:27:32,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:32,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-10-16 02:27:32,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:32,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-10-16 02:27:32,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:32,637 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-10-16 02:27:32,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 02:27:32,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829197097] [2022-10-16 02:27:32,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829197097] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 02:27:32,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 02:27:32,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 02:27:32,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393811598] [2022-10-16 02:27:32,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 02:27:32,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 02:27:32,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 02:27:32,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 02:27:32,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 02:27:32,641 INFO L87 Difference]: Start difference. First operand 1157 states and 1571 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-10-16 02:27:32,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 02:27:32,683 INFO L93 Difference]: Finished difference Result 1181 states and 1589 transitions. [2022-10-16 02:27:32,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 02:27:32,684 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 105 [2022-10-16 02:27:32,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 02:27:32,691 INFO L225 Difference]: With dead ends: 1181 [2022-10-16 02:27:32,691 INFO L226 Difference]: Without dead ends: 1181 [2022-10-16 02:27:32,693 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-10-16 02:27:32,694 INFO L413 NwaCegarLoop]: 293 mSDtfsCounter, 5 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 02:27:32,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 864 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 02:27:32,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2022-10-16 02:27:32,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 1181. [2022-10-16 02:27:32,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1181 states, 915 states have (on average 1.3562841530054646) internal successors, (1241), 923 states have internal predecessors, (1241), 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-10-16 02:27:32,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1181 states to 1181 states and 1589 transitions. [2022-10-16 02:27:32,778 INFO L78 Accepts]: Start accepts. Automaton has 1181 states and 1589 transitions. Word has length 105 [2022-10-16 02:27:32,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 02:27:32,779 INFO L495 AbstractCegarLoop]: Abstraction has 1181 states and 1589 transitions. [2022-10-16 02:27:32,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-10-16 02:27:32,779 INFO L276 IsEmpty]: Start isEmpty. Operand 1181 states and 1589 transitions. [2022-10-16 02:27:32,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-10-16 02:27:32,782 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 02:27:32,782 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 02:27:32,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-10-16 02:27:32,782 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [assertErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 02:27:32,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 02:27:32,783 INFO L85 PathProgramCache]: Analyzing trace with hash -151633972, now seen corresponding path program 1 times [2022-10-16 02:27:32,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 02:27:32,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65894823] [2022-10-16 02:27:32,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:27:32,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 02:27:32,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:32,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 02:27:32,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:32,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-10-16 02:27:32,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:32,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-10-16 02:27:32,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:32,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-10-16 02:27:32,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:32,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-10-16 02:27:32,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:32,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-10-16 02:27:32,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:32,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-10-16 02:27:33,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:33,018 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-10-16 02:27:33,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 02:27:33,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65894823] [2022-10-16 02:27:33,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65894823] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 02:27:33,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 02:27:33,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-16 02:27:33,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201891390] [2022-10-16 02:27:33,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 02:27:33,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 02:27:33,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 02:27:33,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 02:27:33,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-16 02:27:33,023 INFO L87 Difference]: Start difference. First operand 1181 states and 1589 transitions. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 6 states have internal predecessors, (83), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-10-16 02:27:33,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 02:27:33,202 INFO L93 Difference]: Finished difference Result 1534 states and 2089 transitions. [2022-10-16 02:27:33,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-16 02:27:33,203 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 6 states have internal predecessors, (83), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 107 [2022-10-16 02:27:33,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 02:27:33,212 INFO L225 Difference]: With dead ends: 1534 [2022-10-16 02:27:33,212 INFO L226 Difference]: Without dead ends: 1534 [2022-10-16 02:27:33,212 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-10-16 02:27:33,213 INFO L413 NwaCegarLoop]: 410 mSDtfsCounter, 522 mSDsluCounter, 1854 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 2264 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 02:27:33,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 2264 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 02:27:33,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1534 states. [2022-10-16 02:27:33,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1534 to 1227. [2022-10-16 02:27:33,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1227 states, 972 states have (on average 1.3477366255144032) internal successors, (1310), 985 states have internal predecessors, (1310), 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-10-16 02:27:33,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1227 states to 1227 states and 1634 transitions. [2022-10-16 02:27:33,266 INFO L78 Accepts]: Start accepts. Automaton has 1227 states and 1634 transitions. Word has length 107 [2022-10-16 02:27:33,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 02:27:33,266 INFO L495 AbstractCegarLoop]: Abstraction has 1227 states and 1634 transitions. [2022-10-16 02:27:33,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 6 states have internal predecessors, (83), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-10-16 02:27:33,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1227 states and 1634 transitions. [2022-10-16 02:27:33,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-10-16 02:27:33,269 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 02:27:33,269 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 02:27:33,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-10-16 02:27:33,269 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [assertErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 02:27:33,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 02:27:33,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1445613889, now seen corresponding path program 1 times [2022-10-16 02:27:33,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 02:27:33,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849857147] [2022-10-16 02:27:33,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:27:33,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 02:27:33,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:33,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 02:27:33,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:33,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-10-16 02:27:33,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:33,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-10-16 02:27:33,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:33,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-10-16 02:27:33,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:33,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-10-16 02:27:33,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:33,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-10-16 02:27:33,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:33,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-10-16 02:27:33,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:33,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-10-16 02:27:33,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:33,736 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-10-16 02:27:33,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 02:27:33,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849857147] [2022-10-16 02:27:33,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849857147] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 02:27:33,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 02:27:33,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-16 02:27:33,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078080129] [2022-10-16 02:27:33,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 02:27:33,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 02:27:33,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 02:27:33,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 02:27:33,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-16 02:27:33,741 INFO L87 Difference]: Start difference. First operand 1227 states and 1634 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 6 states have internal predecessors, (82), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-10-16 02:27:34,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 02:27:34,001 INFO L93 Difference]: Finished difference Result 1578 states and 2155 transitions. [2022-10-16 02:27:34,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-16 02:27:34,002 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 6 states have internal predecessors, (82), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 109 [2022-10-16 02:27:34,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 02:27:34,016 INFO L225 Difference]: With dead ends: 1578 [2022-10-16 02:27:34,016 INFO L226 Difference]: Without dead ends: 1578 [2022-10-16 02:27:34,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-10-16 02:27:34,019 INFO L413 NwaCegarLoop]: 440 mSDtfsCounter, 404 mSDsluCounter, 1974 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 2414 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 02:27:34,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 2414 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 02:27:34,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1578 states. [2022-10-16 02:27:34,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1578 to 1113. [2022-10-16 02:27:34,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1113 states, 885 states have (on average 1.3480225988700565) internal successors, (1193), 896 states have internal predecessors, (1193), 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-10-16 02:27:34,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 1483 transitions. [2022-10-16 02:27:34,072 INFO L78 Accepts]: Start accepts. Automaton has 1113 states and 1483 transitions. Word has length 109 [2022-10-16 02:27:34,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 02:27:34,073 INFO L495 AbstractCegarLoop]: Abstraction has 1113 states and 1483 transitions. [2022-10-16 02:27:34,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 6 states have internal predecessors, (82), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-10-16 02:27:34,073 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1483 transitions. [2022-10-16 02:27:34,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-10-16 02:27:34,075 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 02:27:34,075 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, 1, 1, 1] [2022-10-16 02:27:34,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-10-16 02:27:34,075 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [assertErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 02:27:34,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 02:27:34,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1143093796, now seen corresponding path program 1 times [2022-10-16 02:27:34,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 02:27:34,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647841180] [2022-10-16 02:27:34,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:27:34,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 02:27:34,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:34,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 02:27:34,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:34,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-10-16 02:27:34,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:34,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-10-16 02:27:34,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:34,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-10-16 02:27:34,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:34,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-10-16 02:27:34,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:34,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-10-16 02:27:34,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:34,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-10-16 02:27:34,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:34,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-10-16 02:27:34,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:34,260 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-10-16 02:27:34,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 02:27:34,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647841180] [2022-10-16 02:27:34,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647841180] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 02:27:34,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942993857] [2022-10-16 02:27:34,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:27:34,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 02:27:34,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 02:27:34,267 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-10-16 02:27:34,290 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-10-16 02:27:34,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:34,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 2 conjunts are in the unsatisfiable core [2022-10-16 02:27:34,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 02:27:34,644 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-10-16 02:27:34,644 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 02:27:34,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942993857] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 02:27:34,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 02:27:34,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-10-16 02:27:34,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955386680] [2022-10-16 02:27:34,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 02:27:34,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 02:27:34,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 02:27:34,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 02:27:34,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-16 02:27:34,647 INFO L87 Difference]: Start difference. First operand 1113 states and 1483 transitions. Second operand has 3 states, 2 states have (on average 42.0) internal successors, (84), 3 states have internal predecessors, (84), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-10-16 02:27:34,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 02:27:34,697 INFO L93 Difference]: Finished difference Result 1112 states and 1482 transitions. [2022-10-16 02:27:34,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 02:27:34,697 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 42.0) internal successors, (84), 3 states have internal predecessors, (84), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 109 [2022-10-16 02:27:34,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 02:27:34,704 INFO L225 Difference]: With dead ends: 1112 [2022-10-16 02:27:34,704 INFO L226 Difference]: Without dead ends: 1110 [2022-10-16 02:27:34,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-16 02:27:34,705 INFO L413 NwaCegarLoop]: 294 mSDtfsCounter, 120 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 02:27:34,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 351 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 02:27:34,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2022-10-16 02:27:34,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 1110. [2022-10-16 02:27:34,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1110 states, 883 states have (on average 1.345413363533409) internal successors, (1188), 893 states have internal predecessors, (1188), 145 states have call successors, (145), 81 states have call predecessors, (145), 81 states have return successors, (145), 135 states have call predecessors, (145), 145 states have call successors, (145) [2022-10-16 02:27:34,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1478 transitions. [2022-10-16 02:27:34,755 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 1478 transitions. Word has length 109 [2022-10-16 02:27:34,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 02:27:34,755 INFO L495 AbstractCegarLoop]: Abstraction has 1110 states and 1478 transitions. [2022-10-16 02:27:34,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 42.0) internal successors, (84), 3 states have internal predecessors, (84), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-10-16 02:27:34,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1478 transitions. [2022-10-16 02:27:34,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-10-16 02:27:34,757 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 02:27:34,758 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 02:27:34,800 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-10-16 02:27:34,971 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,SelfDestructingSolverStorable17 [2022-10-16 02:27:34,972 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [assertErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 02:27:34,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 02:27:34,973 INFO L85 PathProgramCache]: Analyzing trace with hash -464789652, now seen corresponding path program 1 times [2022-10-16 02:27:34,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 02:27:34,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221324528] [2022-10-16 02:27:34,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:27:34,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 02:27:35,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:35,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 02:27:35,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:35,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-10-16 02:27:35,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:35,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-10-16 02:27:35,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:35,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-10-16 02:27:35,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:35,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-10-16 02:27:35,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:35,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-10-16 02:27:35,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:35,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-10-16 02:27:35,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:35,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-10-16 02:27:35,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:35,378 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-10-16 02:27:35,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 02:27:35,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221324528] [2022-10-16 02:27:35,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221324528] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 02:27:35,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 02:27:35,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-10-16 02:27:35,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117087548] [2022-10-16 02:27:35,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 02:27:35,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-16 02:27:35,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 02:27:35,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-16 02:27:35,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-10-16 02:27:35,381 INFO L87 Difference]: Start difference. First operand 1110 states and 1478 transitions. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 7 states have internal predecessors, (87), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-10-16 02:27:36,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 02:27:36,079 INFO L93 Difference]: Finished difference Result 1671 states and 2285 transitions. [2022-10-16 02:27:36,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-16 02:27:36,080 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 7 states have internal predecessors, (87), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 110 [2022-10-16 02:27:36,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 02:27:36,090 INFO L225 Difference]: With dead ends: 1671 [2022-10-16 02:27:36,091 INFO L226 Difference]: Without dead ends: 1671 [2022-10-16 02:27:36,091 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-10-16 02:27:36,092 INFO L413 NwaCegarLoop]: 501 mSDtfsCounter, 1030 mSDsluCounter, 1628 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1036 SdHoareTripleChecker+Valid, 2129 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-10-16 02:27:36,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1036 Valid, 2129 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-10-16 02:27:36,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2022-10-16 02:27:36,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1126. [2022-10-16 02:27:36,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1126 states, 891 states have (on average 1.3254769921436589) internal successors, (1181), 902 states have internal predecessors, (1181), 148 states have call successors, (148), 86 states have call predecessors, (148), 86 states have return successors, (148), 137 states have call predecessors, (148), 148 states have call successors, (148) [2022-10-16 02:27:36,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 1126 states and 1477 transitions. [2022-10-16 02:27:36,139 INFO L78 Accepts]: Start accepts. Automaton has 1126 states and 1477 transitions. Word has length 110 [2022-10-16 02:27:36,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 02:27:36,139 INFO L495 AbstractCegarLoop]: Abstraction has 1126 states and 1477 transitions. [2022-10-16 02:27:36,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 7 states have internal predecessors, (87), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-10-16 02:27:36,140 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 1477 transitions. [2022-10-16 02:27:36,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-10-16 02:27:36,142 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 02:27:36,142 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 02:27:36,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-10-16 02:27:36,142 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [assertErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 02:27:36,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 02:27:36,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1318418269, now seen corresponding path program 1 times [2022-10-16 02:27:36,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 02:27:36,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292185458] [2022-10-16 02:27:36,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:27:36,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 02:27:36,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:36,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 02:27:36,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:36,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-10-16 02:27:36,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:36,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-10-16 02:27:36,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:36,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-10-16 02:27:36,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:36,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-10-16 02:27:36,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:36,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-10-16 02:27:36,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:36,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-10-16 02:27:36,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:36,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-10-16 02:27:36,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:36,309 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 02:27:36,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 02:27:36,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292185458] [2022-10-16 02:27:36,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292185458] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 02:27:36,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 02:27:36,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 02:27:36,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391881393] [2022-10-16 02:27:36,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 02:27:36,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 02:27:36,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 02:27:36,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 02:27:36,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 02:27:36,312 INFO L87 Difference]: Start difference. First operand 1126 states and 1477 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-16 02:27:36,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 02:27:36,465 INFO L93 Difference]: Finished difference Result 2272 states and 3019 transitions. [2022-10-16 02:27:36,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 02:27:36,466 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 110 [2022-10-16 02:27:36,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 02:27:36,478 INFO L225 Difference]: With dead ends: 2272 [2022-10-16 02:27:36,479 INFO L226 Difference]: Without dead ends: 2272 [2022-10-16 02:27:36,479 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-10-16 02:27:36,480 INFO L413 NwaCegarLoop]: 503 mSDtfsCounter, 434 mSDsluCounter, 708 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 1211 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 02:27:36,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 1211 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 02:27:36,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2272 states. [2022-10-16 02:27:36,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2272 to 1915. [2022-10-16 02:27:36,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1915 states, 1490 states have (on average 1.323489932885906) internal successors, (1972), 1509 states have internal predecessors, (1972), 272 states have call successors, (272), 152 states have call predecessors, (272), 152 states have return successors, (272), 253 states have call predecessors, (272), 272 states have call successors, (272) [2022-10-16 02:27:36,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1915 states to 1915 states and 2516 transitions. [2022-10-16 02:27:36,556 INFO L78 Accepts]: Start accepts. Automaton has 1915 states and 2516 transitions. Word has length 110 [2022-10-16 02:27:36,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 02:27:36,557 INFO L495 AbstractCegarLoop]: Abstraction has 1915 states and 2516 transitions. [2022-10-16 02:27:36,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-16 02:27:36,557 INFO L276 IsEmpty]: Start isEmpty. Operand 1915 states and 2516 transitions. [2022-10-16 02:27:36,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-10-16 02:27:36,559 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 02:27:36,559 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-10-16 02:27:36,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-10-16 02:27:36,560 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [assertErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 02:27:36,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 02:27:36,560 INFO L85 PathProgramCache]: Analyzing trace with hash 657976850, now seen corresponding path program 1 times [2022-10-16 02:27:36,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 02:27:36,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944559046] [2022-10-16 02:27:36,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:27:36,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 02:27:36,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:36,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 02:27:36,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:36,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-10-16 02:27:36,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:36,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-10-16 02:27:36,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:36,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-10-16 02:27:36,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:36,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-10-16 02:27:36,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:36,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-10-16 02:27:36,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:36,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-10-16 02:27:36,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:36,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-10-16 02:27:36,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:37,001 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-10-16 02:27:37,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 02:27:37,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944559046] [2022-10-16 02:27:37,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944559046] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 02:27:37,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 02:27:37,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-16 02:27:37,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882283693] [2022-10-16 02:27:37,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 02:27:37,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 02:27:37,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 02:27:37,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 02:27:37,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-16 02:27:37,008 INFO L87 Difference]: Start difference. First operand 1915 states and 2516 transitions. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 6 states have internal predecessors, (89), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-16 02:27:37,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 02:27:37,642 INFO L93 Difference]: Finished difference Result 2774 states and 3738 transitions. [2022-10-16 02:27:37,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-16 02:27:37,643 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 6 states have internal predecessors, (89), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 112 [2022-10-16 02:27:37,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 02:27:37,660 INFO L225 Difference]: With dead ends: 2774 [2022-10-16 02:27:37,660 INFO L226 Difference]: Without dead ends: 2774 [2022-10-16 02:27:37,660 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-10-16 02:27:37,662 INFO L413 NwaCegarLoop]: 570 mSDtfsCounter, 788 mSDsluCounter, 1912 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 791 SdHoareTripleChecker+Valid, 2482 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-10-16 02:27:37,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [791 Valid, 2482 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-10-16 02:27:37,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2774 states. [2022-10-16 02:27:37,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2774 to 1936. [2022-10-16 02:27:37,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1936 states, 1498 states have (on average 1.3190921228304406) internal successors, (1976), 1518 states have internal predecessors, (1976), 280 states have call successors, (280), 157 states have call predecessors, (280), 157 states have return successors, (280), 260 states have call predecessors, (280), 280 states have call successors, (280) [2022-10-16 02:27:37,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1936 states to 1936 states and 2536 transitions. [2022-10-16 02:27:37,763 INFO L78 Accepts]: Start accepts. Automaton has 1936 states and 2536 transitions. Word has length 112 [2022-10-16 02:27:37,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 02:27:37,764 INFO L495 AbstractCegarLoop]: Abstraction has 1936 states and 2536 transitions. [2022-10-16 02:27:37,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 6 states have internal predecessors, (89), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-16 02:27:37,765 INFO L276 IsEmpty]: Start isEmpty. Operand 1936 states and 2536 transitions. [2022-10-16 02:27:37,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-10-16 02:27:37,769 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 02:27:37,769 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 02:27:37,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-10-16 02:27:37,770 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [assertErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 02:27:37,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 02:27:37,770 INFO L85 PathProgramCache]: Analyzing trace with hash 512813479, now seen corresponding path program 1 times [2022-10-16 02:27:37,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 02:27:37,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553607303] [2022-10-16 02:27:37,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:27:37,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 02:27:37,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:37,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 02:27:37,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:37,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-10-16 02:27:37,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:37,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-10-16 02:27:37,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:37,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-10-16 02:27:37,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:37,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-10-16 02:27:37,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:37,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-10-16 02:27:37,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:37,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-10-16 02:27:37,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:37,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-10-16 02:27:37,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:37,949 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 02:27:37,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 02:27:37,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553607303] [2022-10-16 02:27:37,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553607303] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 02:27:37,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 02:27:37,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 02:27:37,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766508293] [2022-10-16 02:27:37,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 02:27:37,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 02:27:37,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 02:27:37,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 02:27:37,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 02:27:37,954 INFO L87 Difference]: Start difference. First operand 1936 states and 2536 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-16 02:27:38,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 02:27:38,116 INFO L93 Difference]: Finished difference Result 3560 states and 4698 transitions. [2022-10-16 02:27:38,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 02:27:38,117 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 113 [2022-10-16 02:27:38,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 02:27:38,159 INFO L225 Difference]: With dead ends: 3560 [2022-10-16 02:27:38,160 INFO L226 Difference]: Without dead ends: 3560 [2022-10-16 02:27:38,160 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-10-16 02:27:38,161 INFO L413 NwaCegarLoop]: 519 mSDtfsCounter, 481 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 1275 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 02:27:38,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 1275 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 02:27:38,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3560 states. [2022-10-16 02:27:38,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3560 to 2987. [2022-10-16 02:27:38,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2987 states, 2274 states have (on average 1.3153034300791557) internal successors, (2991), 2305 states have internal predecessors, (2991), 460 states have call successors, (460), 252 states have call predecessors, (460), 252 states have return successors, (460), 429 states have call predecessors, (460), 460 states have call successors, (460) [2022-10-16 02:27:38,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2987 states to 2987 states and 3911 transitions. [2022-10-16 02:27:38,261 INFO L78 Accepts]: Start accepts. Automaton has 2987 states and 3911 transitions. Word has length 113 [2022-10-16 02:27:38,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 02:27:38,262 INFO L495 AbstractCegarLoop]: Abstraction has 2987 states and 3911 transitions. [2022-10-16 02:27:38,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-16 02:27:38,262 INFO L276 IsEmpty]: Start isEmpty. Operand 2987 states and 3911 transitions. [2022-10-16 02:27:38,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-10-16 02:27:38,265 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 02:27:38,265 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 02:27:38,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-10-16 02:27:38,266 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [assertErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 02:27:38,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 02:27:38,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1501554839, now seen corresponding path program 1 times [2022-10-16 02:27:38,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 02:27:38,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355145939] [2022-10-16 02:27:38,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:27:38,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 02:27:38,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:38,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 02:27:38,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:38,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-10-16 02:27:38,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:38,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-10-16 02:27:38,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:38,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-10-16 02:27:38,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:38,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-10-16 02:27:38,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:38,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-10-16 02:27:38,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:38,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-10-16 02:27:38,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:38,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-10-16 02:27:38,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:38,434 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 02:27:38,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 02:27:38,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355145939] [2022-10-16 02:27:38,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355145939] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 02:27:38,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 02:27:38,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 02:27:38,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882679831] [2022-10-16 02:27:38,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 02:27:38,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 02:27:38,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 02:27:38,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 02:27:38,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 02:27:38,437 INFO L87 Difference]: Start difference. First operand 2987 states and 3911 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-16 02:27:38,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 02:27:38,635 INFO L93 Difference]: Finished difference Result 4591 states and 6005 transitions. [2022-10-16 02:27:38,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 02:27:38,636 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 113 [2022-10-16 02:27:38,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 02:27:38,660 INFO L225 Difference]: With dead ends: 4591 [2022-10-16 02:27:38,660 INFO L226 Difference]: Without dead ends: 4591 [2022-10-16 02:27:38,661 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-10-16 02:27:38,662 INFO L413 NwaCegarLoop]: 543 mSDtfsCounter, 428 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 1272 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 02:27:38,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 1272 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 02:27:38,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4591 states. [2022-10-16 02:27:38,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4591 to 4255. [2022-10-16 02:27:38,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4255 states, 3218 states have (on average 1.3132380360472342) internal successors, (4226), 3262 states have internal predecessors, (4226), 672 states have call successors, (672), 364 states have call predecessors, (672), 364 states have return successors, (672), 628 states have call predecessors, (672), 672 states have call successors, (672) [2022-10-16 02:27:38,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4255 states to 4255 states and 5570 transitions. [2022-10-16 02:27:38,834 INFO L78 Accepts]: Start accepts. Automaton has 4255 states and 5570 transitions. Word has length 113 [2022-10-16 02:27:38,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 02:27:38,835 INFO L495 AbstractCegarLoop]: Abstraction has 4255 states and 5570 transitions. [2022-10-16 02:27:38,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-16 02:27:38,836 INFO L276 IsEmpty]: Start isEmpty. Operand 4255 states and 5570 transitions. [2022-10-16 02:27:38,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-10-16 02:27:38,838 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 02:27:38,839 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-10-16 02:27:38,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-10-16 02:27:38,839 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [assertErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 02:27:38,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 02:27:38,840 INFO L85 PathProgramCache]: Analyzing trace with hash -453059177, now seen corresponding path program 1 times [2022-10-16 02:27:38,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 02:27:38,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843383894] [2022-10-16 02:27:38,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:27:38,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 02:27:38,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:38,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 02:27:38,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:38,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-10-16 02:27:38,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:38,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-10-16 02:27:38,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:38,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-10-16 02:27:38,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:38,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-10-16 02:27:38,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:38,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-10-16 02:27:38,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:38,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-10-16 02:27:38,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:38,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-10-16 02:27:38,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:38,932 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 02:27:38,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 02:27:38,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843383894] [2022-10-16 02:27:38,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843383894] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 02:27:38,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 02:27:38,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 02:27:38,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655502391] [2022-10-16 02:27:38,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 02:27:38,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 02:27:38,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 02:27:38,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 02:27:38,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 02:27:38,935 INFO L87 Difference]: Start difference. First operand 4255 states and 5570 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-16 02:27:39,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 02:27:39,091 INFO L93 Difference]: Finished difference Result 5764 states and 7946 transitions. [2022-10-16 02:27:39,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 02:27:39,092 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 114 [2022-10-16 02:27:39,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 02:27:39,116 INFO L225 Difference]: With dead ends: 5764 [2022-10-16 02:27:39,116 INFO L226 Difference]: Without dead ends: 5764 [2022-10-16 02:27:39,116 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-10-16 02:27:39,118 INFO L413 NwaCegarLoop]: 453 mSDtfsCounter, 148 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 02:27:39,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 697 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 02:27:39,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5764 states. [2022-10-16 02:27:39,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5764 to 4261. [2022-10-16 02:27:39,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4261 states, 3224 states have (on average 1.3126550868486353) internal successors, (4232), 3268 states have internal predecessors, (4232), 672 states have call successors, (672), 364 states have call predecessors, (672), 364 states have return successors, (672), 628 states have call predecessors, (672), 672 states have call successors, (672) [2022-10-16 02:27:39,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4261 states to 4261 states and 5576 transitions. [2022-10-16 02:27:39,311 INFO L78 Accepts]: Start accepts. Automaton has 4261 states and 5576 transitions. Word has length 114 [2022-10-16 02:27:39,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 02:27:39,312 INFO L495 AbstractCegarLoop]: Abstraction has 4261 states and 5576 transitions. [2022-10-16 02:27:39,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-16 02:27:39,312 INFO L276 IsEmpty]: Start isEmpty. Operand 4261 states and 5576 transitions. [2022-10-16 02:27:39,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-10-16 02:27:39,316 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 02:27:39,316 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-10-16 02:27:39,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-10-16 02:27:39,316 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [assertErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 02:27:39,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 02:27:39,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1951583698, now seen corresponding path program 1 times [2022-10-16 02:27:39,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 02:27:39,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911197932] [2022-10-16 02:27:39,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:27:39,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 02:27:39,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:39,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 02:27:39,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:39,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-10-16 02:27:39,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:39,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-10-16 02:27:39,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:39,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-10-16 02:27:39,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:39,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-10-16 02:27:39,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:39,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-10-16 02:27:39,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:39,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-10-16 02:27:39,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:39,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-10-16 02:27:39,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:39,547 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 02:27:39,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 02:27:39,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911197932] [2022-10-16 02:27:39,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911197932] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 02:27:39,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 02:27:39,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 02:27:39,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655969706] [2022-10-16 02:27:39,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 02:27:39,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 02:27:39,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 02:27:39,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 02:27:39,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 02:27:39,551 INFO L87 Difference]: Start difference. First operand 4261 states and 5576 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-16 02:27:39,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 02:27:39,634 INFO L93 Difference]: Finished difference Result 4770 states and 6479 transitions. [2022-10-16 02:27:39,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 02:27:39,635 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 115 [2022-10-16 02:27:39,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 02:27:39,656 INFO L225 Difference]: With dead ends: 4770 [2022-10-16 02:27:39,657 INFO L226 Difference]: Without dead ends: 4770 [2022-10-16 02:27:39,657 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-10-16 02:27:39,659 INFO L413 NwaCegarLoop]: 329 mSDtfsCounter, 356 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 02:27:39,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 870 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 02:27:39,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4770 states. [2022-10-16 02:27:39,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4770 to 3836. [2022-10-16 02:27:39,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3836 states, 2882 states have (on average 1.3178348369188064) internal successors, (3798), 2916 states have internal predecessors, (3798), 620 states have call successors, (620), 333 states have call predecessors, (620), 333 states have return successors, (620), 586 states have call predecessors, (620), 620 states have call successors, (620) [2022-10-16 02:27:39,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3836 states to 3836 states and 5038 transitions. [2022-10-16 02:27:39,814 INFO L78 Accepts]: Start accepts. Automaton has 3836 states and 5038 transitions. Word has length 115 [2022-10-16 02:27:39,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 02:27:39,814 INFO L495 AbstractCegarLoop]: Abstraction has 3836 states and 5038 transitions. [2022-10-16 02:27:39,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-16 02:27:39,815 INFO L276 IsEmpty]: Start isEmpty. Operand 3836 states and 5038 transitions. [2022-10-16 02:27:39,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-10-16 02:27:39,817 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 02:27:39,817 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-10-16 02:27:39,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-10-16 02:27:39,817 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [assertErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 02:27:39,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 02:27:39,818 INFO L85 PathProgramCache]: Analyzing trace with hash 721695138, now seen corresponding path program 1 times [2022-10-16 02:27:39,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 02:27:39,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441175371] [2022-10-16 02:27:39,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:27:39,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 02:27:39,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:39,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 02:27:39,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:39,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-10-16 02:27:39,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:39,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-10-16 02:27:39,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:39,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-10-16 02:27:39,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:39,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-10-16 02:27:39,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:39,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-10-16 02:27:39,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:39,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-10-16 02:27:39,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:39,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-10-16 02:27:39,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:39,921 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 02:27:39,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 02:27:39,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441175371] [2022-10-16 02:27:39,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441175371] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 02:27:39,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 02:27:39,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 02:27:39,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26494842] [2022-10-16 02:27:39,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 02:27:39,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 02:27:39,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 02:27:39,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 02:27:39,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-16 02:27:39,928 INFO L87 Difference]: Start difference. First operand 3836 states and 5038 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-16 02:27:40,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 02:27:40,065 INFO L93 Difference]: Finished difference Result 4815 states and 6579 transitions. [2022-10-16 02:27:40,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 02:27:40,066 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-10-16 02:27:40,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 02:27:40,083 INFO L225 Difference]: With dead ends: 4815 [2022-10-16 02:27:40,084 INFO L226 Difference]: Without dead ends: 4815 [2022-10-16 02:27:40,084 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-10-16 02:27:40,085 INFO L413 NwaCegarLoop]: 432 mSDtfsCounter, 148 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 02:27:40,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 674 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 02:27:40,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4815 states. [2022-10-16 02:27:40,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4815 to 3846. [2022-10-16 02:27:40,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3846 states, 2892 states have (on average 1.3167358229598893) internal successors, (3808), 2926 states have internal predecessors, (3808), 620 states have call successors, (620), 333 states have call predecessors, (620), 333 states have return successors, (620), 586 states have call predecessors, (620), 620 states have call successors, (620) [2022-10-16 02:27:40,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3846 states to 3846 states and 5048 transitions. [2022-10-16 02:27:40,269 INFO L78 Accepts]: Start accepts. Automaton has 3846 states and 5048 transitions. Word has length 116 [2022-10-16 02:27:40,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 02:27:40,269 INFO L495 AbstractCegarLoop]: Abstraction has 3846 states and 5048 transitions. [2022-10-16 02:27:40,269 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-10-16 02:27:40,269 INFO L276 IsEmpty]: Start isEmpty. Operand 3846 states and 5048 transitions. [2022-10-16 02:27:40,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-10-16 02:27:40,272 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 02:27:40,272 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-10-16 02:27:40,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-10-16 02:27:40,272 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [assertErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 02:27:40,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 02:27:40,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1004645789, now seen corresponding path program 1 times [2022-10-16 02:27:40,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 02:27:40,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084746139] [2022-10-16 02:27:40,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:27:40,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 02:27:40,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:40,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 02:27:40,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:40,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-10-16 02:27:40,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:40,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-10-16 02:27:40,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:40,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-10-16 02:27:40,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:40,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-10-16 02:27:40,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:40,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-10-16 02:27:40,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:40,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-10-16 02:27:40,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:40,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-10-16 02:27:40,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:40,485 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-10-16 02:27:40,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 02:27:40,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084746139] [2022-10-16 02:27:40,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084746139] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 02:27:40,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 02:27:40,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 02:27:40,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579415702] [2022-10-16 02:27:40,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 02:27:40,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 02:27:40,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 02:27:40,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 02:27:40,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 02:27:40,488 INFO L87 Difference]: Start difference. First operand 3846 states and 5048 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-16 02:27:40,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 02:27:40,582 INFO L93 Difference]: Finished difference Result 4691 states and 6413 transitions. [2022-10-16 02:27:40,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 02:27:40,583 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 116 [2022-10-16 02:27:40,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 02:27:40,600 INFO L225 Difference]: With dead ends: 4691 [2022-10-16 02:27:40,600 INFO L226 Difference]: Without dead ends: 4691 [2022-10-16 02:27:40,600 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-10-16 02:27:40,601 INFO L413 NwaCegarLoop]: 354 mSDtfsCounter, 271 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 901 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 02:27:40,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 901 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 02:27:40,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4691 states. [2022-10-16 02:27:40,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4691 to 2895. [2022-10-16 02:27:40,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2895 states, 2175 states have (on average 1.3066666666666666) internal successors, (2842), 2194 states have internal predecessors, (2842), 469 states have call successors, (469), 250 states have call predecessors, (469), 250 states have return successors, (469), 450 states have call predecessors, (469), 469 states have call successors, (469) [2022-10-16 02:27:40,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2895 states to 2895 states and 3780 transitions. [2022-10-16 02:27:40,729 INFO L78 Accepts]: Start accepts. Automaton has 2895 states and 3780 transitions. Word has length 116 [2022-10-16 02:27:40,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 02:27:40,729 INFO L495 AbstractCegarLoop]: Abstraction has 2895 states and 3780 transitions. [2022-10-16 02:27:40,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-16 02:27:40,730 INFO L276 IsEmpty]: Start isEmpty. Operand 2895 states and 3780 transitions. [2022-10-16 02:27:40,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2022-10-16 02:27:40,737 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 02:27:40,738 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 02:27:40,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-10-16 02:27:40,738 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [assertErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 02:27:40,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 02:27:40,739 INFO L85 PathProgramCache]: Analyzing trace with hash 663435577, now seen corresponding path program 1 times [2022-10-16 02:27:40,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 02:27:40,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938056920] [2022-10-16 02:27:40,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:27:40,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 02:27:40,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:41,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 02:27:41,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:41,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-10-16 02:27:41,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:41,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-10-16 02:27:41,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:41,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-10-16 02:27:41,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:41,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-10-16 02:27:41,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:41,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-10-16 02:27:41,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:41,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-10-16 02:27:41,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:41,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-10-16 02:27:41,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:41,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-10-16 02:27:41,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:41,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-10-16 02:27:41,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:41,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-10-16 02:27:41,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:41,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-10-16 02:27:41,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:41,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-10-16 02:27:41,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:41,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-10-16 02:27:41,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:41,305 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 16 proven. 28 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-10-16 02:27:41,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 02:27:41,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938056920] [2022-10-16 02:27:41,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938056920] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 02:27:41,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327415279] [2022-10-16 02:27:41,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:27:41,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 02:27:41,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 02:27:41,308 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-10-16 02:27:41,330 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-10-16 02:27:41,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:41,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 746 conjuncts, 10 conjunts are in the unsatisfiable core [2022-10-16 02:27:41,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 02:27:41,739 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 77 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-10-16 02:27:41,739 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 02:27:41,938 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 44 proven. 2 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-10-16 02:27:41,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1327415279] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 02:27:41,939 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 02:27:41,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-10-16 02:27:41,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458767485] [2022-10-16 02:27:41,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 02:27:41,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-10-16 02:27:41,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 02:27:41,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-10-16 02:27:41,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-10-16 02:27:41,941 INFO L87 Difference]: Start difference. First operand 2895 states and 3780 transitions. Second operand has 14 states, 14 states have (on average 18.571428571428573) internal successors, (260), 13 states have internal predecessors, (260), 6 states have call successors, (37), 4 states have call predecessors, (37), 6 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) [2022-10-16 02:27:45,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 02:27:45,252 INFO L93 Difference]: Finished difference Result 7306 states and 10358 transitions. [2022-10-16 02:27:45,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-10-16 02:27:45,254 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 18.571428571428573) internal successors, (260), 13 states have internal predecessors, (260), 6 states have call successors, (37), 4 states have call predecessors, (37), 6 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) Word has length 184 [2022-10-16 02:27:45,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 02:27:45,281 INFO L225 Difference]: With dead ends: 7306 [2022-10-16 02:27:45,282 INFO L226 Difference]: Without dead ends: 7306 [2022-10-16 02:27:45,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 464 GetRequests, 400 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1358 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=749, Invalid=3411, Unknown=0, NotChecked=0, Total=4160 [2022-10-16 02:27:45,284 INFO L413 NwaCegarLoop]: 334 mSDtfsCounter, 4409 mSDsluCounter, 2621 mSDsCounter, 0 mSdLazyCounter, 1767 mSolverCounterSat, 1308 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4409 SdHoareTripleChecker+Valid, 2955 SdHoareTripleChecker+Invalid, 3075 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1308 IncrementalHoareTripleChecker+Valid, 1767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-10-16 02:27:45,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4409 Valid, 2955 Invalid, 3075 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1308 Valid, 1767 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-10-16 02:27:45,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7306 states. [2022-10-16 02:27:45,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7306 to 3419. [2022-10-16 02:27:45,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3419 states, 2592 states have (on average 1.3036265432098766) internal successors, (3379), 2612 states have internal predecessors, (3379), 531 states have call successors, (531), 295 states have call predecessors, (531), 295 states have return successors, (531), 511 states have call predecessors, (531), 531 states have call successors, (531) [2022-10-16 02:27:45,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3419 states to 3419 states and 4441 transitions. [2022-10-16 02:27:45,498 INFO L78 Accepts]: Start accepts. Automaton has 3419 states and 4441 transitions. Word has length 184 [2022-10-16 02:27:45,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 02:27:45,498 INFO L495 AbstractCegarLoop]: Abstraction has 3419 states and 4441 transitions. [2022-10-16 02:27:45,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 18.571428571428573) internal successors, (260), 13 states have internal predecessors, (260), 6 states have call successors, (37), 4 states have call predecessors, (37), 6 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) [2022-10-16 02:27:45,499 INFO L276 IsEmpty]: Start isEmpty. Operand 3419 states and 4441 transitions. [2022-10-16 02:27:45,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2022-10-16 02:27:45,507 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 02:27:45,508 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 02:27:45,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-10-16 02:27:45,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-10-16 02:27:45,722 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [assertErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 02:27:45,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 02:27:45,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1973943078, now seen corresponding path program 1 times [2022-10-16 02:27:45,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 02:27:45,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516585046] [2022-10-16 02:27:45,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:27:45,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 02:27:45,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:46,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 02:27:46,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:46,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-10-16 02:27:46,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:46,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-10-16 02:27:46,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:46,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-10-16 02:27:46,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:46,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-10-16 02:27:46,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:46,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-10-16 02:27:46,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:46,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-10-16 02:27:46,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:46,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-10-16 02:27:46,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:46,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-10-16 02:27:46,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:46,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-10-16 02:27:46,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:46,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-10-16 02:27:46,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:46,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-10-16 02:27:46,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:46,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-10-16 02:27:46,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:46,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-10-16 02:27:46,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:46,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-10-16 02:27:46,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:46,478 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 16 proven. 23 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2022-10-16 02:27:46,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 02:27:46,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516585046] [2022-10-16 02:27:46,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516585046] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 02:27:46,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30656883] [2022-10-16 02:27:46,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:27:46,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 02:27:46,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 02:27:46,484 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-10-16 02:27:46,506 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-10-16 02:27:46,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:46,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 791 conjuncts, 16 conjunts are in the unsatisfiable core [2022-10-16 02:27:46,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 02:27:47,063 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 36 proven. 53 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-10-16 02:27:47,064 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 02:27:47,309 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 15 proven. 26 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-10-16 02:27:47,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [30656883] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 02:27:47,310 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 02:27:47,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2022-10-16 02:27:47,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576594841] [2022-10-16 02:27:47,311 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 02:27:47,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-10-16 02:27:47,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 02:27:47,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-10-16 02:27:47,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2022-10-16 02:27:47,314 INFO L87 Difference]: Start difference. First operand 3419 states and 4441 transitions. Second operand has 16 states, 16 states have (on average 16.375) internal successors, (262), 14 states have internal predecessors, (262), 6 states have call successors, (43), 4 states have call predecessors, (43), 7 states have return successors, (42), 8 states have call predecessors, (42), 6 states have call successors, (42) [2022-10-16 02:27:56,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 02:27:56,901 INFO L93 Difference]: Finished difference Result 14081 states and 19131 transitions. [2022-10-16 02:27:56,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2022-10-16 02:27:56,902 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 16.375) internal successors, (262), 14 states have internal predecessors, (262), 6 states have call successors, (43), 4 states have call predecessors, (43), 7 states have return successors, (42), 8 states have call predecessors, (42), 6 states have call successors, (42) Word has length 192 [2022-10-16 02:27:56,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 02:27:56,946 INFO L225 Difference]: With dead ends: 14081 [2022-10-16 02:27:56,946 INFO L226 Difference]: Without dead ends: 14081 [2022-10-16 02:27:56,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 590 GetRequests, 472 SyntacticMatches, 1 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5045 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1835, Invalid=12207, Unknown=0, NotChecked=0, Total=14042 [2022-10-16 02:27:56,952 INFO L413 NwaCegarLoop]: 1788 mSDtfsCounter, 6831 mSDsluCounter, 13482 mSDsCounter, 0 mSdLazyCounter, 5455 mSolverCounterSat, 4166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6831 SdHoareTripleChecker+Valid, 15270 SdHoareTripleChecker+Invalid, 9621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4166 IncrementalHoareTripleChecker+Valid, 5455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-10-16 02:27:56,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6831 Valid, 15270 Invalid, 9621 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4166 Valid, 5455 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2022-10-16 02:27:56,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14081 states. [2022-10-16 02:27:57,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14081 to 6242. [2022-10-16 02:27:57,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6242 states, 4698 states have (on average 1.3018305661983822) internal successors, (6116), 4736 states have internal predecessors, (6116), 992 states have call successors, (992), 551 states have call predecessors, (992), 551 states have return successors, (992), 954 states have call predecessors, (992), 992 states have call successors, (992) [2022-10-16 02:27:57,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6242 states to 6242 states and 8100 transitions. [2022-10-16 02:27:57,218 INFO L78 Accepts]: Start accepts. Automaton has 6242 states and 8100 transitions. Word has length 192 [2022-10-16 02:27:57,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 02:27:57,221 INFO L495 AbstractCegarLoop]: Abstraction has 6242 states and 8100 transitions. [2022-10-16 02:27:57,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 16.375) internal successors, (262), 14 states have internal predecessors, (262), 6 states have call successors, (43), 4 states have call predecessors, (43), 7 states have return successors, (42), 8 states have call predecessors, (42), 6 states have call successors, (42) [2022-10-16 02:27:57,221 INFO L276 IsEmpty]: Start isEmpty. Operand 6242 states and 8100 transitions. [2022-10-16 02:27:57,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-10-16 02:27:57,237 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 02:27:57,238 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 02:27:57,281 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-10-16 02:27:57,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-10-16 02:27:57,452 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [assertErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 02:27:57,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 02:27:57,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1850869249, now seen corresponding path program 1 times [2022-10-16 02:27:57,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 02:27:57,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788423142] [2022-10-16 02:27:57,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:27:57,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 02:27:57,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:57,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 02:27:57,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:57,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-10-16 02:27:57,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:57,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-10-16 02:27:57,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:57,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-10-16 02:27:57,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:57,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-10-16 02:27:57,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:57,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-10-16 02:27:57,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:57,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-10-16 02:27:57,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:57,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-10-16 02:27:57,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:57,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-10-16 02:27:57,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:57,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-10-16 02:27:57,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:57,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-10-16 02:27:57,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:57,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-10-16 02:27:57,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:57,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-10-16 02:27:57,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:57,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-10-16 02:27:57,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:57,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-10-16 02:27:57,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:57,787 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-10-16 02:27:57,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 02:27:57,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788423142] [2022-10-16 02:27:57,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788423142] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 02:27:57,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 02:27:57,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-16 02:27:57,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148031355] [2022-10-16 02:27:57,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 02:27:57,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-16 02:27:57,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 02:27:57,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-16 02:27:57,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-16 02:27:57,790 INFO L87 Difference]: Start difference. First operand 6242 states and 8100 transitions. Second operand has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 6 states have internal predecessors, (115), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2022-10-16 02:27:58,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 02:27:58,174 INFO L93 Difference]: Finished difference Result 15098 states and 20173 transitions. [2022-10-16 02:27:58,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-10-16 02:27:58,175 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 6 states have internal predecessors, (115), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 194 [2022-10-16 02:27:58,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 02:27:58,226 INFO L225 Difference]: With dead ends: 15098 [2022-10-16 02:27:58,226 INFO L226 Difference]: Without dead ends: 15098 [2022-10-16 02:27:58,227 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-10-16 02:27:58,227 INFO L413 NwaCegarLoop]: 566 mSDtfsCounter, 801 mSDsluCounter, 2482 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 820 SdHoareTripleChecker+Valid, 3048 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 02:27:58,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [820 Valid, 3048 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-16 02:27:58,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15098 states. [2022-10-16 02:27:58,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15098 to 8084. [2022-10-16 02:27:58,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8084 states, 6028 states have (on average 1.3012607830126077) internal successors, (7844), 6079 states have internal predecessors, (7844), 1335 states have call successors, (1335), 720 states have call predecessors, (1335), 720 states have return successors, (1335), 1284 states have call predecessors, (1335), 1335 states have call successors, (1335) [2022-10-16 02:27:58,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8084 states to 8084 states and 10514 transitions. [2022-10-16 02:27:58,553 INFO L78 Accepts]: Start accepts. Automaton has 8084 states and 10514 transitions. Word has length 194 [2022-10-16 02:27:58,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 02:27:58,554 INFO L495 AbstractCegarLoop]: Abstraction has 8084 states and 10514 transitions. [2022-10-16 02:27:58,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 6 states have internal predecessors, (115), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2022-10-16 02:27:58,555 INFO L276 IsEmpty]: Start isEmpty. Operand 8084 states and 10514 transitions. [2022-10-16 02:27:58,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2022-10-16 02:27:58,572 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 02:27:58,572 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 02:27:58,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-10-16 02:27:58,573 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [assertErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 02:27:58,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 02:27:58,573 INFO L85 PathProgramCache]: Analyzing trace with hash -556872235, now seen corresponding path program 1 times [2022-10-16 02:27:58,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 02:27:58,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986790764] [2022-10-16 02:27:58,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:27:58,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 02:27:58,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:58,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 02:27:58,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:58,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-10-16 02:27:58,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:58,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-10-16 02:27:58,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:58,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-10-16 02:27:58,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:58,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-10-16 02:27:58,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:58,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-10-16 02:27:58,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:58,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-10-16 02:27:58,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:58,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-10-16 02:27:58,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:58,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-10-16 02:27:58,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:58,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-10-16 02:27:58,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:58,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-10-16 02:27:58,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:58,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-10-16 02:27:58,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:58,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-10-16 02:27:58,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:58,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-10-16 02:27:58,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:58,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-10-16 02:27:58,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:58,988 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 35 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-10-16 02:27:58,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 02:27:58,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986790764] [2022-10-16 02:27:58,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986790764] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 02:27:58,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572870950] [2022-10-16 02:27:58,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:27:58,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 02:27:58,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 02:27:58,990 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-10-16 02:27:59,000 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-10-16 02:27:59,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:27:59,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 793 conjuncts, 12 conjunts are in the unsatisfiable core [2022-10-16 02:27:59,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 02:27:59,280 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 49 proven. 6 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-10-16 02:27:59,280 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 02:27:59,372 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-10-16 02:27:59,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1572870950] provided 1 perfect and 1 imperfect interpolant sequences [2022-10-16 02:27:59,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-10-16 02:27:59,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 7] total 13 [2022-10-16 02:27:59,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419143220] [2022-10-16 02:27:59,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 02:27:59,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 02:27:59,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 02:27:59,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 02:27:59,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-10-16 02:27:59,375 INFO L87 Difference]: Start difference. First operand 8084 states and 10514 transitions. Second operand has 5 states, 4 states have (on average 27.75) internal successors, (111), 5 states have internal predecessors, (111), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2022-10-16 02:27:59,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 02:27:59,428 INFO L93 Difference]: Finished difference Result 5540 states and 7193 transitions. [2022-10-16 02:27:59,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 02:27:59,429 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 27.75) internal successors, (111), 5 states have internal predecessors, (111), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 195 [2022-10-16 02:27:59,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 02:27:59,457 INFO L225 Difference]: With dead ends: 5540 [2022-10-16 02:27:59,458 INFO L226 Difference]: Without dead ends: 5440 [2022-10-16 02:27:59,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 414 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-10-16 02:27:59,459 INFO L413 NwaCegarLoop]: 289 mSDtfsCounter, 2 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 02:27:59,460 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 858 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 02:27:59,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5440 states. [2022-10-16 02:27:59,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5440 to 5440. [2022-10-16 02:27:59,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5440 states, 4058 states have (on average 1.3013799901429275) internal successors, (5281), 4092 states have internal predecessors, (5281), 901 states have call successors, (901), 480 states have call predecessors, (901), 480 states have return successors, (901), 867 states have call predecessors, (901), 901 states have call successors, (901) [2022-10-16 02:27:59,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5440 states to 5440 states and 7083 transitions. [2022-10-16 02:27:59,711 INFO L78 Accepts]: Start accepts. Automaton has 5440 states and 7083 transitions. Word has length 195 [2022-10-16 02:27:59,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 02:27:59,711 INFO L495 AbstractCegarLoop]: Abstraction has 5440 states and 7083 transitions. [2022-10-16 02:27:59,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 27.75) internal successors, (111), 5 states have internal predecessors, (111), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2022-10-16 02:27:59,712 INFO L276 IsEmpty]: Start isEmpty. Operand 5440 states and 7083 transitions. [2022-10-16 02:27:59,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2022-10-16 02:27:59,733 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 02:27:59,733 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 02:27:59,783 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-10-16 02:27:59,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 02:27:59,947 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [assertErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 02:27:59,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 02:27:59,949 INFO L85 PathProgramCache]: Analyzing trace with hash 231363268, now seen corresponding path program 1 times [2022-10-16 02:27:59,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 02:27:59,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852980533] [2022-10-16 02:27:59,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:27:59,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 02:28:00,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:00,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 02:28:00,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:00,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-10-16 02:28:00,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:00,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-10-16 02:28:00,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:00,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-10-16 02:28:00,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:00,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-10-16 02:28:00,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:00,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-10-16 02:28:00,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:00,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-10-16 02:28:00,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:00,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-10-16 02:28:00,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:00,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-10-16 02:28:00,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:00,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-10-16 02:28:00,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:00,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-10-16 02:28:00,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:00,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-10-16 02:28:00,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:00,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-10-16 02:28:00,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:00,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-10-16 02:28:00,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:00,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-10-16 02:28:00,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:00,822 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 24 proven. 9 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-10-16 02:28:00,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 02:28:00,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852980533] [2022-10-16 02:28:00,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852980533] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 02:28:00,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [385571038] [2022-10-16 02:28:00,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:28:00,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 02:28:00,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 02:28:00,824 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-10-16 02:28:00,846 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-10-16 02:28:01,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:01,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 819 conjuncts, 11 conjunts are in the unsatisfiable core [2022-10-16 02:28:01,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 02:28:01,174 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 51 proven. 4 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-10-16 02:28:01,174 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 02:28:01,313 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 28 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-10-16 02:28:01,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [385571038] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 02:28:01,313 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 02:28:01,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 17 [2022-10-16 02:28:01,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507519711] [2022-10-16 02:28:01,314 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 02:28:01,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-10-16 02:28:01,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 02:28:01,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-10-16 02:28:01,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2022-10-16 02:28:01,317 INFO L87 Difference]: Start difference. First operand 5440 states and 7083 transitions. Second operand has 17 states, 17 states have (on average 14.352941176470589) internal successors, (244), 16 states have internal predecessors, (244), 6 states have call successors, (37), 4 states have call predecessors, (37), 6 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) [2022-10-16 02:28:05,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 02:28:05,784 INFO L93 Difference]: Finished difference Result 10105 states and 14144 transitions. [2022-10-16 02:28:05,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-10-16 02:28:05,785 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 14.352941176470589) internal successors, (244), 16 states have internal predecessors, (244), 6 states have call successors, (37), 4 states have call predecessors, (37), 6 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) Word has length 195 [2022-10-16 02:28:05,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 02:28:05,822 INFO L225 Difference]: With dead ends: 10105 [2022-10-16 02:28:05,822 INFO L226 Difference]: Without dead ends: 10105 [2022-10-16 02:28:05,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 489 GetRequests, 421 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1413 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=662, Invalid=4168, Unknown=0, NotChecked=0, Total=4830 [2022-10-16 02:28:05,826 INFO L413 NwaCegarLoop]: 563 mSDtfsCounter, 3915 mSDsluCounter, 5823 mSDsCounter, 0 mSdLazyCounter, 4098 mSolverCounterSat, 1541 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3915 SdHoareTripleChecker+Valid, 6386 SdHoareTripleChecker+Invalid, 5639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1541 IncrementalHoareTripleChecker+Valid, 4098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-10-16 02:28:05,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3915 Valid, 6386 Invalid, 5639 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1541 Valid, 4098 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-10-16 02:28:05,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10105 states. [2022-10-16 02:28:06,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10105 to 6038. [2022-10-16 02:28:06,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6038 states, 4502 states have (on average 1.2972012438916036) internal successors, (5840), 4540 states have internal predecessors, (5840), 998 states have call successors, (998), 537 states have call predecessors, (998), 537 states have return successors, (998), 960 states have call predecessors, (998), 998 states have call successors, (998) [2022-10-16 02:28:06,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6038 states to 6038 states and 7836 transitions. [2022-10-16 02:28:06,118 INFO L78 Accepts]: Start accepts. Automaton has 6038 states and 7836 transitions. Word has length 195 [2022-10-16 02:28:06,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 02:28:06,119 INFO L495 AbstractCegarLoop]: Abstraction has 6038 states and 7836 transitions. [2022-10-16 02:28:06,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 14.352941176470589) internal successors, (244), 16 states have internal predecessors, (244), 6 states have call successors, (37), 4 states have call predecessors, (37), 6 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) [2022-10-16 02:28:06,119 INFO L276 IsEmpty]: Start isEmpty. Operand 6038 states and 7836 transitions. [2022-10-16 02:28:06,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2022-10-16 02:28:06,133 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 02:28:06,134 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 02:28:06,177 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-10-16 02:28:06,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 02:28:06,350 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [assertErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 02:28:06,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 02:28:06,351 INFO L85 PathProgramCache]: Analyzing trace with hash -2102593578, now seen corresponding path program 1 times [2022-10-16 02:28:06,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 02:28:06,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590702762] [2022-10-16 02:28:06,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:28:06,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 02:28:06,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:06,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 02:28:06,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:06,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-10-16 02:28:06,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:06,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-10-16 02:28:06,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:06,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-10-16 02:28:06,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:06,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-10-16 02:28:06,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:06,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-10-16 02:28:06,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:06,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-10-16 02:28:06,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:06,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-10-16 02:28:06,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:06,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-10-16 02:28:06,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:06,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-10-16 02:28:06,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:06,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-10-16 02:28:06,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:06,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-10-16 02:28:06,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:06,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-10-16 02:28:06,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:06,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-10-16 02:28:06,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:06,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-10-16 02:28:06,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:06,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-10-16 02:28:06,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:06,644 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2022-10-16 02:28:06,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 02:28:06,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590702762] [2022-10-16 02:28:06,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590702762] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 02:28:06,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 02:28:06,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 02:28:06,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255879685] [2022-10-16 02:28:06,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 02:28:06,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 02:28:06,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 02:28:06,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 02:28:06,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-10-16 02:28:06,647 INFO L87 Difference]: Start difference. First operand 6038 states and 7836 transitions. Second operand has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-10-16 02:28:06,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 02:28:06,808 INFO L93 Difference]: Finished difference Result 5677 states and 7374 transitions. [2022-10-16 02:28:06,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 02:28:06,808 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 203 [2022-10-16 02:28:06,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 02:28:06,826 INFO L225 Difference]: With dead ends: 5677 [2022-10-16 02:28:06,826 INFO L226 Difference]: Without dead ends: 5677 [2022-10-16 02:28:06,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-10-16 02:28:06,827 INFO L413 NwaCegarLoop]: 253 mSDtfsCounter, 281 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 02:28:06,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 471 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 02:28:06,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5677 states. [2022-10-16 02:28:06,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5677 to 5677. [2022-10-16 02:28:06,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5677 states, 4235 states have (on average 1.298229043683589) internal successors, (5498), 4271 states have internal predecessors, (5498), 938 states have call successors, (938), 503 states have call predecessors, (938), 503 states have return successors, (938), 902 states have call predecessors, (938), 938 states have call successors, (938) [2022-10-16 02:28:07,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5677 states to 5677 states and 7374 transitions. [2022-10-16 02:28:07,013 INFO L78 Accepts]: Start accepts. Automaton has 5677 states and 7374 transitions. Word has length 203 [2022-10-16 02:28:07,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 02:28:07,013 INFO L495 AbstractCegarLoop]: Abstraction has 5677 states and 7374 transitions. [2022-10-16 02:28:07,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-10-16 02:28:07,014 INFO L276 IsEmpty]: Start isEmpty. Operand 5677 states and 7374 transitions. [2022-10-16 02:28:07,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2022-10-16 02:28:07,028 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 02:28:07,028 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 02:28:07,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-10-16 02:28:07,029 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [assertErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 02:28:07,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 02:28:07,030 INFO L85 PathProgramCache]: Analyzing trace with hash -188074446, now seen corresponding path program 1 times [2022-10-16 02:28:07,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 02:28:07,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990616331] [2022-10-16 02:28:07,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:28:07,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 02:28:07,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:07,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 02:28:07,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:07,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-10-16 02:28:07,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:07,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-10-16 02:28:07,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:07,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-10-16 02:28:07,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:07,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-10-16 02:28:07,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:07,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-10-16 02:28:07,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:07,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-10-16 02:28:07,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:07,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-10-16 02:28:07,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:07,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-10-16 02:28:07,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:07,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-10-16 02:28:07,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:07,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-10-16 02:28:07,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:07,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-10-16 02:28:07,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:07,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-10-16 02:28:07,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:07,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-10-16 02:28:07,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:07,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-10-16 02:28:07,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:07,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-10-16 02:28:07,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:07,761 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 28 proven. 19 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-10-16 02:28:07,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 02:28:07,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990616331] [2022-10-16 02:28:07,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990616331] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 02:28:07,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106300531] [2022-10-16 02:28:07,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:28:07,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 02:28:07,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 02:28:07,767 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-10-16 02:28:07,771 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-10-16 02:28:07,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:07,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 10 conjunts are in the unsatisfiable core [2022-10-16 02:28:07,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 02:28:08,151 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 80 proven. 4 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-10-16 02:28:08,151 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 02:28:08,326 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 42 proven. 6 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-10-16 02:28:08,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2106300531] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 02:28:08,327 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 02:28:08,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 17 [2022-10-16 02:28:08,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841504614] [2022-10-16 02:28:08,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 02:28:08,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-10-16 02:28:08,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 02:28:08,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-10-16 02:28:08,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2022-10-16 02:28:08,331 INFO L87 Difference]: Start difference. First operand 5677 states and 7374 transitions. Second operand has 17 states, 17 states have (on average 15.411764705882353) internal successors, (262), 16 states have internal predecessors, (262), 6 states have call successors, (40), 4 states have call predecessors, (40), 6 states have return successors, (40), 7 states have call predecessors, (40), 6 states have call successors, (40) [2022-10-16 02:28:14,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 02:28:14,640 INFO L93 Difference]: Finished difference Result 11372 states and 15973 transitions. [2022-10-16 02:28:14,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-10-16 02:28:14,645 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 15.411764705882353) internal successors, (262), 16 states have internal predecessors, (262), 6 states have call successors, (40), 4 states have call predecessors, (40), 6 states have return successors, (40), 7 states have call predecessors, (40), 6 states have call successors, (40) Word has length 204 [2022-10-16 02:28:14,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 02:28:14,688 INFO L225 Difference]: With dead ends: 11372 [2022-10-16 02:28:14,689 INFO L226 Difference]: Without dead ends: 11372 [2022-10-16 02:28:14,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 521 GetRequests, 441 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2055 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=886, Invalid=5594, Unknown=0, NotChecked=0, Total=6480 [2022-10-16 02:28:14,692 INFO L413 NwaCegarLoop]: 631 mSDtfsCounter, 3479 mSDsluCounter, 6154 mSDsCounter, 0 mSdLazyCounter, 5137 mSolverCounterSat, 1843 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3479 SdHoareTripleChecker+Valid, 6785 SdHoareTripleChecker+Invalid, 6980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1843 IncrementalHoareTripleChecker+Valid, 5137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-10-16 02:28:14,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3479 Valid, 6785 Invalid, 6980 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1843 Valid, 5137 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-10-16 02:28:14,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11372 states. [2022-10-16 02:28:14,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11372 to 6321. [2022-10-16 02:28:14,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6321 states, 4723 states have (on average 1.2945161973322041) internal successors, (6114), 4763 states have internal predecessors, (6114), 1036 states have call successors, (1036), 561 states have call predecessors, (1036), 561 states have return successors, (1036), 996 states have call predecessors, (1036), 1036 states have call successors, (1036) [2022-10-16 02:28:14,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6321 states to 6321 states and 8186 transitions. [2022-10-16 02:28:14,967 INFO L78 Accepts]: Start accepts. Automaton has 6321 states and 8186 transitions. Word has length 204 [2022-10-16 02:28:14,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 02:28:14,967 INFO L495 AbstractCegarLoop]: Abstraction has 6321 states and 8186 transitions. [2022-10-16 02:28:14,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 15.411764705882353) internal successors, (262), 16 states have internal predecessors, (262), 6 states have call successors, (40), 4 states have call predecessors, (40), 6 states have return successors, (40), 7 states have call predecessors, (40), 6 states have call successors, (40) [2022-10-16 02:28:14,968 INFO L276 IsEmpty]: Start isEmpty. Operand 6321 states and 8186 transitions. [2022-10-16 02:28:14,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2022-10-16 02:28:14,981 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 02:28:14,983 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 02:28:15,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-10-16 02:28:15,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 02:28:15,198 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [assertErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 02:28:15,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 02:28:15,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1791386454, now seen corresponding path program 1 times [2022-10-16 02:28:15,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 02:28:15,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156854682] [2022-10-16 02:28:15,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:28:15,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 02:28:15,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:15,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-16 02:28:15,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:15,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-10-16 02:28:15,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:15,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-10-16 02:28:15,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:15,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-10-16 02:28:15,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:15,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-10-16 02:28:15,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:15,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-10-16 02:28:15,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:15,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-10-16 02:28:15,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:15,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-10-16 02:28:15,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:15,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-10-16 02:28:15,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:15,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-10-16 02:28:15,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:15,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-10-16 02:28:15,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:15,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-10-16 02:28:15,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:15,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-10-16 02:28:15,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:15,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-10-16 02:28:15,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:15,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-10-16 02:28:15,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:15,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-10-16 02:28:15,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:15,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-10-16 02:28:15,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 02:28:15,366 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2022-10-16 02:28:15,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 02:28:15,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156854682] [2022-10-16 02:28:15,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156854682] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 02:28:15,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 02:28:15,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 02:28:15,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417595989] [2022-10-16 02:28:15,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 02:28:15,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 02:28:15,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 02:28:15,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 02:28:15,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-16 02:28:15,371 INFO L87 Difference]: Start difference. First operand 6321 states and 8186 transitions. Second operand has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-10-16 02:28:15,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 02:28:15,502 INFO L93 Difference]: Finished difference Result 5754 states and 7456 transitions. [2022-10-16 02:28:15,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 02:28:15,503 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 211 [2022-10-16 02:28:15,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 02:28:15,520 INFO L225 Difference]: With dead ends: 5754 [2022-10-16 02:28:15,521 INFO L226 Difference]: Without dead ends: 5754 [2022-10-16 02:28:15,521 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-10-16 02:28:15,522 INFO L413 NwaCegarLoop]: 261 mSDtfsCounter, 235 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 02:28:15,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 450 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 02:28:15,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5754 states. [2022-10-16 02:28:15,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5754 to 5746. [2022-10-16 02:28:15,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5746 states, 4302 states have (on average 1.294746629474663) internal successors, (5570), 4338 states have internal predecessors, (5570), 939 states have call successors, (939), 504 states have call predecessors, (939), 504 states have return successors, (939), 903 states have call predecessors, (939), 939 states have call successors, (939) [2022-10-16 02:28:15,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5746 states to 5746 states and 7448 transitions. [2022-10-16 02:28:15,745 INFO L78 Accepts]: Start accepts. Automaton has 5746 states and 7448 transitions. Word has length 211 [2022-10-16 02:28:15,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 02:28:15,745 INFO L495 AbstractCegarLoop]: Abstraction has 5746 states and 7448 transitions. [2022-10-16 02:28:15,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-10-16 02:28:15,745 INFO L276 IsEmpty]: Start isEmpty. Operand 5746 states and 7448 transitions. [2022-10-16 02:28:15,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2022-10-16 02:28:15,761 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 02:28:15,762 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 02:28:15,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-10-16 02:28:15,762 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [assertErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-16 02:28:15,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 02:28:15,763 INFO L85 PathProgramCache]: Analyzing trace with hash 2527939, now seen corresponding path program 1 times [2022-10-16 02:28:15,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 02:28:15,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620520318] [2022-10-16 02:28:15,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 02:28:15,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 02:28:15,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-16 02:28:15,930 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-16 02:28:16,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-16 02:28:16,211 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-16 02:28:16,211 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-16 02:28:16,213 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location assertErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2022-10-16 02:28:16,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2022-10-16 02:28:16,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-10-16 02:28:16,221 INFO L444 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] [2022-10-16 02:28:16,226 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-16 02:28:16,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 02:28:16 BoogieIcfgContainer [2022-10-16 02:28:16,554 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-16 02:28:16,555 INFO L158 Benchmark]: Toolchain (without parser) took 53162.17ms. Allocated memory was 155.2MB in the beginning and 692.1MB in the end (delta: 536.9MB). Free memory was 129.1MB in the beginning and 538.2MB in the end (delta: -409.1MB). Peak memory consumption was 128.7MB. Max. memory is 8.0GB. [2022-10-16 02:28:16,555 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 155.2MB. Free memory was 124.8MB in the beginning and 124.7MB in the end (delta: 84.6kB). There was no memory consumed. Max. memory is 8.0GB. [2022-10-16 02:28:16,555 INFO L158 Benchmark]: CACSL2BoogieTranslator took 489.23ms. Allocated memory is still 155.2MB. Free memory was 128.8MB in the beginning and 111.9MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-10-16 02:28:16,559 INFO L158 Benchmark]: Boogie Procedure Inliner took 113.75ms. Allocated memory is still 155.2MB. Free memory was 111.9MB in the beginning and 108.6MB in the end (delta: 3.3MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-10-16 02:28:16,559 INFO L158 Benchmark]: Boogie Preprocessor took 58.85ms. Allocated memory is still 155.2MB. Free memory was 108.6MB in the beginning and 105.9MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-10-16 02:28:16,559 INFO L158 Benchmark]: RCFGBuilder took 1246.35ms. Allocated memory is still 155.2MB. Free memory was 105.9MB in the beginning and 108.1MB in the end (delta: -2.2MB). Peak memory consumption was 11.0MB. Max. memory is 8.0GB. [2022-10-16 02:28:16,560 INFO L158 Benchmark]: TraceAbstraction took 51237.37ms. Allocated memory was 155.2MB in the beginning and 692.1MB in the end (delta: 536.9MB). Free memory was 107.0MB in the beginning and 538.2MB in the end (delta: -431.2MB). Peak memory consumption was 106.2MB. Max. memory is 8.0GB. [2022-10-16 02:28:16,562 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.25ms. Allocated memory is still 155.2MB. Free memory was 124.8MB in the beginning and 124.7MB in the end (delta: 84.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 489.23ms. Allocated memory is still 155.2MB. Free memory was 128.8MB in the beginning and 111.9MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 113.75ms. Allocated memory is still 155.2MB. Free memory was 111.9MB in the beginning and 108.6MB in the end (delta: 3.3MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 58.85ms. Allocated memory is still 155.2MB. Free memory was 108.6MB in the beginning and 105.9MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1246.35ms. Allocated memory is still 155.2MB. Free memory was 105.9MB in the beginning and 108.1MB in the end (delta: -2.2MB). Peak memory consumption was 11.0MB. Max. memory is 8.0GB. * TraceAbstraction took 51237.37ms. Allocated memory was 155.2MB in the beginning and 692.1MB in the end (delta: 536.9MB). Free memory was 107.0MB in the beginning and 538.2MB in the end (delta: -431.2MB). Peak memory consumption was 106.2MB. Max. memory is 8.0GB. * 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 - UnprovableResult [Line: 611]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 611. Possible FailurePath: [L24] msg_t nomsg = (msg_t )-1; [L25] port_t cs1 ; [L26] int8_t cs1_old ; [L27] int8_t cs1_new ; [L28] port_t cs2 ; [L29] int8_t cs2_old ; [L30] int8_t cs2_new ; [L31] port_t s1s2 ; [L32] int8_t s1s2_old ; [L33] int8_t s1s2_new ; [L34] port_t s1s1 ; [L35] int8_t s1s1_old ; [L36] int8_t s1s1_new ; [L37] port_t s2s1 ; [L38] int8_t s2s1_old ; [L39] int8_t s2s1_new ; [L40] port_t s2s2 ; [L41] int8_t s2s2_old ; [L42] int8_t s2s2_new ; [L43] port_t s1p ; [L44] int8_t s1p_old ; [L45] int8_t s1p_new ; [L46] port_t s2p ; [L47] int8_t s2p_old ; [L48] int8_t s2p_new ; [L51] _Bool side1Failed ; [L52] _Bool side2Failed ; [L53] msg_t side1_written ; [L54] msg_t side2_written ; [L60] static _Bool side1Failed_History_0 ; [L61] static _Bool side1Failed_History_1 ; [L62] static _Bool side1Failed_History_2 ; [L63] static _Bool side2Failed_History_0 ; [L64] static _Bool side2Failed_History_1 ; [L65] static _Bool side2Failed_History_2 ; [L66] static int8_t active_side_History_0 ; [L67] static int8_t active_side_History_1 ; [L68] static int8_t active_side_History_2 ; [L69] static msg_t manual_selection_History_0 ; [L70] static msg_t manual_selection_History_1 ; [L71] static msg_t manual_selection_History_2 ; VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=0, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L534] int c1 ; [L535] int i2 ; [L538] c1 = 0 [L539] side1Failed = __VERIFIER_nondet_bool() [L540] side2Failed = __VERIFIER_nondet_bool() [L541] side1_written = __VERIFIER_nondet_char() [L542] side2_written = __VERIFIER_nondet_char() [L543] side1Failed_History_0 = __VERIFIER_nondet_bool() [L544] side1Failed_History_1 = __VERIFIER_nondet_bool() [L545] side1Failed_History_2 = __VERIFIER_nondet_bool() [L546] side2Failed_History_0 = __VERIFIER_nondet_bool() [L547] side2Failed_History_1 = __VERIFIER_nondet_bool() [L548] side2Failed_History_2 = __VERIFIER_nondet_bool() [L549] active_side_History_0 = __VERIFIER_nondet_char() [L550] active_side_History_1 = __VERIFIER_nondet_char() [L551] active_side_History_2 = __VERIFIER_nondet_char() [L552] manual_selection_History_0 = __VERIFIER_nondet_char() [L553] manual_selection_History_1 = __VERIFIER_nondet_char() [L554] manual_selection_History_2 = __VERIFIER_nondet_char() [L555] CALL, EXPR init() [L197] COND FALSE !((int )side1Failed_History_0 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side2_written=0] [L200] COND FALSE !((int )side2Failed_History_0 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side2_written=0, side2Failed_History_0=0] [L203] COND FALSE !((int )active_side_History_0 != -2) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side2_written=0, side2Failed_History_0=0] [L206] COND FALSE !((int )manual_selection_History_0 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side2_written=0, side2Failed_History_0=0] [L209] COND FALSE !((int )side1Failed_History_1 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side2_written=0, side2Failed_History_0=0] [L212] COND FALSE !((int )side2Failed_History_1 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0] [L215] COND FALSE !((int )active_side_History_1 != -2) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0] [L218] COND FALSE !((int )manual_selection_History_1 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0] [L221] COND FALSE !((int )side1Failed_History_2 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0] [L224] COND FALSE !((int )side2Failed_History_2 != 0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L227] COND FALSE !((int )active_side_History_2 != -2) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L230] COND FALSE !((int )manual_selection_History_2 != 0) [L233] return (1); VAL [\result=1, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L555] RET, EXPR init() [L555] i2 = init() [L556] CALL assume_abort_if_not(i2) VAL [\old(cond)=1, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L58] COND FALSE !(!cond) VAL [\old(cond)=1, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cond=1, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L556] RET assume_abort_if_not(i2) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, c1=0, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, i2=1, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L557] cs1_old = nomsg [L558] cs1_new = nomsg [L559] cs2_old = nomsg [L560] cs2_new = nomsg [L561] s1s2_old = nomsg [L562] s1s2_new = nomsg [L563] s1s1_old = nomsg [L564] s1s1_new = nomsg [L565] s2s1_old = nomsg [L566] s2s1_new = nomsg [L567] s2s2_old = nomsg [L568] s2s2_new = nomsg [L569] s1p_old = nomsg [L570] s1p_new = nomsg [L571] s2p_old = nomsg [L572] s2p_new = nomsg [L573] i2 = 0 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, c1=0, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, i2=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L574] COND TRUE i2 < 10 [L576] CALL Console_task_each_pals_period() [L251] msg_t manual_selection ; [L252] char tmp ; [L255] tmp = __VERIFIER_nondet_char() [L256] manual_selection = tmp [L257] CALL write_manual_selection_history(manual_selection) [L167] manual_selection_History_2 = manual_selection_History_1 [L168] manual_selection_History_1 = manual_selection_History_0 [L169] manual_selection_History_0 = val VAL [\old(val)=-128, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=-128] [L257] RET write_manual_selection_history(manual_selection) [L258] EXPR manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-128, manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-128] [L258] cs1_new = manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [L259] EXPR manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-128, manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-128] [L259] cs2_new = manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L260] manual_selection = (msg_t )0 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=0, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-128] [L576] RET Console_task_each_pals_period() [L577] CALL Side1_activestandby_task_each_pals_period() [L266] int8_t side1 ; [L267] int8_t side2 ; [L268] msg_t manual_selection ; [L269] int8_t next_state ; [L272] side1 = nomsg [L273] side2 = nomsg [L274] manual_selection = (msg_t )0 [L275] side1Failed = __VERIFIER_nondet_bool() [L276] CALL write_side1_failed_history(side1Failed) [L77] side1Failed_History_2 = side1Failed_History_1 [L78] side1Failed_History_1 = side1Failed_History_0 [L79] side1Failed_History_0 = val VAL [\old(val)=-255, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=-255] [L276] RET write_side1_failed_history(side1Failed) [L277] COND TRUE \read(side1Failed) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=0, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L278] EXPR nomsg != nomsg && s1s1_new == nomsg ? nomsg : s1s1_new VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=0, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, nomsg != nomsg && s1s1_new == nomsg ? nomsg : s1s1_new=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L278] s1s1_new = nomsg != nomsg && s1s1_new == nomsg ? nomsg : s1s1_new [L279] EXPR nomsg != nomsg && s1s2_new == nomsg ? nomsg : s1s2_new VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=0, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, nomsg != nomsg && s1s2_new == nomsg ? nomsg : s1s2_new=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L279] s1s2_new = nomsg != nomsg && s1s2_new == nomsg ? nomsg : s1s2_new [L280] EXPR nomsg != nomsg && s1p_new == nomsg ? nomsg : s1p_new VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=0, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, nomsg != nomsg && s1p_new == nomsg ? nomsg : s1p_new=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=0, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L280] s1p_new = nomsg != nomsg && s1p_new == nomsg ? nomsg : s1p_new [L281] side1_written = nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=0, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L577] RET Side1_activestandby_task_each_pals_period() [L578] CALL Side2_activestandby_task_each_pals_period() [L323] int8_t side1 ; [L324] int8_t side2 ; [L325] msg_t manual_selection ; [L326] int8_t next_state ; [L329] side1 = nomsg [L330] side2 = nomsg [L331] manual_selection = (msg_t )0 [L332] side2Failed = __VERIFIER_nondet_bool() [L333] CALL write_side2_failed_history(side2Failed) [L107] side2Failed_History_2 = side2Failed_History_1 [L108] side2Failed_History_1 = side2Failed_History_0 [L109] side2Failed_History_0 = val VAL [\old(val)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=0] [L333] RET write_side2_failed_history(side2Failed) [L334] COND FALSE !(\read(side2Failed)) [L341] side1 = s1s2_old [L342] s1s2_old = nomsg [L343] side2 = s2s2_old [L344] s2s2_old = nomsg [L345] manual_selection = cs2_old [L346] cs2_old = nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L347] COND TRUE (int )side1 == (int )side2 [L348] next_state = (int8_t )0 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, next_state=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L371] EXPR next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, next_state=0, next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L371] s2s1_new = next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new [L372] EXPR next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, next_state=0, next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L372] s2s2_new = next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new [L373] EXPR next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, next_state=0, next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L373] s2p_new = next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new [L374] side2_written = next_state VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, next_state=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L578] RET Side2_activestandby_task_each_pals_period() [L579] CALL Pendulum_prism_task_each_pals_period() [L380] int8_t active_side ; [L381] int8_t tmp ; [L382] int8_t side1 ; [L383] int8_t side2 ; VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L386] CALL, EXPR read_active_side_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L148] COND TRUE (int )index == 0 [L149] return (active_side_History_0); VAL [\old(index)=0, \result=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, index=0, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L386] RET, EXPR read_active_side_history((unsigned char)0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_active_side_history((unsigned char)0)=-2, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L386] tmp = read_active_side_history((unsigned char)0) [L387] active_side = tmp [L388] side1 = nomsg [L389] side2 = nomsg [L390] side1 = s1p_old [L391] s1p_old = nomsg [L392] side2 = s2p_old [L393] s2p_old = nomsg VAL [active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L394] COND FALSE !((int )side1 == 1) VAL [active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L397] COND FALSE !((int )side2 == 1) VAL [active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L400] COND FALSE !((int )side1 == 0) [L407] active_side = (int8_t )0 VAL [active_side=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L409] CALL write_active_side_history(active_side) [L137] active_side_History_2 = active_side_History_1 [L138] active_side_History_1 = active_side_History_0 [L139] active_side_History_0 = val VAL [\old(val)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=0, s2p_old=-1, s2s1=0, s2s1_new=0, s2s1_old=-1, s2s2=0, s2s2_new=0, s2s2_old=-1, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=0] [L409] RET write_active_side_history(active_side) [L579] RET Pendulum_prism_task_each_pals_period() [L580] cs1_old = cs1_new [L581] cs1_new = nomsg [L582] cs2_old = cs2_new [L583] cs2_new = nomsg [L584] s1s2_old = s1s2_new [L585] s1s2_new = nomsg [L586] s1s1_old = s1s1_new [L587] s1s1_new = nomsg [L588] s2s1_old = s2s1_new [L589] s2s1_new = nomsg [L590] s2s2_old = s2s2_new [L591] s2s2_new = nomsg [L592] s1p_old = s1p_new [L593] s1p_new = nomsg [L594] s2p_old = s2p_new [L595] s2p_new = nomsg [L596] CALL, EXPR check() [L415] int tmp ; [L416] msg_t tmp___0 ; [L417] _Bool tmp___1 ; [L418] _Bool tmp___2 ; [L419] _Bool tmp___3 ; [L420] _Bool tmp___4 ; [L421] int8_t tmp___5 ; [L422] _Bool tmp___6 ; [L423] _Bool tmp___7 ; [L424] _Bool tmp___8 ; [L425] int8_t tmp___9 ; [L426] _Bool tmp___10 ; [L427] _Bool tmp___11 ; [L428] _Bool tmp___12 ; [L429] msg_t tmp___13 ; [L430] _Bool tmp___14 ; [L431] _Bool tmp___15 ; [L432] _Bool tmp___16 ; [L433] _Bool tmp___17 ; [L434] int8_t tmp___18 ; [L435] int8_t tmp___19 ; [L436] int8_t tmp___20 ; VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L439] COND FALSE !(! side1Failed) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L442] COND TRUE ! side2Failed [L443] tmp = 1 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L447] CALL assume_abort_if_not((_Bool )tmp) VAL [\old(cond)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L58] COND FALSE !(!cond) VAL [\old(cond)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cond=1, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L447] RET assume_abort_if_not((_Bool )tmp) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L448] CALL, EXPR read_manual_selection_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L178] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L181] COND TRUE (int )index == 1 [L182] return (manual_selection_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L448] RET, EXPR read_manual_selection_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_manual_selection_history((unsigned char)1)=0, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L448] tmp___0 = read_manual_selection_history((unsigned char)1) [L449] COND TRUE ! tmp___0 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0] [L450] CALL, EXPR read_side1_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L88] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L450] RET, EXPR read_side1_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side1_failed_history((unsigned char)1)=0, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0] [L450] tmp___1 = read_side1_failed_history((unsigned char)1) [L451] COND TRUE ! tmp___1 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0] [L452] CALL, EXPR read_side1_failed_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L88] COND TRUE (int )index == 0 [L89] return (side1Failed_History_0); VAL [\old(index)=0, \result=-255, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=0, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L452] RET, EXPR read_side1_failed_history((unsigned char)0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side1_failed_history((unsigned char)0)=-255, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0] [L452] tmp___2 = read_side1_failed_history((unsigned char)0) [L453] COND FALSE !(! tmp___2) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=1] [L478] CALL, EXPR read_side1_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L88] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L478] RET, EXPR read_side1_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side1_failed_history((unsigned char)1)=0, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=1] [L478] tmp___7 = read_side1_failed_history((unsigned char)1) [L479] COND FALSE !(\read(tmp___7)) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=1, tmp___7=0] [L494] CALL, EXPR read_side1_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L88] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L494] RET, EXPR read_side1_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side1_failed_history((unsigned char)1)=0, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=1, tmp___7=0] [L494] tmp___11 = read_side1_failed_history((unsigned char)1) [L495] COND TRUE ! tmp___11 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___2=1, tmp___7=0] [L496] CALL, EXPR read_side2_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L118] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L121] COND TRUE (int )index == 1 [L122] return (side2Failed_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L496] RET, EXPR read_side2_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side2_failed_history((unsigned char)1)=0, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___2=1, tmp___7=0] [L496] tmp___12 = read_side2_failed_history((unsigned char)1) [L497] COND FALSE !(\read(tmp___12)) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___12=0, tmp___2=1, tmp___7=0] [L510] CALL, EXPR read_active_side_history((unsigned char)2) VAL [\old(index)=2, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L148] COND FALSE !((int )index == 0) VAL [\old(index)=2, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=2, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L151] COND FALSE !((int )index == 1) VAL [\old(index)=2, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=2, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L154] COND TRUE (int )index == 2 [L155] return (active_side_History_2); VAL [\old(index)=2, \result=-2, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=2, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L510] RET, EXPR read_active_side_history((unsigned char)2) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_active_side_history((unsigned char)2)=-2, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___12=0, tmp___2=1, tmp___7=0] [L510] tmp___20 = read_active_side_history((unsigned char)2) [L511] COND FALSE !((int )tmp___20 > -2) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___12=0, tmp___2=1, tmp___20=-2, tmp___7=0] [L529] return (1); VAL [\result=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___11=0, tmp___12=0, tmp___2=1, tmp___20=-2, tmp___7=0] [L596] RET, EXPR check() [L596] c1 = check() [L597] CALL assert(c1) VAL [\old(arg)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L609] COND FALSE !(! arg) VAL [\old(arg)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, arg=1, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L597] RET assert(c1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, c1=1, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, i2=0, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L598] i2 ++ VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, c1=1, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, i2=1, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L574] COND TRUE i2 < 10 [L576] CALL Console_task_each_pals_period() [L251] msg_t manual_selection ; [L252] char tmp ; [L255] tmp = __VERIFIER_nondet_char() [L256] manual_selection = tmp [L257] CALL write_manual_selection_history(manual_selection) [L167] manual_selection_History_2 = manual_selection_History_1 [L168] manual_selection_History_1 = manual_selection_History_0 [L169] manual_selection_History_0 = val VAL [\old(val)=-128, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=-128] [L257] RET write_manual_selection_history(manual_selection) [L258] EXPR manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection=-128, manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-128] [L258] cs1_new = manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [L259] EXPR manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection=-128, manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-128] [L259] cs2_new = manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L260] manual_selection = (msg_t )0 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-128, cs2=0, cs2_new=-128, cs2_old=-128, manual_selection=0, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=1, side1Failed_History_0=1, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-128] [L576] RET Console_task_each_pals_period() [L577] CALL Side1_activestandby_task_each_pals_period() [L266] int8_t side1 ; [L267] int8_t side2 ; [L268] msg_t manual_selection ; [L269] int8_t next_state ; [L272] side1 = nomsg [L273] side2 = nomsg [L274] manual_selection = (msg_t )0 [L275] side1Failed = __VERIFIER_nondet_bool() [L276] CALL write_side1_failed_history(side1Failed) [L77] side1Failed_History_2 = side1Failed_History_1 [L78] side1Failed_History_1 = side1Failed_History_0 [L79] side1Failed_History_0 = val VAL [\old(val)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-128, cs2=0, cs2_new=-128, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=0, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, val=0] [L276] RET write_side1_failed_history(side1Failed) [L277] COND FALSE !(\read(side1Failed)) [L284] side1 = s1s1_old [L285] s1s1_old = nomsg [L286] side2 = s2s1_old [L287] s2s1_old = nomsg [L288] manual_selection = cs1_old [L289] cs1_old = nomsg VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-128, manual_selection=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L290] COND FALSE !((int )side1 == (int )side2) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-128, manual_selection=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L293] COND TRUE (int )side1 == (int )nomsg VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-128, manual_selection=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L294] COND TRUE (int )side2 != (int )nomsg [L295] next_state = (int8_t )0 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-128, manual_selection=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, next_state=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L314] EXPR next_state != nomsg && s1s1_new == nomsg ? next_state : s1s1_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-128, manual_selection=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, next_state=0, next_state != nomsg && s1s1_new == nomsg ? next_state : s1s1_new=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L314] s1s1_new = next_state != nomsg && s1s1_new == nomsg ? next_state : s1s1_new [L315] EXPR next_state != nomsg && s1s2_new == nomsg ? next_state : s1s2_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-128, manual_selection=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, next_state=0, next_state != nomsg && s1s2_new == nomsg ? next_state : s1s2_new=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L315] s1s2_new = next_state != nomsg && s1s2_new == nomsg ? next_state : s1s2_new [L316] EXPR next_state != nomsg && s1p_new == nomsg ? next_state : s1p_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-128, manual_selection=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, next_state=0, next_state != nomsg && s1p_new == nomsg ? next_state : s1p_new=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L316] s1p_new = next_state != nomsg && s1p_new == nomsg ? next_state : s1p_new [L317] side1_written = next_state VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-128, manual_selection=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, next_state=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L577] RET Side1_activestandby_task_each_pals_period() [L578] CALL Side2_activestandby_task_each_pals_period() [L323] int8_t side1 ; [L324] int8_t side2 ; [L325] msg_t manual_selection ; [L326] int8_t next_state ; [L329] side1 = nomsg [L330] side2 = nomsg [L331] manual_selection = (msg_t )0 [L332] side2Failed = __VERIFIER_nondet_bool() [L333] CALL write_side2_failed_history(side2Failed) [L107] side2Failed_History_2 = side2Failed_History_1 [L108] side2Failed_History_1 = side2Failed_History_0 [L109] side2Failed_History_0 = val VAL [\old(val)=257, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, val=257] [L333] RET write_side2_failed_history(side2Failed) [L334] COND TRUE \read(side2Failed) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-128, manual_selection=0, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L335] EXPR nomsg != nomsg && s2s1_new == nomsg ? nomsg : s2s1_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-128, manual_selection=0, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, nomsg != nomsg && s2s1_new == nomsg ? nomsg : s2s1_new=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L335] s2s1_new = nomsg != nomsg && s2s1_new == nomsg ? nomsg : s2s1_new [L336] EXPR nomsg != nomsg && s2s2_new == nomsg ? nomsg : s2s2_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-128, manual_selection=0, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, nomsg != nomsg && s2s2_new == nomsg ? nomsg : s2s2_new=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L336] s2s2_new = nomsg != nomsg && s2s2_new == nomsg ? nomsg : s2s2_new [L337] EXPR nomsg != nomsg && s2p_new == nomsg ? nomsg : s2p_new VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-128, manual_selection=0, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, nomsg != nomsg && s2p_new == nomsg ? nomsg : s2p_new=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L337] s2p_new = nomsg != nomsg && s2p_new == nomsg ? nomsg : s2p_new [L338] side2_written = nomsg VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-128, manual_selection=0, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=-1, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L578] RET Side2_activestandby_task_each_pals_period() [L579] CALL Pendulum_prism_task_each_pals_period() [L380] int8_t active_side ; [L381] int8_t tmp ; [L382] int8_t side1 ; [L383] int8_t side2 ; VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L386] CALL, EXPR read_active_side_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L148] COND TRUE (int )index == 0 [L149] return (active_side_History_0); VAL [\old(index)=0, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-128, index=0, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L386] RET, EXPR read_active_side_history((unsigned char)0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, read_active_side_history((unsigned char)0)=0, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=0, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L386] tmp = read_active_side_history((unsigned char)0) [L387] active_side = tmp [L388] side1 = nomsg [L389] side2 = nomsg [L390] side1 = s1p_old [L391] s1p_old = nomsg [L392] side2 = s2p_old [L393] s2p_old = nomsg VAL [active_side=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=0] [L394] COND FALSE !((int )side1 == 1) VAL [active_side=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=0] [L397] COND FALSE !((int )side2 == 1) VAL [active_side=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=0] [L400] COND FALSE !((int )side1 == 0) [L407] active_side = (int8_t )0 VAL [active_side=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=0] [L409] CALL write_active_side_history(active_side) [L137] active_side_History_2 = active_side_History_1 [L138] active_side_History_1 = active_side_History_0 [L139] active_side_History_0 = val VAL [\old(val)=0, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=-1, s1s1=0, s1s1_new=0, s1s1_old=-1, s1s2=0, s1s2_new=0, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=0, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, val=0] [L409] RET write_active_side_history(active_side) [L579] RET Pendulum_prism_task_each_pals_period() [L580] cs1_old = cs1_new [L581] cs1_new = nomsg [L582] cs2_old = cs2_new [L583] cs2_new = nomsg [L584] s1s2_old = s1s2_new [L585] s1s2_new = nomsg [L586] s1s1_old = s1s1_new [L587] s1s1_new = nomsg [L588] s2s1_old = s2s1_new [L589] s2s1_new = nomsg [L590] s2s2_old = s2s2_new [L591] s2s2_new = nomsg [L592] s1p_old = s1p_new [L593] s1p_new = nomsg [L594] s2p_old = s2p_new [L595] s2p_new = nomsg [L596] CALL, EXPR check() [L415] int tmp ; [L416] msg_t tmp___0 ; [L417] _Bool tmp___1 ; [L418] _Bool tmp___2 ; [L419] _Bool tmp___3 ; [L420] _Bool tmp___4 ; [L421] int8_t tmp___5 ; [L422] _Bool tmp___6 ; [L423] _Bool tmp___7 ; [L424] _Bool tmp___8 ; [L425] int8_t tmp___9 ; [L426] _Bool tmp___10 ; [L427] _Bool tmp___11 ; [L428] _Bool tmp___12 ; [L429] msg_t tmp___13 ; [L430] _Bool tmp___14 ; [L431] _Bool tmp___15 ; [L432] _Bool tmp___16 ; [L433] _Bool tmp___17 ; [L434] int8_t tmp___18 ; [L435] int8_t tmp___19 ; [L436] int8_t tmp___20 ; VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L439] COND TRUE ! side1Failed [L440] tmp = 1 VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L447] CALL assume_abort_if_not((_Bool )tmp) VAL [\old(cond)=1, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L58] COND FALSE !(!cond) VAL [\old(cond)=1, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cond=1, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L447] RET assume_abort_if_not((_Bool )tmp) VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L448] CALL, EXPR read_manual_selection_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L178] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L181] COND TRUE (int )index == 1 [L182] return (manual_selection_History_1); VAL [\old(index)=1, \result=-128, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L448] RET, EXPR read_manual_selection_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, read_manual_selection_history((unsigned char)1)=-128, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L448] tmp___0 = read_manual_selection_history((unsigned char)1) [L449] COND FALSE !(! tmp___0) VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=-128] [L478] CALL, EXPR read_side1_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L88] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [\old(index)=1, \result=-255, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L478] RET, EXPR read_side1_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, read_side1_failed_history((unsigned char)1)=-255, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=-128] [L478] tmp___7 = read_side1_failed_history((unsigned char)1) [L479] COND TRUE \read(tmp___7) VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=-128, tmp___7=1] [L480] CALL, EXPR read_side2_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L118] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L121] COND TRUE (int )index == 1 [L122] return (side2Failed_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L480] RET, EXPR read_side2_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, read_side2_failed_history((unsigned char)1)=0, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=-128, tmp___7=1] [L480] tmp___8 = read_side2_failed_history((unsigned char)1) [L481] COND TRUE ! tmp___8 VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=-128, tmp___7=1, tmp___8=0] [L482] CALL, EXPR read_active_side_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L148] COND TRUE (int )index == 0 [L149] return (active_side_History_0); VAL [\old(index)=0, \result=0, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=0, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L482] RET, EXPR read_active_side_history((unsigned char)0) VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, read_active_side_history((unsigned char)0)=0, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=-128, tmp___7=1, tmp___8=0] [L482] tmp___5 = read_active_side_history((unsigned char)0) [L483] COND TRUE ! ((int )tmp___5 == 2) [L484] return (0); VAL [\result=0, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=-128, tmp___5=0, tmp___7=1, tmp___8=0] [L596] RET, EXPR check() [L596] c1 = check() [L597] CALL assert(c1) VAL [\old(arg)=0, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L609] COND TRUE ! arg VAL [\old(arg)=0, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, arg=0, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] [L611] reach_error() VAL [\old(arg)=0, active_side_History_0=0, active_side_History_1=0, active_side_History_2=-2, arg=0, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=-128, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=0, s1s1=0, s1s1_new=-1, s1s1_old=0, s1s2=0, s1s2_new=-1, s1s2_old=0, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=1, side1Failed_History_2=0, side2_written=-1, side2Failed=1, side2Failed_History_0=1, side2Failed_History_1=0, side2Failed_History_2=0] - UnprovableResult [Line: 532]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 206 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 50.8s, OverallIterations: 36, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 29.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 28199 SdHoareTripleChecker+Valid, 19.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 27965 mSDsluCounter, 68095 SdHoareTripleChecker+Invalid, 16.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 53167 mSDsCounter, 9808 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 19440 IncrementalHoareTripleChecker+Invalid, 29248 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9808 mSolverCounterUnsat, 14928 mSDtfsCounter, 19440 mSolverCounterSat, 0.5s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3228 GetRequests, 2755 SyntacticMatches, 3 SemanticMatches, 470 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9938 ImplicationChecksByTransitivity, 7.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8084occurred in iteration=30, InterpolantAutomatonStates: 453, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.0s AutomataMinimizationTime, 35 MinimizatonAttempts, 38538 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 11.6s InterpolantComputationTime, 5326 NumberOfCodeBlocks, 5326 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 6038 ConstructedInterpolants, 0 QuantifiedInterpolants, 14385 SizeOfPredicates, 12 NumberOfNonLiveVariables, 4466 ConjunctsInSsa, 61 ConjunctsInUnsatCore, 46 InterpolantComputations, 31 PerfectInterpolantSequences, 1950/2139 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 could not prove your program: unable to determine feasibility of some traces [2022-10-16 02:28:16,637 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...