./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5b4659b27a54f579598b48dab11e67b47aff28d030592fa757cae575afffc3b5 --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 19:52:23,547 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 19:52:23,552 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 19:52:23,603 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 19:52:23,604 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 19:52:23,606 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 19:52:23,607 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 19:52:23,609 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 19:52:23,611 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 19:52:23,615 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 19:52:23,616 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 19:52:23,617 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 19:52:23,617 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 19:52:23,619 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 19:52:23,621 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 19:52:23,623 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 19:52:23,625 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 19:52:23,626 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 19:52:23,627 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 19:52:23,630 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 19:52:23,633 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 19:52:23,634 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 19:52:23,635 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 19:52:23,635 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 19:52:23,640 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 19:52:23,643 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 19:52:23,644 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 19:52:23,644 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 19:52:23,645 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 19:52:23,646 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 19:52:23,646 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 19:52:23,646 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 19:52:23,647 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 19:52:23,648 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 19:52:23,649 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 19:52:23,649 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 19:52:23,650 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 19:52:23,650 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 19:52:23,650 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 19:52:23,651 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 19:52:23,651 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 19:52:23,652 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-14 19:52:23,670 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 19:52:23,670 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 19:52:23,670 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 19:52:23,671 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 19:52:23,671 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 19:52:23,671 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 19:52:23,672 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 19:52:23,672 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 19:52:23,672 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 19:52:23,672 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 19:52:23,672 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 19:52:23,672 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-14 19:52:23,673 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 19:52:23,673 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 19:52:23,673 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 19:52:23,673 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-14 19:52:23,673 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-14 19:52:23,673 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-14 19:52:23,673 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 19:52:23,674 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-14 19:52:23,674 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 19:52:23,674 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 19:52:23,674 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 19:52:23,674 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 19:52:23,674 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 19:52:23,674 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 19:52:23,675 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 19:52:23,675 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 19:52:23,675 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 19:52:23,675 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 19:52:23,675 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 19:52:23,675 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5b4659b27a54f579598b48dab11e67b47aff28d030592fa757cae575afffc3b5 [2021-12-14 19:52:23,836 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 19:52:23,862 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 19:52:23,865 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 19:52:23,866 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 19:52:23,867 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 19:52:23,868 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i [2021-12-14 19:52:23,916 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/439d4fe4c/0324c0d6d0574af4ae3352605a3468c8/FLAG5beb1faab [2021-12-14 19:52:24,352 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 19:52:24,354 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i [2021-12-14 19:52:24,372 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/439d4fe4c/0324c0d6d0574af4ae3352605a3468c8/FLAG5beb1faab [2021-12-14 19:52:24,381 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/439d4fe4c/0324c0d6d0574af4ae3352605a3468c8 [2021-12-14 19:52:24,383 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 19:52:24,384 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 19:52:24,384 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 19:52:24,385 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 19:52:24,387 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 19:52:24,387 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:52:24" (1/1) ... [2021-12-14 19:52:24,389 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55b2bd2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:52:24, skipping insertion in model container [2021-12-14 19:52:24,390 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:52:24" (1/1) ... [2021-12-14 19:52:24,394 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 19:52:24,414 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 19:52:24,615 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/list-ext3-properties/sll_circular_traversal-1.i[24132,24145] [2021-12-14 19:52:24,617 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:52:24,622 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 19:52:24,656 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/list-ext3-properties/sll_circular_traversal-1.i[24132,24145] [2021-12-14 19:52:24,659 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:52:24,676 INFO L208 MainTranslator]: Completed translation [2021-12-14 19:52:24,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:52:24 WrapperNode [2021-12-14 19:52:24,676 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 19:52:24,677 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 19:52:24,677 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 19:52:24,677 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 19:52:24,682 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:52:24" (1/1) ... [2021-12-14 19:52:24,700 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:52:24" (1/1) ... [2021-12-14 19:52:24,713 INFO L137 Inliner]: procedures = 122, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 93 [2021-12-14 19:52:24,719 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 19:52:24,720 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 19:52:24,720 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 19:52:24,720 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 19:52:24,725 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:52:24" (1/1) ... [2021-12-14 19:52:24,726 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:52:24" (1/1) ... [2021-12-14 19:52:24,742 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:52:24" (1/1) ... [2021-12-14 19:52:24,744 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:52:24" (1/1) ... [2021-12-14 19:52:24,753 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:52:24" (1/1) ... [2021-12-14 19:52:24,762 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:52:24" (1/1) ... [2021-12-14 19:52:24,763 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:52:24" (1/1) ... [2021-12-14 19:52:24,765 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 19:52:24,769 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 19:52:24,769 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 19:52:24,770 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 19:52:24,771 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:52:24" (1/1) ... [2021-12-14 19:52:24,776 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 19:52:24,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:52:24,793 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) [2021-12-14 19:52:24,798 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 [2021-12-14 19:52:24,817 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2021-12-14 19:52:24,817 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2021-12-14 19:52:24,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-14 19:52:24,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-14 19:52:24,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-14 19:52:24,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 19:52:24,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-14 19:52:24,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-14 19:52:24,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-14 19:52:24,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 19:52:24,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 19:52:24,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 19:52:24,897 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 19:52:24,898 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 19:52:24,945 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2021-12-14 19:52:25,083 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 19:52:25,088 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 19:52:25,088 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-12-14 19:52:25,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:52:25 BoogieIcfgContainer [2021-12-14 19:52:25,101 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 19:52:25,102 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 19:52:25,102 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 19:52:25,104 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 19:52:25,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 07:52:24" (1/3) ... [2021-12-14 19:52:25,105 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@676e2630 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:52:25, skipping insertion in model container [2021-12-14 19:52:25,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:52:24" (2/3) ... [2021-12-14 19:52:25,106 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@676e2630 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:52:25, skipping insertion in model container [2021-12-14 19:52:25,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:52:25" (3/3) ... [2021-12-14 19:52:25,107 INFO L111 eAbstractionObserver]: Analyzing ICFG sll_circular_traversal-1.i [2021-12-14 19:52:25,113 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 19:52:25,113 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2021-12-14 19:52:25,144 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 19:52:25,149 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-14 19:52:25,149 INFO L340 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2021-12-14 19:52:25,159 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 39 states have (on average 2.0) internal successors, (78), 68 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:25,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-12-14 19:52:25,163 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:52:25,164 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-12-14 19:52:25,164 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-14 19:52:25,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:52:25,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1079622, now seen corresponding path program 1 times [2021-12-14 19:52:25,173 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:52:25,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158530849] [2021-12-14 19:52:25,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:52:25,174 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:52:25,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:52:25,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:52:25,326 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:52:25,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158530849] [2021-12-14 19:52:25,326 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158530849] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:52:25,327 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:52:25,327 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:52:25,328 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029787021] [2021-12-14 19:52:25,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:52:25,331 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:52:25,332 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:52:25,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:52:25,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:52:25,358 INFO L87 Difference]: Start difference. First operand has 70 states, 39 states have (on average 2.0) internal successors, (78), 68 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:25,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:52:25,436 INFO L93 Difference]: Finished difference Result 92 states and 100 transitions. [2021-12-14 19:52:25,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:52:25,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2021-12-14 19:52:25,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:52:25,444 INFO L225 Difference]: With dead ends: 92 [2021-12-14 19:52:25,444 INFO L226 Difference]: Without dead ends: 86 [2021-12-14 19:52:25,446 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:52:25,449 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 60 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:52:25,450 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 67 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:52:25,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2021-12-14 19:52:25,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 61. [2021-12-14 19:52:25,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 36 states have (on average 1.8055555555555556) internal successors, (65), 60 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:25,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2021-12-14 19:52:25,481 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 4 [2021-12-14 19:52:25,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:52:25,481 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2021-12-14 19:52:25,481 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:25,481 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2021-12-14 19:52:25,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-12-14 19:52:25,482 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:52:25,482 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-12-14 19:52:25,482 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 19:52:25,483 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-14 19:52:25,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:52:25,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1079623, now seen corresponding path program 1 times [2021-12-14 19:52:25,485 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:52:25,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333194015] [2021-12-14 19:52:25,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:52:25,486 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:52:25,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:52:25,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:52:25,556 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:52:25,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333194015] [2021-12-14 19:52:25,557 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333194015] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:52:25,557 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:52:25,557 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:52:25,557 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711587016] [2021-12-14 19:52:25,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:52:25,558 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:52:25,559 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:52:25,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:52:25,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:52:25,560 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:25,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:52:25,596 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2021-12-14 19:52:25,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:52:25,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2021-12-14 19:52:25,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:52:25,598 INFO L225 Difference]: With dead ends: 58 [2021-12-14 19:52:25,598 INFO L226 Difference]: Without dead ends: 58 [2021-12-14 19:52:25,601 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:52:25,603 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 58 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:52:25,603 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 42 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:52:25,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2021-12-14 19:52:25,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2021-12-14 19:52:25,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 36 states have (on average 1.7222222222222223) internal successors, (62), 57 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:25,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2021-12-14 19:52:25,613 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 4 [2021-12-14 19:52:25,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:52:25,614 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2021-12-14 19:52:25,614 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:25,615 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2021-12-14 19:52:25,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-14 19:52:25,615 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:52:25,615 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:52:25,616 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-14 19:52:25,616 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-14 19:52:25,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:52:25,617 INFO L85 PathProgramCache]: Analyzing trace with hash 2065248729, now seen corresponding path program 1 times [2021-12-14 19:52:25,617 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:52:25,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024996943] [2021-12-14 19:52:25,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:52:25,617 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:52:25,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:52:25,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:52:25,660 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:52:25,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024996943] [2021-12-14 19:52:25,661 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024996943] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:52:25,661 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:52:25,661 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:52:25,661 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546523015] [2021-12-14 19:52:25,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:52:25,662 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:52:25,662 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:52:25,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:52:25,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:52:25,662 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:25,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:52:25,729 INFO L93 Difference]: Finished difference Result 98 states and 107 transitions. [2021-12-14 19:52:25,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:52:25,729 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-12-14 19:52:25,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:52:25,731 INFO L225 Difference]: With dead ends: 98 [2021-12-14 19:52:25,731 INFO L226 Difference]: Without dead ends: 98 [2021-12-14 19:52:25,732 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:52:25,737 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 49 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:52:25,738 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 118 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:52:25,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-12-14 19:52:25,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 56. [2021-12-14 19:52:25,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 55 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:25,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2021-12-14 19:52:25,751 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 9 [2021-12-14 19:52:25,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:52:25,751 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2021-12-14 19:52:25,752 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:25,752 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2021-12-14 19:52:25,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-14 19:52:25,753 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:52:25,753 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:52:25,753 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-14 19:52:25,753 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-14 19:52:25,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:52:25,755 INFO L85 PathProgramCache]: Analyzing trace with hash 2065248730, now seen corresponding path program 1 times [2021-12-14 19:52:25,755 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:52:25,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615738913] [2021-12-14 19:52:25,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:52:25,756 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:52:25,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:52:25,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:52:25,808 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:52:25,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615738913] [2021-12-14 19:52:25,808 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615738913] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:52:25,809 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:52:25,809 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:52:25,809 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016534434] [2021-12-14 19:52:25,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:52:25,810 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:52:25,810 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:52:25,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:52:25,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:52:25,811 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:25,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:52:25,857 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2021-12-14 19:52:25,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:52:25,858 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-12-14 19:52:25,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:52:25,859 INFO L225 Difference]: With dead ends: 98 [2021-12-14 19:52:25,860 INFO L226 Difference]: Without dead ends: 98 [2021-12-14 19:52:25,860 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:52:25,863 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 50 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:52:25,864 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 128 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:52:25,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-12-14 19:52:25,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 54. [2021-12-14 19:52:25,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 53 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:25,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2021-12-14 19:52:25,869 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 9 [2021-12-14 19:52:25,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:52:25,869 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2021-12-14 19:52:25,869 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:25,869 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2021-12-14 19:52:25,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-14 19:52:25,870 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:52:25,870 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:52:25,870 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-14 19:52:25,870 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-14 19:52:25,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:52:25,871 INFO L85 PathProgramCache]: Analyzing trace with hash 427661500, now seen corresponding path program 1 times [2021-12-14 19:52:25,871 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:52:25,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875711811] [2021-12-14 19:52:25,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:52:25,871 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:52:25,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:52:25,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:52:25,923 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:52:25,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875711811] [2021-12-14 19:52:25,924 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875711811] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:52:25,924 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:52:25,924 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:52:25,924 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277738018] [2021-12-14 19:52:25,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:52:25,925 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 19:52:25,925 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:52:25,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 19:52:25,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:52:25,925 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:26,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:52:26,047 INFO L93 Difference]: Finished difference Result 118 states and 129 transitions. [2021-12-14 19:52:26,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 19:52:26,047 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-14 19:52:26,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:52:26,048 INFO L225 Difference]: With dead ends: 118 [2021-12-14 19:52:26,048 INFO L226 Difference]: Without dead ends: 118 [2021-12-14 19:52:26,048 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:52:26,049 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 266 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:52:26,049 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [266 Valid, 111 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:52:26,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-12-14 19:52:26,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 55. [2021-12-14 19:52:26,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 41 states have (on average 1.4878048780487805) internal successors, (61), 54 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:26,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2021-12-14 19:52:26,052 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 11 [2021-12-14 19:52:26,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:52:26,053 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2021-12-14 19:52:26,053 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:26,053 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2021-12-14 19:52:26,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-14 19:52:26,053 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:52:26,053 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:52:26,053 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-14 19:52:26,054 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-14 19:52:26,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:52:26,054 INFO L85 PathProgramCache]: Analyzing trace with hash 427661501, now seen corresponding path program 1 times [2021-12-14 19:52:26,054 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:52:26,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855603501] [2021-12-14 19:52:26,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:52:26,055 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:52:26,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:52:26,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:52:26,078 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:52:26,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855603501] [2021-12-14 19:52:26,078 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855603501] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:52:26,078 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:52:26,078 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:52:26,078 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555254109] [2021-12-14 19:52:26,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:52:26,079 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:52:26,079 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:52:26,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:52:26,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:52:26,079 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:26,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:52:26,083 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2021-12-14 19:52:26,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:52:26,084 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-14 19:52:26,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:52:26,084 INFO L225 Difference]: With dead ends: 55 [2021-12-14 19:52:26,084 INFO L226 Difference]: Without dead ends: 55 [2021-12-14 19:52:26,085 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:52:26,085 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 4 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:52:26,085 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 98 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:52:26,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2021-12-14 19:52:26,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 51. [2021-12-14 19:52:26,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 37 states have (on average 1.4864864864864864) internal successors, (55), 50 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:26,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2021-12-14 19:52:26,087 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 11 [2021-12-14 19:52:26,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:52:26,088 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2021-12-14 19:52:26,088 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:26,088 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2021-12-14 19:52:26,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-14 19:52:26,088 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:52:26,088 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:52:26,089 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-14 19:52:26,089 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-14 19:52:26,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:52:26,089 INFO L85 PathProgramCache]: Analyzing trace with hash 200371689, now seen corresponding path program 1 times [2021-12-14 19:52:26,089 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:52:26,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059720323] [2021-12-14 19:52:26,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:52:26,090 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:52:26,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:52:26,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:52:26,127 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:52:26,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059720323] [2021-12-14 19:52:26,127 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059720323] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:52:26,127 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:52:26,127 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 19:52:26,127 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825396614] [2021-12-14 19:52:26,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:52:26,128 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:52:26,128 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:52:26,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:52:26,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:52:26,129 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:26,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:52:26,216 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2021-12-14 19:52:26,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:52:26,216 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-14 19:52:26,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:52:26,217 INFO L225 Difference]: With dead ends: 81 [2021-12-14 19:52:26,217 INFO L226 Difference]: Without dead ends: 81 [2021-12-14 19:52:26,218 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-14 19:52:26,219 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 158 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:52:26,219 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [158 Valid, 88 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:52:26,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-12-14 19:52:26,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 52. [2021-12-14 19:52:26,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 38 states have (on average 1.5) internal successors, (57), 51 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:26,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2021-12-14 19:52:26,229 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 16 [2021-12-14 19:52:26,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:52:26,229 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2021-12-14 19:52:26,230 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:26,230 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2021-12-14 19:52:26,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-14 19:52:26,230 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:52:26,231 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:52:26,231 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-14 19:52:26,231 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-14 19:52:26,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:52:26,232 INFO L85 PathProgramCache]: Analyzing trace with hash 200371690, now seen corresponding path program 1 times [2021-12-14 19:52:26,232 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:52:26,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612134946] [2021-12-14 19:52:26,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:52:26,233 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:52:26,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:52:26,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:52:26,265 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:52:26,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612134946] [2021-12-14 19:52:26,265 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612134946] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:52:26,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173786722] [2021-12-14 19:52:26,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:52:26,266 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:52:26,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:52:26,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) [2021-12-14 19:52:26,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-14 19:52:26,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:52:26,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-14 19:52:26,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:52:26,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:52:26,430 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:52:26,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:52:26,479 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173786722] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:52:26,479 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:52:26,479 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2021-12-14 19:52:26,479 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688221101] [2021-12-14 19:52:26,479 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:52:26,479 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:52:26,479 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:52:26,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:52:26,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:52:26,480 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:26,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:52:26,493 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2021-12-14 19:52:26,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:52:26,494 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-14 19:52:26,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:52:26,494 INFO L225 Difference]: With dead ends: 67 [2021-12-14 19:52:26,494 INFO L226 Difference]: Without dead ends: 67 [2021-12-14 19:52:26,494 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:52:26,495 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 20 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:52:26,495 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 233 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:52:26,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-12-14 19:52:26,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2021-12-14 19:52:26,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 66 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:26,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2021-12-14 19:52:26,497 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 16 [2021-12-14 19:52:26,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:52:26,497 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2021-12-14 19:52:26,497 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:26,497 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2021-12-14 19:52:26,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-14 19:52:26,497 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:52:26,497 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:52:26,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-14 19:52:26,711 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:52:26,711 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-14 19:52:26,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:52:26,712 INFO L85 PathProgramCache]: Analyzing trace with hash 527522045, now seen corresponding path program 2 times [2021-12-14 19:52:26,712 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:52:26,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890289921] [2021-12-14 19:52:26,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:52:26,712 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:52:26,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:52:26,802 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-14 19:52:26,802 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:52:26,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890289921] [2021-12-14 19:52:26,802 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890289921] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:52:26,802 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:52:26,803 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 19:52:26,803 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365219697] [2021-12-14 19:52:26,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:52:26,803 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:52:26,803 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:52:26,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:52:26,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:52:26,804 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:26,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:52:26,897 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2021-12-14 19:52:26,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:52:26,897 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-12-14 19:52:26,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:52:26,898 INFO L225 Difference]: With dead ends: 73 [2021-12-14 19:52:26,898 INFO L226 Difference]: Without dead ends: 73 [2021-12-14 19:52:26,898 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-14 19:52:26,899 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 155 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:52:26,899 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [155 Valid, 60 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:52:26,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-12-14 19:52:26,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2021-12-14 19:52:26,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 56 states have (on average 1.3392857142857142) internal successors, (75), 69 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:26,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2021-12-14 19:52:26,901 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 31 [2021-12-14 19:52:26,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:52:26,902 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2021-12-14 19:52:26,902 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:26,902 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2021-12-14 19:52:26,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-14 19:52:26,902 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:52:26,903 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:52:26,903 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-14 19:52:26,903 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-14 19:52:26,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:52:26,903 INFO L85 PathProgramCache]: Analyzing trace with hash 142544443, now seen corresponding path program 1 times [2021-12-14 19:52:26,904 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:52:26,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840521655] [2021-12-14 19:52:26,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:52:26,904 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:52:26,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:52:27,076 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-14 19:52:27,077 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:52:27,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840521655] [2021-12-14 19:52:27,077 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840521655] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:52:27,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290097835] [2021-12-14 19:52:27,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:52:27,077 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:52:27,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:52:27,078 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) [2021-12-14 19:52:27,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-14 19:52:27,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:52:27,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 33 conjunts are in the unsatisfiable core [2021-12-14 19:52:27,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:52:27,349 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-14 19:52:27,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:52:27,410 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-14 19:52:27,471 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-14 19:52:27,486 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-14 19:52:27,487 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:52:28,317 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_410 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_410)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4)))) is different from false [2021-12-14 19:52:29,092 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_410 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_410)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 4)))) is different from false [2021-12-14 19:52:29,274 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 7 not checked. [2021-12-14 19:52:29,275 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290097835] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:52:29,275 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:52:29,275 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2021-12-14 19:52:29,275 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780342917] [2021-12-14 19:52:29,276 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:52:29,276 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-12-14 19:52:29,276 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:52:29,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-12-14 19:52:29,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=446, Unknown=2, NotChecked=86, Total=600 [2021-12-14 19:52:29,277 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand has 25 states, 25 states have (on average 2.56) internal successors, (64), 25 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:29,684 WARN L838 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (= |c_ULTIMATE.start_main_~data_init~0#1| |c_ULTIMATE.start_sll_circular_create_~data#1|) (<= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data_init~0#1| 1) (forall ((v_ArrVal_410 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_410)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 4)))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0)) is different from false [2021-12-14 19:52:30,015 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (and (= |c_ULTIMATE.start_main_~data_init~0#1| |c_ULTIMATE.start_sll_circular_create_~data#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse0 (+ |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 4))) (<= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data_init~0#1| 1) (<= 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= (select .cse0 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4)) |c_ULTIMATE.start_main_~data_init~0#1|) (forall ((v_ArrVal_410 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_410)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4)))))) is different from false [2021-12-14 19:52:30,339 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (and (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse0 (+ |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 4))) (<= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_main_~data_init~0#1| 1) (<= 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= (select .cse0 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4)) |c_ULTIMATE.start_main_~data_init~0#1|) (forall ((v_ArrVal_410 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_410)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4)))))) is different from false [2021-12-14 19:52:30,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:52:30,500 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2021-12-14 19:52:30,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 19:52:30,501 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.56) internal successors, (64), 25 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-12-14 19:52:30,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:52:30,501 INFO L225 Difference]: With dead ends: 70 [2021-12-14 19:52:30,501 INFO L226 Difference]: Without dead ends: 70 [2021-12-14 19:52:30,501 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=129, Invalid=698, Unknown=5, NotChecked=290, Total=1122 [2021-12-14 19:52:30,502 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 14 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 43 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:52:30,502 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 520 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 251 Invalid, 0 Unknown, 43 Unchecked, 0.1s Time] [2021-12-14 19:52:30,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2021-12-14 19:52:30,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2021-12-14 19:52:30,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 69 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:30,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2021-12-14 19:52:30,504 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 33 [2021-12-14 19:52:30,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:52:30,504 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2021-12-14 19:52:30,504 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.56) internal successors, (64), 25 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:30,504 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2021-12-14 19:52:30,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-14 19:52:30,505 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:52:30,505 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:52:30,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-14 19:52:30,705 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-12-14 19:52:30,705 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-14 19:52:30,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:52:30,706 INFO L85 PathProgramCache]: Analyzing trace with hash 2041941388, now seen corresponding path program 1 times [2021-12-14 19:52:30,706 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:52:30,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380697633] [2021-12-14 19:52:30,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:52:30,706 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:52:30,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:52:30,988 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-14 19:52:30,988 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:52:30,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380697633] [2021-12-14 19:52:30,988 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380697633] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:52:30,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102941202] [2021-12-14 19:52:30,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:52:30,989 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:52:30,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:52:30,990 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) [2021-12-14 19:52:30,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-14 19:52:31,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:52:31,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 64 conjunts are in the unsatisfiable core [2021-12-14 19:52:31,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:52:31,129 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:52:31,173 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-14 19:52:31,173 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2021-12-14 19:52:31,213 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:52:31,218 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:52:31,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:52:31,251 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2021-12-14 19:52:31,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:52:31,259 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-14 19:52:31,314 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-12-14 19:52:31,314 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2021-12-14 19:52:31,324 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-12-14 19:52:31,324 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2021-12-14 19:52:31,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:52:31,590 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-14 19:52:31,590 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 54 [2021-12-14 19:52:31,604 INFO L354 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2021-12-14 19:52:31,604 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 53 [2021-12-14 19:52:31,678 INFO L354 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2021-12-14 19:52:31,679 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 41 [2021-12-14 19:52:31,688 INFO L354 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2021-12-14 19:52:31,688 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 19 [2021-12-14 19:52:31,745 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-14 19:52:31,745 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:52:33,872 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= (select |c_#valid| .cse0) 1) (and (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))) is different from false [2021-12-14 19:52:35,908 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (and (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse0) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (= (select |c_#valid| .cse0) 1)))) is different from false [2021-12-14 19:52:37,938 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_584 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 4) v_ArrVal_584)))) (store .cse2 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse2 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (= (select |c_#valid| .cse0) 1) (and (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse0) (forall ((v_ArrVal_583 Int)) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| (select (select (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 4) v_ArrVal_583)))) (store .cse1 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse1 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))))) is different from false [2021-12-14 19:52:38,192 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 3 not checked. [2021-12-14 19:52:38,193 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [102941202] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:52:38,193 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:52:38,193 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 29 [2021-12-14 19:52:38,193 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472613837] [2021-12-14 19:52:38,194 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:52:38,195 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-12-14 19:52:38,195 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:52:38,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-12-14 19:52:38,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=624, Unknown=3, NotChecked=156, Total=870 [2021-12-14 19:52:38,196 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand has 30 states, 29 states have (on average 2.4482758620689653) internal successors, (71), 30 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:48,409 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1))) (and (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) .cse0 (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 0) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (= 1 (select |c_#valid| .cse1)) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse1))) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (and (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse2) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (= (select |c_#valid| .cse2) 1)))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0))) is different from false [2021-12-14 19:52:50,412 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= (select |c_#valid| .cse0) 1) (and (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= (select |c_#valid| .cse1) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse1))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 0)) is different from false [2021-12-14 19:52:52,415 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= (select |c_#valid| .cse0) 1) (and (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= (select |c_#valid| .cse1) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse1))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 0)) is different from false [2021-12-14 19:52:52,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:52:52,582 INFO L93 Difference]: Finished difference Result 100 states and 107 transitions. [2021-12-14 19:52:52,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-14 19:52:52,582 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.4482758620689653) internal successors, (71), 30 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-12-14 19:52:52,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:52:52,583 INFO L225 Difference]: With dead ends: 100 [2021-12-14 19:52:52,583 INFO L226 Difference]: Without dead ends: 100 [2021-12-14 19:52:52,583 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 20.5s TimeCoverageRelationStatistics Valid=137, Invalid=869, Unknown=10, NotChecked=390, Total=1406 [2021-12-14 19:52:52,584 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 96 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 256 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:52:52,584 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 198 Invalid, 831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 557 Invalid, 0 Unknown, 256 Unchecked, 0.2s Time] [2021-12-14 19:52:52,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-12-14 19:52:52,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 80. [2021-12-14 19:52:52,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 66 states have (on average 1.378787878787879) internal successors, (91), 79 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:52,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 91 transitions. [2021-12-14 19:52:52,586 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 91 transitions. Word has length 37 [2021-12-14 19:52:52,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:52:52,586 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 91 transitions. [2021-12-14 19:52:52,586 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.4482758620689653) internal successors, (71), 30 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:52,586 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 91 transitions. [2021-12-14 19:52:52,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-14 19:52:52,587 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:52:52,587 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:52:52,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-14 19:52:52,795 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:52:52,795 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-14 19:52:52,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:52:52,796 INFO L85 PathProgramCache]: Analyzing trace with hash 2041941389, now seen corresponding path program 1 times [2021-12-14 19:52:52,796 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:52:52,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59893423] [2021-12-14 19:52:52,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:52:52,796 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:52:52,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:52:53,136 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-14 19:52:53,136 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:52:53,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59893423] [2021-12-14 19:52:53,136 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59893423] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:52:53,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557885641] [2021-12-14 19:52:53,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:52:53,137 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:52:53,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:52:53,138 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) [2021-12-14 19:52:53,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-14 19:52:53,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:52:53,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 62 conjunts are in the unsatisfiable core [2021-12-14 19:52:53,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:52:53,354 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-14 19:52:53,355 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2021-12-14 19:52:53,412 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:52:53,417 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:52:53,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:52:53,454 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-14 19:52:53,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:52:53,461 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2021-12-14 19:52:53,525 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-12-14 19:52:53,525 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2021-12-14 19:52:53,535 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-12-14 19:52:53,536 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2021-12-14 19:52:53,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:52:53,791 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-14 19:52:53,791 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 55 [2021-12-14 19:52:53,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:52:53,796 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-14 19:52:53,796 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 66 [2021-12-14 19:52:53,826 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:52:53,826 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 32 [2021-12-14 19:52:53,837 INFO L354 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2021-12-14 19:52:53,838 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 45 [2021-12-14 19:52:53,924 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 25 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-14 19:52:53,924 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:52:56,223 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse0 (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (and (<= 0 (+ .cse0 4)) (<= (+ .cse0 8) (select |c_#length| .cse1))) (and (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| .cse0))))) is different from false [2021-12-14 19:52:58,307 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse0 (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (and (<= (+ .cse0 8) (select |c_#length| .cse1)) (<= 0 (+ .cse0 4))) (and (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse1) (= .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))) is different from false [2021-12-14 19:53:00,376 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_763 Int) (v_ArrVal_762 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse3 (+ |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 4))) (let ((.cse1 (select (select (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse3 v_ArrVal_762)))) (store .cse4 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse4 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse3 v_ArrVal_763)))) (store .cse2 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse2 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (and (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse0) (= .cse1 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (and (<= 0 (+ .cse1 4)) (<= (+ .cse1 8) (select |c_#length| .cse0))))))) is different from false [2021-12-14 19:53:01,784 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2021-12-14 19:53:01,823 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 3 not checked. [2021-12-14 19:53:01,823 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557885641] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:53:01,823 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:53:01,823 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 38 [2021-12-14 19:53:01,824 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320289212] [2021-12-14 19:53:01,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:53:01,824 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-12-14 19:53:01,824 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:53:01,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-12-14 19:53:01,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1137, Unknown=3, NotChecked=210, Total=1482 [2021-12-14 19:53:01,825 INFO L87 Difference]: Start difference. First operand 80 states and 91 transitions. Second operand has 39 states, 38 states have (on average 2.210526315789474) internal successors, (84), 39 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:53:04,025 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse12 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse4 (select |c_#length| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (let ((.cse2 (= .cse4 8)) (.cse3 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse0 (select |c_#length| .cse12)) (.cse1 (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse12)) (.cse11 (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (and (or (<= 8 .cse0) .cse1) .cse2 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (or .cse3 (<= (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 8) .cse4)) (= .cse5 0) (= 8 (select |c_#length| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (forall ((v_ArrVal_763 Int) (v_ArrVal_762 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse9 (+ |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 4))) (let ((.cse7 (select (select (let ((.cse10 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse9 v_ArrVal_762)))) (store .cse10 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse10 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse9 v_ArrVal_763)))) (store .cse8 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse8 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (and (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse6) (= .cse7 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (and (<= 0 (+ .cse7 4)) (<= (+ .cse7 8) (select |c_#length| .cse6))))))) (or .cse11 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (or .cse11 .cse2 .cse3) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (or .cse11 (= .cse0 8) .cse1) (or .cse11 (= .cse5 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))) is different from false [2021-12-14 19:53:06,029 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (let ((.cse0 (select |c_#length| .cse6)) (.cse1 (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse6)) (.cse5 (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (and (or (<= 8 .cse0) .cse1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= .cse2 0) (= 8 (select |c_#length| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse4 (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse3 (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (and (<= (+ .cse3 8) (select |c_#length| .cse4)) (<= 0 (+ .cse3 4))) (and (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse4) (= .cse3 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))) (or .cse5 (= .cse0 8) .cse1) (or .cse5 (= .cse2 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))) is different from false [2021-12-14 19:53:08,040 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (let ((.cse5 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) (.cse4 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (.cse3 (select |c_#length| .cse7)) (.cse2 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse7)) (.cse6 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (and (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse0 (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (and (<= 0 (+ .cse0 4)) (<= (+ .cse0 8) (select |c_#length| .cse1))) (and (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| .cse0))))) (= (select |c_#length| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 8) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (or (and (or .cse2 (= .cse3 8)) (not .cse4)) (and .cse5 .cse4)) (or (and (= .cse6 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) .cse5) .cse4) (or (<= 8 .cse3) .cse2) (= .cse6 0)))) is different from false [2021-12-14 19:53:10,134 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse12 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse11 (select |c_#length| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (let ((.cse3 (<= (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 8) .cse11)) (.cse2 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse0 (select |c_#length| .cse12)) (.cse1 (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse12)) (.cse10 (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (and (or (<= 8 .cse0) .cse1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (or .cse2 .cse3) (= .cse4 0) .cse3 (= 8 (select |c_#length| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (forall ((v_ArrVal_763 Int) (v_ArrVal_762 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse8 (+ |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 4))) (let ((.cse6 (select (select (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse8 v_ArrVal_762)))) (store .cse9 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse9 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse8 v_ArrVal_763)))) (store .cse7 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse7 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (and (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse5) (= .cse6 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (and (<= 0 (+ .cse6 4)) (<= (+ .cse6 8) (select |c_#length| .cse5))))))) (or .cse10 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (or .cse10 (= .cse11 8) .cse2) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (or .cse10 (= .cse0 8) .cse1) (or .cse10 (= .cse4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))) is different from false [2021-12-14 19:53:12,141 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (let ((.cse5 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) (.cse4 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (.cse3 (select |c_#length| .cse7)) (.cse2 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse7)) (.cse6 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (and (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse0 (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (and (<= 0 (+ .cse0 4)) (<= (+ .cse0 8) (select |c_#length| .cse1))) (and (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| .cse0))))) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (or (and (or .cse2 (= .cse3 8)) (not .cse4)) (and .cse5 .cse4)) (or (and (= .cse6 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) .cse5) .cse4) (or (<= 8 .cse3) .cse2) (= .cse6 0)))) is different from false [2021-12-14 19:53:12,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:53:12,532 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2021-12-14 19:53:12,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-14 19:53:12,533 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.210526315789474) internal successors, (84), 39 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-12-14 19:53:12,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:53:12,534 INFO L225 Difference]: With dead ends: 98 [2021-12-14 19:53:12,534 INFO L226 Difference]: Without dead ends: 98 [2021-12-14 19:53:12,535 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 18.0s TimeCoverageRelationStatistics Valid=213, Invalid=1703, Unknown=8, NotChecked=728, Total=2652 [2021-12-14 19:53:12,535 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 112 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 308 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 19:53:12,536 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 310 Invalid, 961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 632 Invalid, 0 Unknown, 308 Unchecked, 0.3s Time] [2021-12-14 19:53:12,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-12-14 19:53:12,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 82. [2021-12-14 19:53:12,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 69 states have (on average 1.3333333333333333) internal successors, (92), 81 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:53:12,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2021-12-14 19:53:12,538 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 37 [2021-12-14 19:53:12,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:53:12,538 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2021-12-14 19:53:12,538 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.210526315789474) internal successors, (84), 39 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:53:12,538 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2021-12-14 19:53:12,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-14 19:53:12,539 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:53:12,539 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:53:12,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-14 19:53:12,739 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:53:12,740 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-14 19:53:12,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:53:12,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1124327535, now seen corresponding path program 1 times [2021-12-14 19:53:12,740 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:53:12,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381323371] [2021-12-14 19:53:12,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:53:12,740 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:53:12,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:12,809 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-12-14 19:53:12,810 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:53:12,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381323371] [2021-12-14 19:53:12,810 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381323371] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:53:12,810 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:53:12,810 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:53:12,810 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231005388] [2021-12-14 19:53:12,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:53:12,811 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 19:53:12,811 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:53:12,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 19:53:12,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:53:12,812 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:53:12,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:53:12,889 INFO L93 Difference]: Finished difference Result 119 states and 131 transitions. [2021-12-14 19:53:12,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:53:12,889 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-12-14 19:53:12,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:53:12,890 INFO L225 Difference]: With dead ends: 119 [2021-12-14 19:53:12,890 INFO L226 Difference]: Without dead ends: 119 [2021-12-14 19:53:12,890 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:53:12,891 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 129 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:53:12,891 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 92 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:53:12,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-12-14 19:53:12,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 88. [2021-12-14 19:53:12,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 75 states have (on average 1.3466666666666667) internal successors, (101), 87 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:53:12,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 101 transitions. [2021-12-14 19:53:12,893 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 101 transitions. Word has length 38 [2021-12-14 19:53:12,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:53:12,894 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 101 transitions. [2021-12-14 19:53:12,894 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:53:12,894 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 101 transitions. [2021-12-14 19:53:12,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-14 19:53:12,894 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:53:12,894 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:53:12,895 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-14 19:53:12,895 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-14 19:53:12,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:53:12,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1124327534, now seen corresponding path program 1 times [2021-12-14 19:53:12,895 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:53:12,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538380110] [2021-12-14 19:53:12,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:53:12,896 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:53:12,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:12,990 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-14 19:53:12,990 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:53:12,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538380110] [2021-12-14 19:53:12,990 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538380110] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:53:12,990 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:53:12,990 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-14 19:53:12,991 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031771239] [2021-12-14 19:53:12,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:53:12,991 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 19:53:12,991 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:53:12,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 19:53:12,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:53:12,992 INFO L87 Difference]: Start difference. First operand 88 states and 101 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:53:13,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:53:13,108 INFO L93 Difference]: Finished difference Result 98 states and 109 transitions. [2021-12-14 19:53:13,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:53:13,109 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-12-14 19:53:13,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:53:13,109 INFO L225 Difference]: With dead ends: 98 [2021-12-14 19:53:13,109 INFO L226 Difference]: Without dead ends: 98 [2021-12-14 19:53:13,110 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-12-14 19:53:13,110 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 292 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:53:13,110 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [292 Valid, 37 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:53:13,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-12-14 19:53:13,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 85. [2021-12-14 19:53:13,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 73 states have (on average 1.3013698630136987) internal successors, (95), 84 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:53:13,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 95 transitions. [2021-12-14 19:53:13,112 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 95 transitions. Word has length 38 [2021-12-14 19:53:13,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:53:13,113 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 95 transitions. [2021-12-14 19:53:13,113 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:53:13,113 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 95 transitions. [2021-12-14 19:53:13,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-14 19:53:13,113 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:53:13,113 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:53:13,114 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-14 19:53:13,114 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 24 more)] === [2021-12-14 19:53:13,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:53:13,114 INFO L85 PathProgramCache]: Analyzing trace with hash -494379317, now seen corresponding path program 1 times [2021-12-14 19:53:13,114 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:53:13,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957476104] [2021-12-14 19:53:13,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:53:13,115 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:53:13,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:13,648 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-14 19:53:13,648 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:53:13,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957476104] [2021-12-14 19:53:13,648 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957476104] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:53:13,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524834926] [2021-12-14 19:53:13,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:53:13,649 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:53:13,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:53:13,650 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) [2021-12-14 19:53:13,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-14 19:53:13,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:53:13,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 77 conjunts are in the unsatisfiable core [2021-12-14 19:53:13,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:53:13,925 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-14 19:53:14,045 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:53:14,052 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:53:14,077 INFO L354 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2021-12-14 19:53:14,077 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 28 [2021-12-14 19:53:14,081 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-12-14 19:53:14,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:53:14,135 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-14 19:53:14,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:53:14,140 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2021-12-14 19:53:14,150 INFO L354 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2021-12-14 19:53:14,151 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 36 [2021-12-14 19:53:14,250 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-12-14 19:53:14,250 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 30 [2021-12-14 19:53:14,255 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-14 19:53:14,264 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-12-14 19:53:14,264 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2021-12-14 19:53:14,571 INFO L354 Elim1Store]: treesize reduction 68, result has 21.8 percent of original size [2021-12-14 19:53:14,572 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 71 [2021-12-14 19:53:14,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:53:14,581 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-14 19:53:14,582 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 56 [2021-12-14 19:53:14,596 INFO L354 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2021-12-14 19:53:14,596 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 48 [2021-12-14 19:53:14,609 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-12-14 19:53:14,715 INFO L354 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2021-12-14 19:53:14,715 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 43 [2021-12-14 19:53:14,725 INFO L354 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2021-12-14 19:53:14,726 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 19 [2021-12-14 19:53:14,826 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-14 19:53:14,849 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-14 19:53:14,850 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:53:15,254 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1121 Int) (v_ArrVal_1120 Int) (v_ArrVal_1122 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_1119 Int)) (let ((.cse2 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4))) (let ((.cse0 (select (store (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2 v_ArrVal_1121) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse1 (select (store (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2 v_ArrVal_1120) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (and (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| .cse1)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1119)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_1122) .cse0) (+ .cse1 4))))))) is different from false [2021-12-14 19:53:15,327 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1121 Int) (v_ArrVal_1120 Int) (v_ArrVal_1122 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_1119 Int)) (let ((.cse2 (+ |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 4))) (let ((.cse1 (select (store (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse2 v_ArrVal_1121) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse0 (select (store (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse2 v_ArrVal_1120) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (and (= .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse1)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1119)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1122) .cse1) (+ .cse0 4))))))) is different from false [2021-12-14 19:53:15,378 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1121 Int) (v_ArrVal_1110 Int) (v_ArrVal_1120 Int) (v_ArrVal_1111 (Array Int Int)) (v_ArrVal_1122 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_1109 Int) (v_ArrVal_1119 Int)) (let ((.cse4 (+ |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select (store (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse4 v_ArrVal_1109)))) (store .cse5 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse5 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse4 v_ArrVal_1121) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse1 (select (store (select (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse4 v_ArrVal_1110)))) (store .cse3 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse3 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse4 v_ArrVal_1120) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (and (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse0) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| .cse1)) (= (select (select (store (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1111))) (store .cse2 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse2 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_1119))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1122) .cse0) (+ .cse1 4)) |c_ULTIMATE.start_main_~data_init~0#1|))))) is different from false [2021-12-14 19:53:15,426 INFO L354 Elim1Store]: treesize reduction 73, result has 34.8 percent of original size [2021-12-14 19:53:15,426 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 206 treesize of output 176 [2021-12-14 19:53:15,436 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:53:15,437 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 244 treesize of output 204 [2021-12-14 19:53:15,442 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:53:15,471 INFO L354 Elim1Store]: treesize reduction 54, result has 45.5 percent of original size [2021-12-14 19:53:15,471 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 162 treesize of output 122 [2021-12-14 19:53:15,481 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:53:15,481 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 122 treesize of output 114 [2021-12-14 19:53:15,546 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:53:15,548 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 47 [2021-12-14 19:53:15,614 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:53:15,616 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2021-12-14 19:53:15,736 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:53:15,748 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:53:15,749 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 216 treesize of output 212 [2021-12-14 19:53:15,964 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 208 treesize of output 176 [2021-12-14 19:53:16,788 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:53:16,789 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 691 treesize of output 621 [2021-12-14 19:53:17,058 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-14 19:53:17,072 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3