./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5b4659b27a54f579598b48dab11e67b47aff28d030592fa757cae575afffc3b5 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 02:23:49,771 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 02:23:49,772 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 02:23:49,791 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 02:23:49,791 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 02:23:49,792 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 02:23:49,793 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 02:23:49,794 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 02:23:49,795 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 02:23:49,796 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 02:23:49,803 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 02:23:49,804 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 02:23:49,804 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 02:23:49,805 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 02:23:49,806 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 02:23:49,807 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 02:23:49,807 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 02:23:49,808 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 02:23:49,809 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 02:23:49,810 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 02:23:49,811 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 02:23:49,812 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 02:23:49,812 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 02:23:49,813 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 02:23:49,814 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 02:23:49,816 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 02:23:49,816 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 02:23:49,816 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 02:23:49,817 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 02:23:49,817 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 02:23:49,818 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 02:23:49,818 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 02:23:49,819 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 02:23:49,819 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 02:23:49,820 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 02:23:49,820 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 02:23:49,821 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 02:23:49,821 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 02:23:49,821 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 02:23:49,822 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 02:23:49,822 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 02:23:49,823 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 02:23:49,823 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-21 02:23:49,840 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 02:23:49,840 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 02:23:49,840 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 02:23:49,841 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 02:23:49,841 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 02:23:49,841 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 02:23:49,842 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 02:23:49,842 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 02:23:49,842 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 02:23:49,843 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 02:23:49,843 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 02:23:49,843 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 02:23:49,843 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 02:23:49,843 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 02:23:49,844 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 02:23:49,844 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 02:23:49,844 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 02:23:49,844 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 02:23:49,844 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 02:23:49,844 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 02:23:49,845 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 02:23:49,845 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 02:23:49,845 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 02:23:49,845 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 02:23:49,845 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 02:23:49,846 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 02:23:49,846 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 02:23:49,846 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 02:23:49,846 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 02:23:49,846 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 02:23:49,847 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 02:23:49,847 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 02:23:49,847 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 02:23:49,847 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5b4659b27a54f579598b48dab11e67b47aff28d030592fa757cae575afffc3b5 [2022-07-21 02:23:50,075 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 02:23:50,092 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 02:23:50,094 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 02:23:50,095 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 02:23:50,096 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 02:23:50,097 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 [2022-07-21 02:23:50,152 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/795d9c5c9/1b2ebb2456ff4c549266b62f45c7052f/FLAG2dbf48564 [2022-07-21 02:23:50,696 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 02:23:50,696 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i [2022-07-21 02:23:50,709 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/795d9c5c9/1b2ebb2456ff4c549266b62f45c7052f/FLAG2dbf48564 [2022-07-21 02:23:51,132 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/795d9c5c9/1b2ebb2456ff4c549266b62f45c7052f [2022-07-21 02:23:51,134 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 02:23:51,136 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 02:23:51,138 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 02:23:51,138 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 02:23:51,143 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 02:23:51,144 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 02:23:51" (1/1) ... [2022-07-21 02:23:51,145 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c0a0e4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:23:51, skipping insertion in model container [2022-07-21 02:23:51,145 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 02:23:51" (1/1) ... [2022-07-21 02:23:51,150 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 02:23:51,174 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 02:23:51,367 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] [2022-07-21 02:23:51,369 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 02:23:51,374 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 02:23:51,402 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] [2022-07-21 02:23:51,402 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 02:23:51,421 INFO L208 MainTranslator]: Completed translation [2022-07-21 02:23:51,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:23:51 WrapperNode [2022-07-21 02:23:51,422 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 02:23:51,423 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 02:23:51,423 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 02:23:51,423 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 02:23:51,429 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:23:51" (1/1) ... [2022-07-21 02:23:51,448 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:23:51" (1/1) ... [2022-07-21 02:23:51,464 INFO L137 Inliner]: procedures = 122, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 87 [2022-07-21 02:23:51,464 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 02:23:51,465 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 02:23:51,465 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 02:23:51,465 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 02:23:51,470 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:23:51" (1/1) ... [2022-07-21 02:23:51,471 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:23:51" (1/1) ... [2022-07-21 02:23:51,475 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:23:51" (1/1) ... [2022-07-21 02:23:51,475 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:23:51" (1/1) ... [2022-07-21 02:23:51,480 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:23:51" (1/1) ... [2022-07-21 02:23:51,495 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:23:51" (1/1) ... [2022-07-21 02:23:51,500 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:23:51" (1/1) ... [2022-07-21 02:23:51,503 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 02:23:51,503 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 02:23:51,504 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 02:23:51,504 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 02:23:51,504 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:23:51" (1/1) ... [2022-07-21 02:23:51,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 02:23:51,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:23:51,527 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-21 02:23:51,554 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-07-21 02:23:51,554 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-07-21 02:23:51,555 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 02:23:51,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 02:23:51,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 02:23:51,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 02:23:51,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 02:23:51,555 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 02:23:51,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 02:23:51,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 02:23:51,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 02:23:51,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 02:23:51,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-21 02:23:51,652 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 02:23:51,655 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 02:23:51,688 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-07-21 02:23:51,816 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 02:23:51,825 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 02:23:51,825 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-21 02:23:51,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 02:23:51 BoogieIcfgContainer [2022-07-21 02:23:51,826 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 02:23:51,828 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 02:23:51,828 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 02:23:51,832 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 02:23:51,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 02:23:51" (1/3) ... [2022-07-21 02:23:51,833 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@112c3209 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 02:23:51, skipping insertion in model container [2022-07-21 02:23:51,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 02:23:51" (2/3) ... [2022-07-21 02:23:51,833 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@112c3209 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 02:23:51, skipping insertion in model container [2022-07-21 02:23:51,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 02:23:51" (3/3) ... [2022-07-21 02:23:51,835 INFO L111 eAbstractionObserver]: Analyzing ICFG sll_circular_traversal-1.i [2022-07-21 02:23:51,845 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 02:23:51,846 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 02:23:51,883 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 02:23:51,900 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@60bbe131, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@685a078f [2022-07-21 02:23:51,901 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 02:23:51,909 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 24 states have (on average 1.5) internal successors, (36), 26 states have internal predecessors, (36), 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) [2022-07-21 02:23:51,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-21 02:23:51,915 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:23:51,916 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:23:51,916 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:23:51,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:23:51,920 INFO L85 PathProgramCache]: Analyzing trace with hash 70364755, now seen corresponding path program 1 times [2022-07-21 02:23:51,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:23:51,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757045692] [2022-07-21 02:23:51,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:23:51,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:23:52,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:23:52,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:23:52,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:23:52,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757045692] [2022-07-21 02:23:52,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757045692] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:23:52,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:23:52,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 02:23:52,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360228421] [2022-07-21 02:23:52,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:23:52,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-21 02:23:52,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:23:52,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-21 02:23:52,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-21 02:23:52,135 INFO L87 Difference]: Start difference. First operand has 28 states, 24 states have (on average 1.5) internal successors, (36), 26 states have internal predecessors, (36), 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 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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) [2022-07-21 02:23:52,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:23:52,149 INFO L93 Difference]: Finished difference Result 45 states and 61 transitions. [2022-07-21 02:23:52,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-21 02:23:52,152 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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 10 [2022-07-21 02:23:52,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:23:52,157 INFO L225 Difference]: With dead ends: 45 [2022-07-21 02:23:52,157 INFO L226 Difference]: Without dead ends: 20 [2022-07-21 02:23:52,160 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-21 02:23:52,163 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 02:23:52,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 02:23:52,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-07-21 02:23:52,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-07-21 02:23:52,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 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) [2022-07-21 02:23:52,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2022-07-21 02:23:52,189 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 10 [2022-07-21 02:23:52,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:23:52,189 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2022-07-21 02:23:52,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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) [2022-07-21 02:23:52,190 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-07-21 02:23:52,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-21 02:23:52,191 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:23:52,191 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:23:52,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 02:23:52,192 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:23:52,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:23:52,192 INFO L85 PathProgramCache]: Analyzing trace with hash -273185057, now seen corresponding path program 1 times [2022-07-21 02:23:52,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:23:52,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138973591] [2022-07-21 02:23:52,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:23:52,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:23:52,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:23:52,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:23:52,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:23:52,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138973591] [2022-07-21 02:23:52,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138973591] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 02:23:52,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 02:23:52,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 02:23:52,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533623480] [2022-07-21 02:23:52,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 02:23:52,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 02:23:52,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:23:52,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 02:23:52,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 02:23:52,288 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) [2022-07-21 02:23:52,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:23:52,306 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2022-07-21 02:23:52,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 02:23:52,306 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2022-07-21 02:23:52,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:23:52,308 INFO L225 Difference]: With dead ends: 36 [2022-07-21 02:23:52,308 INFO L226 Difference]: Without dead ends: 23 [2022-07-21 02:23:52,311 INFO L412 NwaCegarLoop]: 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 [2022-07-21 02:23:52,312 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 2 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 40 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 [2022-07-21 02:23:52,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 40 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 02:23:52,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-07-21 02:23:52,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2022-07-21 02:23:52,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 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) [2022-07-21 02:23:52,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2022-07-21 02:23:52,325 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 10 [2022-07-21 02:23:52,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:23:52,326 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2022-07-21 02:23:52,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) [2022-07-21 02:23:52,327 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-07-21 02:23:52,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-21 02:23:52,328 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:23:52,328 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:23:52,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 02:23:52,332 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:23:52,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:23:52,333 INFO L85 PathProgramCache]: Analyzing trace with hash 2002783247, now seen corresponding path program 1 times [2022-07-21 02:23:52,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:23:52,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138448174] [2022-07-21 02:23:52,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:23:52,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:23:52,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:23:52,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:23:52,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:23:52,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138448174] [2022-07-21 02:23:52,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138448174] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:23:52,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1383833918] [2022-07-21 02:23:52,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:23:52,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:23:52,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:23:52,425 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 02:23:52,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-21 02:23:52,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:23:52,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-21 02:23:52,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:23:52,572 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:23:52,572 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:23:52,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 02:23:52,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1383833918] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 02:23:52,623 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 02:23:52,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-07-21 02:23:52,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078255719] [2022-07-21 02:23:52,626 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 02:23:52,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 02:23:52,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:23:52,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 02:23:52,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-21 02:23:52,630 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 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) [2022-07-21 02:23:52,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:23:52,653 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2022-07-21 02:23:52,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 02:23:52,654 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 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 13 [2022-07-21 02:23:52,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:23:52,655 INFO L225 Difference]: With dead ends: 43 [2022-07-21 02:23:52,655 INFO L226 Difference]: Without dead ends: 30 [2022-07-21 02:23:52,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-21 02:23:52,656 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 16 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 02:23:52,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 43 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 02:23:52,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-21 02:23:52,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-07-21 02:23:52,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 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) [2022-07-21 02:23:52,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-07-21 02:23:52,660 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 13 [2022-07-21 02:23:52,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:23:52,660 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-07-21 02:23:52,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 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) [2022-07-21 02:23:52,660 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-07-21 02:23:52,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-21 02:23:52,661 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:23:52,661 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:23:52,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-21 02:23:52,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:23:52,878 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:23:52,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:23:52,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1740729055, now seen corresponding path program 2 times [2022-07-21 02:23:52,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:23:52,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971854608] [2022-07-21 02:23:52,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:23:52,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:23:52,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:23:53,106 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-21 02:23:53,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:23:53,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971854608] [2022-07-21 02:23:53,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971854608] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:23:53,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688788] [2022-07-21 02:23:53,107 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 02:23:53,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:23:53,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:23:53,121 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 02:23:53,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-21 02:23:53,211 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 02:23:53,211 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 02:23:53,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-21 02:23:53,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:23:53,333 INFO L390 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 [2022-07-21 02:23:53,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:23:53,368 INFO L390 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 [2022-07-21 02:23:53,410 INFO L390 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 [2022-07-21 02:23:53,424 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-21 02:23:53,425 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:23:54,464 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_231 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (= (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_231)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4)) |c_ULTIMATE.start_main_~data_init~0#1|)) is different from false [2022-07-21 02:23:54,573 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 4 not checked. [2022-07-21 02:23:54,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688788] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 02:23:54,574 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 02:23:54,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 22 [2022-07-21 02:23:54,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831712079] [2022-07-21 02:23:54,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 02:23:54,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-21 02:23:54,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:23:54,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-21 02:23:54,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=362, Unknown=1, NotChecked=38, Total=462 [2022-07-21 02:23:54,576 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 22 states, 22 states have (on average 2.090909090909091) internal successors, (46), 22 states have internal predecessors, (46), 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) [2022-07-21 02:23:55,050 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (and (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (<= 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse0 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4))) (= (select .cse0 (+ |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 4)) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (<= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~data#1| |c_ULTIMATE.start_main_~data_init~0#1|) (<= 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= |c_ULTIMATE.start_main_~data_init~0#1| 1) (= |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_~new_head~0#1.offset| 0) (forall ((v_ArrVal_231 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (= (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_231)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4)) |c_ULTIMATE.start_main_~data_init~0#1|)))) is different from false [2022-07-21 02:23:55,413 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (and (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse0 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4))) (= (select .cse0 (+ |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 4)) |c_ULTIMATE.start_main_~data_init~0#1|) (<= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~data_init~0#1| 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (forall ((v_ArrVal_231 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (= (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_231)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4)) |c_ULTIMATE.start_main_~data_init~0#1|)))) is different from false [2022-07-21 02:23:55,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:23:55,522 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-07-21 02:23:55,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 02:23:55,522 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.090909090909091) internal successors, (46), 22 states have internal predecessors, (46), 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 22 [2022-07-21 02:23:55,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:23:55,523 INFO L225 Difference]: With dead ends: 34 [2022-07-21 02:23:55,523 INFO L226 Difference]: Without dead ends: 32 [2022-07-21 02:23:55,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=132, Invalid=633, Unknown=3, NotChecked=162, Total=930 [2022-07-21 02:23:55,524 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 16 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 14 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 02:23:55,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 135 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 116 Invalid, 0 Unknown, 14 Unchecked, 0.1s Time] [2022-07-21 02:23:55,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-07-21 02:23:55,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-07-21 02:23:55,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 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) [2022-07-21 02:23:55,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-07-21 02:23:55,528 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 22 [2022-07-21 02:23:55,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:23:55,529 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-07-21 02:23:55,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.090909090909091) internal successors, (46), 22 states have internal predecessors, (46), 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) [2022-07-21 02:23:55,529 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-07-21 02:23:55,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-21 02:23:55,529 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:23:55,529 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:23:55,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-21 02:23:55,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-07-21 02:23:55,740 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:23:55,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:23:55,740 INFO L85 PathProgramCache]: Analyzing trace with hash 625081173, now seen corresponding path program 1 times [2022-07-21 02:23:55,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:23:55,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745785113] [2022-07-21 02:23:55,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:23:55,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:23:55,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:23:56,102 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 02:23:56,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:23:56,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745785113] [2022-07-21 02:23:56,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745785113] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:23:56,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63843819] [2022-07-21 02:23:56,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:23:56,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:23:56,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:23:56,104 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 02:23:56,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-21 02:23:56,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:23:56,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 69 conjunts are in the unsatisfiable core [2022-07-21 02:23:56,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:23:56,271 INFO L390 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 [2022-07-21 02:23:56,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:23:56,334 INFO L390 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-07-21 02:23:56,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:23:56,354 INFO L390 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-07-21 02:23:56,364 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-07-21 02:23:56,365 INFO L390 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 [2022-07-21 02:23:56,370 INFO L390 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 [2022-07-21 02:23:56,429 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-21 02:23:56,429 INFO L390 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 [2022-07-21 02:23:56,435 INFO L390 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 [2022-07-21 02:23:56,447 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-21 02:23:56,447 INFO L390 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 [2022-07-21 02:23:56,625 INFO L356 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2022-07-21 02:23:56,625 INFO L390 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 57 treesize of output 39 [2022-07-21 02:23:56,631 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-21 02:23:56,632 INFO L390 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 22 treesize of output 10 [2022-07-21 02:23:56,642 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 02:23:56,642 INFO L390 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 24 [2022-07-21 02:23:56,703 INFO L390 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 [2022-07-21 02:23:56,722 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-21 02:23:56,723 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:23:58,878 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (and (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (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|)) (= (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|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (forall ((v_ArrVal_387 Int) (v_ArrVal_396 (Array Int Int))) (= (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_387)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_396) (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|)) (+ (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|) 4)) |c_ULTIMATE.start_main_~data_init~0#1|)))) is different from false [2022-07-21 02:24:01,618 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_387 Int) (v_ArrVal_383 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_396 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= (select (select (store (let ((.cse0 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_383))) (store .cse0 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse0 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_387))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_396) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4)) |c_ULTIMATE.start_main_~data_init~0#1|) (let ((.cse1 (and (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.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.offset|)))) (and (or .cse1 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (or .cse1 (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))))) is different from false [2022-07-21 02:24:01,760 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_387 Int) (v_ArrVal_383 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_396 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= (select (select (store (let ((.cse0 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_383))) (store .cse0 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse0 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_387))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_396) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4)) |c_ULTIMATE.start_main_~data_init~0#1|) (let ((.cse1 (and (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0)))) (and (or .cse1 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1))))) is different from false [2022-07-21 02:24:01,773 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:24:01,773 INFO L390 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 1 case distinctions, treesize of input 46 treesize of output 37 [2022-07-21 02:24:01,808 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:24:01,809 INFO L390 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 736 treesize of output 716 [2022-07-21 02:24:01,833 INFO L390 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 728 treesize of output 700 [2022-07-21 02:24:01,844 INFO L390 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 700 treesize of output 620 [2022-07-21 02:24:03,012 INFO L390 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 41 [2022-07-21 02:24:03,125 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 13 not checked. [2022-07-21 02:24:03,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [63843819] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 02:24:03,126 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 02:24:03,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 34 [2022-07-21 02:24:03,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071201007] [2022-07-21 02:24:03,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 02:24:03,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-21 02:24:03,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:24:03,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-21 02:24:03,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=836, Unknown=3, NotChecked=180, Total=1122 [2022-07-21 02:24:03,128 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 34 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 34 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) [2022-07-21 02:24:03,249 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (let ((.cse0 (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|))) (.cse3 (= (select .cse1 (+ |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 4)) |c_ULTIMATE.start_main_~data_init~0#1|)) (.cse2 (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|))) (and .cse0 (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse1 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4))) (not (= .cse2 0)) .cse3 (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_sll_circular_create_~data#1| |c_ULTIMATE.start_main_~data_init~0#1|) (forall ((v_ArrVal_387 Int) (v_ArrVal_383 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_396 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= (select (select (store (let ((.cse4 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_383))) (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| v_ArrVal_387))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_396) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4)) |c_ULTIMATE.start_main_~data_init~0#1|) (let ((.cse5 (and (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0)))) (and (or .cse5 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse5))))) (or (and .cse0 .cse3) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (= .cse2 1) (= (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) (= |c_ULTIMATE.start_main_~data_init~0#1| 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (let ((.cse6 (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 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse6) (= (select (select |c_#memory_int| .cse6) 4) |c_ULTIMATE.start_main_~data_init~0#1|))) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0)))) is different from false [2022-07-21 02:24:03,261 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (.cse1 (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|))) (and (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse0 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4))) (not (= .cse1 0)) (forall ((v_ArrVal_387 Int) (v_ArrVal_383 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_396 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= (select (select (store (let ((.cse2 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_383))) (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_387))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_396) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4)) |c_ULTIMATE.start_main_~data_init~0#1|) (let ((.cse3 (and (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.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.offset|)))) (and (or .cse3 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (or .cse3 (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))))) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_sll_circular_create_~data#1| |c_ULTIMATE.start_main_~data_init~0#1|) (or (and (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= (select .cse0 (+ |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 4)) |c_ULTIMATE.start_main_~data_init~0#1|)) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (= .cse1 1) (= |c_ULTIMATE.start_main_~data_init~0#1| 1) (= |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_~head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0))) is different from false [2022-07-21 02:24:03,402 WARN L833 $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 ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (.cse1 (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (.cse5 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse7)) (.cse6 (select |c_#memory_int| .cse7)) (.cse2 (+ |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 4))) (and (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse0 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4))) (not (= .cse1 0)) (= (select .cse0 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_sll_circular_create_~data#1| |c_ULTIMATE.start_main_~data_init~0#1|) (forall ((v_ArrVal_387 Int) (v_ArrVal_383 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_396 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= (select (select (store (let ((.cse3 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_383))) (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| v_ArrVal_387))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_396) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4)) |c_ULTIMATE.start_main_~data_init~0#1|) (let ((.cse4 (and (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0)))) (and (or .cse4 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse4))))) (= .cse1 1) (= (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) (= |c_ULTIMATE.start_main_~data_init~0#1| 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (or .cse5 (= (select .cse6 4) |c_ULTIMATE.start_main_~data_init~0#1|)) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (and (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (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|)) (= (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|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (forall ((v_ArrVal_387 Int) (v_ArrVal_396 (Array Int Int))) (= (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_387)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_396) (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|)) (+ (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|) 4)) |c_ULTIMATE.start_main_~data_init~0#1|)))) (or .cse5 (and (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse6 .cse2)) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse7))))))) is different from false [2022-07-21 02:24:03,881 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (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 ((.cse0 (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse2)) (.cse1 (select |c_#memory_int| .cse2))) (and (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= (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) (= |c_ULTIMATE.start_main_~data_init~0#1| 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (or .cse0 (= (select .cse1 4) |c_ULTIMATE.start_main_~data_init~0#1|)) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (and (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (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|)) (= (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|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (forall ((v_ArrVal_387 Int) (v_ArrVal_396 (Array Int Int))) (= (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_387)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_396) (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|)) (+ (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|) 4)) |c_ULTIMATE.start_main_~data_init~0#1|)))) (or .cse0 (and (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse1 (+ |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 4))) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse2))))))) is different from false [2022-07-21 02:24:03,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:24:03,932 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-07-21 02:24:03,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-21 02:24:03,933 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 34 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 25 [2022-07-21 02:24:03,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:24:03,933 INFO L225 Difference]: With dead ends: 37 [2022-07-21 02:24:03,933 INFO L226 Difference]: Without dead ends: 35 [2022-07-21 02:24:03,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=142, Invalid=1001, Unknown=7, NotChecked=490, Total=1640 [2022-07-21 02:24:03,935 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 5 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 87 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 02:24:03,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 204 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 143 Invalid, 0 Unknown, 87 Unchecked, 0.1s Time] [2022-07-21 02:24:03,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-07-21 02:24:03,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-07-21 02:24:03,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 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) [2022-07-21 02:24:03,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2022-07-21 02:24:03,940 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 25 [2022-07-21 02:24:03,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:24:03,940 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2022-07-21 02:24:03,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 34 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) [2022-07-21 02:24:03,940 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2022-07-21 02:24:03,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-21 02:24:03,941 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:24:03,941 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:24:03,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-21 02:24:04,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:24:04,155 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:24:04,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:24:04,156 INFO L85 PathProgramCache]: Analyzing trace with hash -2098705484, now seen corresponding path program 1 times [2022-07-21 02:24:04,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:24:04,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044016490] [2022-07-21 02:24:04,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:24:04,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:24:04,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:24:04,279 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 02:24:04,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:24:04,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044016490] [2022-07-21 02:24:04,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044016490] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:24:04,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056979629] [2022-07-21 02:24:04,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:24:04,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:24:04,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:24:04,281 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 02:24:04,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-21 02:24:04,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:24:04,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 50 conjunts are in the unsatisfiable core [2022-07-21 02:24:04,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:24:04,377 INFO L390 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 [2022-07-21 02:24:04,412 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-21 02:24:04,413 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-21 02:24:04,427 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-21 02:24:04,427 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-21 02:24:04,439 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 02:24:04,439 INFO L390 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 14 [2022-07-21 02:24:04,477 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-07-21 02:24:04,478 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 16 treesize of output 18 [2022-07-21 02:24:04,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:24:04,507 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-07-21 02:24:04,531 INFO L390 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 20 treesize of output 19 [2022-07-21 02:24:04,596 INFO L356 Elim1Store]: treesize reduction 17, result has 32.0 percent of original size [2022-07-21 02:24:04,596 INFO L390 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 31 treesize of output 21 [2022-07-21 02:24:04,598 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-21 02:24:04,599 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:24:04,806 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-21 02:24:04,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056979629] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 02:24:04,806 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 02:24:04,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 26 [2022-07-21 02:24:04,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556596216] [2022-07-21 02:24:04,806 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 02:24:04,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-21 02:24:04,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 02:24:04,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-21 02:24:04,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2022-07-21 02:24:04,807 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 26 states, 26 states have (on average 2.230769230769231) internal successors, (58), 26 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) [2022-07-21 02:24:04,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 02:24:04,940 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2022-07-21 02:24:04,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 02:24:04,940 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.230769230769231) internal successors, (58), 26 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) Word has length 26 [2022-07-21 02:24:04,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 02:24:04,941 INFO L225 Difference]: With dead ends: 43 [2022-07-21 02:24:04,941 INFO L226 Difference]: Without dead ends: 35 [2022-07-21 02:24:04,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=702, Unknown=0, NotChecked=0, Total=870 [2022-07-21 02:24:04,942 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 13 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 02:24:04,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 142 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 122 Invalid, 0 Unknown, 26 Unchecked, 0.1s Time] [2022-07-21 02:24:04,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-07-21 02:24:04,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-07-21 02:24:04,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 states have internal predecessors, (39), 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) [2022-07-21 02:24:04,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2022-07-21 02:24:04,947 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 26 [2022-07-21 02:24:04,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 02:24:04,948 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2022-07-21 02:24:04,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.230769230769231) internal successors, (58), 26 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) [2022-07-21 02:24:04,948 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-07-21 02:24:04,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-21 02:24:04,949 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 02:24:04,949 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 02:24:04,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-21 02:24:05,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:24:05,163 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 02:24:05,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 02:24:05,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1184035041, now seen corresponding path program 2 times [2022-07-21 02:24:05,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 02:24:05,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562728581] [2022-07-21 02:24:05,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 02:24:05,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 02:24:05,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 02:24:05,659 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 02:24:05,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 02:24:05,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562728581] [2022-07-21 02:24:05,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562728581] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 02:24:05,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041826129] [2022-07-21 02:24:05,660 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 02:24:05,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 02:24:05,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 02:24:05,662 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 02:24:05,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-21 02:24:05,776 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 02:24:05,776 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 02:24:05,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 100 conjunts are in the unsatisfiable core [2022-07-21 02:24:05,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 02:24:05,836 INFO L390 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 [2022-07-21 02:24:05,874 INFO L390 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 [2022-07-21 02:24:05,914 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 02:24:05,914 INFO L390 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 11 treesize of output 11 [2022-07-21 02:24:05,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:24:05,963 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-07-21 02:24:05,968 INFO L390 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 18 treesize of output 20 [2022-07-21 02:24:05,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:24:05,975 INFO L390 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-07-21 02:24:06,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:24:06,075 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-21 02:24:06,076 INFO L390 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 1 case distinctions, treesize of input 36 treesize of output 39 [2022-07-21 02:24:06,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:24:06,087 INFO L356 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2022-07-21 02:24:06,088 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 31 [2022-07-21 02:24:06,100 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 02:24:06,100 INFO L390 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 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-21 02:24:06,109 INFO L390 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 [2022-07-21 02:24:06,247 INFO L356 Elim1Store]: treesize reduction 24, result has 56.4 percent of original size [2022-07-21 02:24:06,247 INFO L390 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 50 treesize of output 59 [2022-07-21 02:24:06,253 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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 [2022-07-21 02:24:06,273 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-07-21 02:24:06,273 INFO L390 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 3 case distinctions, treesize of input 26 treesize of output 28 [2022-07-21 02:24:08,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:24:08,752 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-07-21 02:24:08,753 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 72 [2022-07-21 02:24:08,767 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 02:24:08,767 INFO L390 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 1 case distinctions, treesize of input 22 treesize of output 28 [2022-07-21 02:24:08,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 02:24:08,779 INFO L356 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-07-21 02:24:08,779 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2022-07-21 02:24:08,785 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-21 02:24:10,608 INFO L356 Elim1Store]: treesize reduction 94, result has 16.8 percent of original size [2022-07-21 02:24:10,608 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 121 treesize of output 80 [2022-07-21 02:24:10,626 INFO L356 Elim1Store]: treesize reduction 26, result has 10.3 percent of original size [2022-07-21 02:24:10,627 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 19 [2022-07-21 02:24:10,637 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-21 02:24:10,774 INFO L390 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 [2022-07-21 02:24:10,800 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 02:24:10,800 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 02:24:11,195 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_734 (Array Int Int)) (v_ArrVal_729 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_737 Int) (v_ArrVal_740 (Array Int Int)) (v_ArrVal_735 Int)) (let ((.cse7 (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|))) (.cse3 (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|)))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (.cse8 (select .cse7 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (let ((.cse5 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4)) (.cse2 (select .cse8 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse6 (select .cse4 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (let ((.cse1 (select (select (store .cse7 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse8 .cse5 v_ArrVal_737)) .cse2) .cse6)) (.cse0 (select (select (store .cse3 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse4 .cse5 v_ArrVal_735)) .cse2) .cse6))) (or (and (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| .cse0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse1)) (= (select (select (store (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_729)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_734) .cse2 v_ArrVal_740) .cse1) (+ .cse0 4)) |c_ULTIMATE.start_main_~data_init~0#1|))))))) is different from false [2022-07-21 02:24:11,576 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_720 Int) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_725 (Array Int Int)) (v_ArrVal_729 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_737 Int) (v_ArrVal_726 Int) (v_ArrVal_740 (Array Int Int)) (v_ArrVal_735 Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse6 (+ 4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (let ((.cse8 (let ((.cse11 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |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_~head~0#1.base|) .cse6 v_ArrVal_720)))) (store .cse11 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse11 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)))) (.cse4 (let ((.cse10 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |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_~head~0#1.offset|) .cse6 v_ArrVal_726)))) (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|))))) (let ((.cse5 (select .cse4 |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse9 (select .cse8 |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (let ((.cse3 (select .cse9 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse7 (select .cse5 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (let ((.cse0 (select (select (store .cse8 |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse9 .cse6 v_ArrVal_737)) .cse3) .cse7)) (.cse1 (select (select (store .cse4 |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse5 .cse6 v_ArrVal_735)) .cse3) .cse7))) (or (and (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse0) (= .cse1 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (= (select (select (store (store (let ((.cse2 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_725))) (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_729))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_734) .cse3 v_ArrVal_740) .cse0) (+ .cse1 4)) |c_ULTIMATE.start_main_~data_init~0#1|)))))))) is different from false [2022-07-21 02:24:11,808 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_720 Int) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_725 (Array Int Int)) (v_ArrVal_729 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_737 Int) (v_ArrVal_726 Int) (v_ArrVal_740 (Array Int Int)) (v_ArrVal_735 Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse4 (let ((.cse10 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 4 v_ArrVal_720)))) (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| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)))) (.cse7 (let ((.cse9 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4 v_ArrVal_726)))) (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| 0))))) (let ((.cse8 (select .cse7 |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse5 (select .cse4 |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (let ((.cse1 (select .cse5 0)) (.cse6 (select .cse8 0))) (let ((.cse3 (select (select (store .cse7 |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse8 4 v_ArrVal_735)) .cse1) .cse6)) (.cse2 (select (select (store .cse4 |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse5 4 v_ArrVal_737)) .cse1) .cse6))) (or (= (select (select (store (store (let ((.cse0 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_725))) (store .cse0 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse0 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_729))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_734) .cse1 v_ArrVal_740) .cse2) (+ .cse3 4)) |c_ULTIMATE.start_main_~data_init~0#1|) (and (= .cse3 0) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse2)))))))) is different from false [2022-07-21 02:24:12,351 INFO L356 Elim1Store]: treesize reduction 2546, result has 9.2 percent of original size [2022-07-21 02:24:12,353 INFO L390 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 2 new quantified variables, introduced 6 case distinctions, treesize of input 2748934 treesize of output 2737507 [2022-07-21 02:24:17,911 WARN L233 SmtUtils]: Spent 5.56s on a formula simplification. DAG size of input: 917 DAG size of output: 917 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-21 02:24:18,564 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 02:24:18,566 INFO L390 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 3266667 treesize of output 2941613 [2022-07-21 02:24:19,786 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:24:19,818 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 02:24:20,202 INFO L356 Elim1Store]: treesize reduction 335, result has 31.2 percent of original size [2022-07-21 02:24:20,206 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 179789089 treesize of output 179526852