/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/list-ext3-properties/sll_circular_traversal-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 00:57:11,521 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 00:57:11,522 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 00:57:11,582 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 00:57:11,582 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 00:57:11,584 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 00:57:11,589 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 00:57:11,591 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 00:57:11,593 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 00:57:11,596 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 00:57:11,596 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 00:57:11,597 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 00:57:11,597 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 00:57:11,598 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 00:57:11,598 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 00:57:11,599 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 00:57:11,599 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 00:57:11,599 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 00:57:11,600 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 00:57:11,601 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 00:57:11,602 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 00:57:11,603 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 00:57:11,603 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 00:57:11,604 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 00:57:11,606 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 00:57:11,606 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 00:57:11,607 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 00:57:11,607 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 00:57:11,607 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 00:57:11,608 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 00:57:11,608 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 00:57:11,608 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 00:57:11,609 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 00:57:11,609 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 00:57:11,610 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 00:57:11,610 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 00:57:11,610 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 00:57:11,610 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 00:57:11,610 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 00:57:11,611 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 00:57:11,611 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 00:57:11,619 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf [2022-01-10 00:57:11,634 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 00:57:11,634 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 00:57:11,634 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 00:57:11,634 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 00:57:11,635 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 00:57:11,639 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 00:57:11,640 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 00:57:11,640 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 00:57:11,640 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 00:57:11,640 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 00:57:11,641 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 00:57:11,641 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 00:57:11,641 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 00:57:11,641 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 00:57:11,641 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 00:57:11,641 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 00:57:11,641 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 00:57:11,641 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 00:57:11,641 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 00:57:11,641 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 00:57:11,641 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 00:57:11,641 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 00:57:11,642 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 00:57:11,642 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 00:57:11,643 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 00:57:11,643 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 00:57:11,643 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 00:57:11,643 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 00:57:11,644 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 00:57:11,644 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 00:57:11,644 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 00:57:11,823 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 00:57:11,843 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 00:57:11,844 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 00:57:11,845 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 00:57:11,871 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 00:57:11,872 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext3-properties/sll_circular_traversal-1.i [2022-01-10 00:57:11,926 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/429b1aea0/48e9229913c44264b9e7f7e0f5298a43/FLAG95312967c [2022-01-10 00:57:12,344 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 00:57:12,344 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext3-properties/sll_circular_traversal-1.i [2022-01-10 00:57:12,352 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/429b1aea0/48e9229913c44264b9e7f7e0f5298a43/FLAG95312967c [2022-01-10 00:57:12,369 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/429b1aea0/48e9229913c44264b9e7f7e0f5298a43 [2022-01-10 00:57:12,371 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 00:57:12,371 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 00:57:12,373 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 00:57:12,373 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 00:57:12,378 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 00:57:12,379 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:57:12" (1/1) ... [2022-01-10 00:57:12,379 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68f9bed5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:12, skipping insertion in model container [2022-01-10 00:57:12,379 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:57:12" (1/1) ... [2022-01-10 00:57:12,387 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 00:57:12,436 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 00:57:12,653 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-ext3-properties/sll_circular_traversal-1.i[24132,24145] [2022-01-10 00:57:12,655 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 00:57:12,660 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 00:57:12,707 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-ext3-properties/sll_circular_traversal-1.i[24132,24145] [2022-01-10 00:57:12,707 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 00:57:12,725 INFO L208 MainTranslator]: Completed translation [2022-01-10 00:57:12,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:12 WrapperNode [2022-01-10 00:57:12,727 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 00:57:12,728 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 00:57:12,728 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 00:57:12,728 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 00:57:12,733 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:12" (1/1) ... [2022-01-10 00:57:12,746 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:12" (1/1) ... [2022-01-10 00:57:12,771 INFO L137 Inliner]: procedures = 122, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 87 [2022-01-10 00:57:12,771 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 00:57:12,771 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 00:57:12,772 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 00:57:12,772 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 00:57:12,777 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:12" (1/1) ... [2022-01-10 00:57:12,777 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:12" (1/1) ... [2022-01-10 00:57:12,780 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:12" (1/1) ... [2022-01-10 00:57:12,781 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:12" (1/1) ... [2022-01-10 00:57:12,784 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:12" (1/1) ... [2022-01-10 00:57:12,787 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:12" (1/1) ... [2022-01-10 00:57:12,790 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:12" (1/1) ... [2022-01-10 00:57:12,791 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 00:57:12,792 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 00:57:12,792 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 00:57:12,792 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 00:57:12,797 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:12" (1/1) ... [2022-01-10 00:57:12,803 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 00:57:12,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:57:12,839 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-01-10 00:57:12,840 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-01-10 00:57:12,886 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-01-10 00:57:12,886 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-01-10 00:57:12,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-10 00:57:12,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-10 00:57:12,886 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-10 00:57:12,886 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 00:57:12,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-10 00:57:12,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-10 00:57:12,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-10 00:57:12,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-10 00:57:12,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 00:57:12,887 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 00:57:12,946 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 00:57:12,947 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 00:57:12,978 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-01-10 00:57:13,086 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 00:57:13,090 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 00:57:13,090 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-01-10 00:57:13,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:57:13 BoogieIcfgContainer [2022-01-10 00:57:13,092 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 00:57:13,093 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 00:57:13,093 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 00:57:13,095 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 00:57:13,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:57:12" (1/3) ... [2022-01-10 00:57:13,095 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@496f1aaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:57:13, skipping insertion in model container [2022-01-10 00:57:13,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:12" (2/3) ... [2022-01-10 00:57:13,096 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@496f1aaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:57:13, skipping insertion in model container [2022-01-10 00:57:13,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:57:13" (3/3) ... [2022-01-10 00:57:13,097 INFO L111 eAbstractionObserver]: Analyzing ICFG sll_circular_traversal-1.i [2022-01-10 00:57:13,100 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 00:57:13,100 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 00:57:13,130 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 00:57:13,139 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=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, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 00:57:13,140 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 00:57:13,151 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-01-10 00:57:13,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-01-10 00:57:13,156 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:57:13,156 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:57:13,157 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:57:13,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:57:13,161 INFO L85 PathProgramCache]: Analyzing trace with hash 70364755, now seen corresponding path program 1 times [2022-01-10 00:57:13,170 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:57:13,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530643374] [2022-01-10 00:57:13,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:57:13,171 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:57:13,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:57:13,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:57:13,285 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:57:13,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530643374] [2022-01-10 00:57:13,285 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530643374] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:57:13,286 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:57:13,286 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 00:57:13,287 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122908698] [2022-01-10 00:57:13,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:57:13,290 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 00:57:13,290 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:57:13,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 00:57:13,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 00:57:13,310 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-01-10 00:57:13,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:57:13,325 INFO L93 Difference]: Finished difference Result 45 states and 61 transitions. [2022-01-10 00:57:13,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 00:57:13,327 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-01-10 00:57:13,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:57:13,332 INFO L225 Difference]: With dead ends: 45 [2022-01-10 00:57:13,332 INFO L226 Difference]: Without dead ends: 20 [2022-01-10 00:57:13,334 INFO L932 BasicCegarLoop]: 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-01-10 00:57:13,339 INFO L933 BasicCegarLoop]: 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-01-10 00:57:13,340 INFO L934 BasicCegarLoop]: 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-01-10 00:57:13,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-01-10 00:57:13,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-01-10 00:57:13,359 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-01-10 00:57:13,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2022-01-10 00:57:13,360 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 10 [2022-01-10 00:57:13,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:57:13,361 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2022-01-10 00:57:13,361 INFO L471 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-01-10 00:57:13,361 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-01-10 00:57:13,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-01-10 00:57:13,361 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:57:13,362 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:57:13,362 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 00:57:13,362 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:57:13,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:57:13,366 INFO L85 PathProgramCache]: Analyzing trace with hash -273185057, now seen corresponding path program 1 times [2022-01-10 00:57:13,366 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:57:13,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717001222] [2022-01-10 00:57:13,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:57:13,366 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:57:13,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:57:13,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:57:13,463 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:57:13,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717001222] [2022-01-10 00:57:13,463 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717001222] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:57:13,463 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:57:13,463 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 00:57:13,463 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948287757] [2022-01-10 00:57:13,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:57:13,464 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 00:57:13,464 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:57:13,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 00:57:13,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:57:13,465 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-01-10 00:57:13,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:57:13,478 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2022-01-10 00:57:13,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 00:57:13,479 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-01-10 00:57:13,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:57:13,479 INFO L225 Difference]: With dead ends: 36 [2022-01-10 00:57:13,479 INFO L226 Difference]: Without dead ends: 23 [2022-01-10 00:57:13,480 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 00:57:13,481 INFO L933 BasicCegarLoop]: 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-01-10 00:57:13,481 INFO L934 BasicCegarLoop]: 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-01-10 00:57:13,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-01-10 00:57:13,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2022-01-10 00:57:13,484 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-01-10 00:57:13,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2022-01-10 00:57:13,485 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 10 [2022-01-10 00:57:13,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:57:13,485 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2022-01-10 00:57:13,485 INFO L471 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-01-10 00:57:13,485 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-01-10 00:57:13,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-01-10 00:57:13,485 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:57:13,486 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:57:13,486 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 00:57:13,486 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:57:13,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:57:13,486 INFO L85 PathProgramCache]: Analyzing trace with hash 2002783247, now seen corresponding path program 1 times [2022-01-10 00:57:13,487 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:57:13,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512440955] [2022-01-10 00:57:13,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:57:13,487 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:57:13,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:57:13,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:57:13,548 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:57:13,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512440955] [2022-01-10 00:57:13,548 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512440955] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:57:13,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391630855] [2022-01-10 00:57:13,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:57:13,548 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:57:13,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:57:13,550 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-01-10 00:57:13,567 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-01-10 00:57:13,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:57:13,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 00:57:13,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:57:13,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:57:13,726 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:57:13,797 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:57:13,797 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391630855] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 00:57:13,798 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 00:57:13,798 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-01-10 00:57:13,798 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947002929] [2022-01-10 00:57:13,798 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 00:57:13,798 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 00:57:13,798 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:57:13,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 00:57:13,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-01-10 00:57:13,799 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-01-10 00:57:13,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:57:13,820 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2022-01-10 00:57:13,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 00:57:13,821 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-01-10 00:57:13,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:57:13,821 INFO L225 Difference]: With dead ends: 43 [2022-01-10 00:57:13,821 INFO L226 Difference]: Without dead ends: 30 [2022-01-10 00:57:13,822 INFO L932 BasicCegarLoop]: 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-01-10 00:57:13,822 INFO L933 BasicCegarLoop]: 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-01-10 00:57:13,823 INFO L934 BasicCegarLoop]: 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-01-10 00:57:13,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-01-10 00:57:13,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-01-10 00:57:13,832 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-01-10 00:57:13,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-01-10 00:57:13,832 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 13 [2022-01-10 00:57:13,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:57:13,833 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-01-10 00:57:13,833 INFO L471 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-01-10 00:57:13,833 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-01-10 00:57:13,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-10 00:57:13,833 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:57:13,833 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:57:13,854 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-01-10 00:57:14,049 WARN L452 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-01-10 00:57:14,050 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:57:14,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:57:14,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1740729055, now seen corresponding path program 2 times [2022-01-10 00:57:14,051 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:57:14,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477195892] [2022-01-10 00:57:14,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:57:14,051 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:57:14,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:57:14,401 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-10 00:57:14,402 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:57:14,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477195892] [2022-01-10 00:57:14,402 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477195892] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:57:14,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441793753] [2022-01-10 00:57:14,402 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 00:57:14,402 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:57:14,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:57:14,407 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-01-10 00:57:14,441 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-01-10 00:57:14,522 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 00:57:14,522 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 00:57:14,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 35 conjunts are in the unsatisfiable core [2022-01-10 00:57:14,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:57:14,706 INFO L387 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-01-10 00:57:14,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:57:14,750 INFO L387 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-01-10 00:57:14,796 INFO L387 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-01-10 00:57:14,812 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-10 00:57:14,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:57:15,500 WARN L838 $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| 8)) |c_ULTIMATE.start_main_~data_init~0#1|)) is different from false [2022-01-10 00:57:15,646 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 4 not checked. [2022-01-10 00:57:15,647 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [441793753] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 00:57:15,647 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 00:57:15,647 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 22 [2022-01-10 00:57:15,647 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986779527] [2022-01-10 00:57:15,647 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 00:57:15,647 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-01-10 00:57:15,647 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:57:15,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-01-10 00:57:15,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=362, Unknown=1, NotChecked=38, Total=462 [2022-01-10 00:57:15,648 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-01-10 00:57:16,086 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (and (= (select .cse0 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~data_init~0#1|) (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|) (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) (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| 8)) |c_ULTIMATE.start_main_~data_init~0#1|)) (= |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) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse0 (+ |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 8))))) is different from false [2022-01-10 00:57:16,434 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (and (= (select .cse0 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (<= |c_ULTIMATE.start_sll_circular_create_~last~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| 8)) |c_ULTIMATE.start_main_~data_init~0#1|)) (<= 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) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse0 (+ |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 8))))) is different from false [2022-01-10 00:57:16,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:57:16,540 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-01-10 00:57:16,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 00:57:16,540 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-01-10 00:57:16,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:57:16,541 INFO L225 Difference]: With dead ends: 34 [2022-01-10 00:57:16,541 INFO L226 Difference]: Without dead ends: 32 [2022-01-10 00:57:16,542 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=132, Invalid=633, Unknown=3, NotChecked=162, Total=930 [2022-01-10 00:57:16,542 INFO L933 BasicCegarLoop]: 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-01-10 00:57:16,543 INFO L934 BasicCegarLoop]: 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-01-10 00:57:16,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-01-10 00:57:16,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-01-10 00:57:16,546 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-01-10 00:57:16,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-01-10 00:57:16,547 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 22 [2022-01-10 00:57:16,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:57:16,547 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-01-10 00:57:16,547 INFO L471 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-01-10 00:57:16,547 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-01-10 00:57:16,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-01-10 00:57:16,548 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:57:16,548 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:57:16,568 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-01-10 00:57:16,768 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-01-10 00:57:16,769 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:57:16,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:57:16,769 INFO L85 PathProgramCache]: Analyzing trace with hash 625081173, now seen corresponding path program 1 times [2022-01-10 00:57:16,769 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:57:16,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101571064] [2022-01-10 00:57:16,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:57:16,770 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:57:16,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:57:17,100 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 00:57:17,100 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:57:17,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101571064] [2022-01-10 00:57:17,100 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101571064] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:57:17,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202753708] [2022-01-10 00:57:17,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:57:17,101 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:57:17,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:57:17,102 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-01-10 00:57:17,103 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-01-10 00:57:17,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:57:17,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 69 conjunts are in the unsatisfiable core [2022-01-10 00:57:17,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:57:17,323 INFO L387 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-01-10 00:57:17,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:57:17,405 INFO L387 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-01-10 00:57:17,416 INFO L353 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-01-10 00:57:17,416 INFO L387 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-01-10 00:57:17,421 INFO L387 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-01-10 00:57:17,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:57:17,435 INFO L387 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-01-10 00:57:17,502 INFO L353 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-01-10 00:57:17,502 INFO L387 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-01-10 00:57:17,509 INFO L387 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-01-10 00:57:17,519 INFO L353 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-01-10 00:57:17,519 INFO L387 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-01-10 00:57:17,743 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 00:57:17,744 INFO L387 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 47 treesize of output 47 [2022-01-10 00:57:17,758 INFO L353 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-01-10 00:57:17,758 INFO L387 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 53 treesize of output 61 [2022-01-10 00:57:17,765 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 00:57:17,766 INFO L387 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 80 treesize of output 82 [2022-01-10 00:57:17,800 INFO L387 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-01-10 00:57:17,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:57:17,806 INFO L387 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-10 00:57:17,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 00:57:17,820 INFO L387 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2022-01-10 00:57:17,868 INFO L387 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-01-10 00:57:17,896 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-10 00:57:17,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:57:18,103 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_388 Int) (v_ArrVal_395 Int) (v_ArrVal_394 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_398 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 8))) (let ((.cse1 (select (store (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2 v_ArrVal_395) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse0 (select (store (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2 v_ArrVal_394) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (and (= .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse1)) (= (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_388)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_398) .cse1) (+ .cse0 8)) |c_ULTIMATE.start_main_~data_init~0#1|))))) is different from false [2022-01-10 00:57:18,171 INFO L353 Elim1Store]: treesize reduction 73, result has 34.8 percent of original size [2022-01-10 00:57:18,171 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 206 treesize of output 176 [2022-01-10 00:57:18,179 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 00:57:18,180 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 244 treesize of output 204 [2022-01-10 00:57:18,185 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 00:57:18,206 INFO L353 Elim1Store]: treesize reduction 54, result has 45.5 percent of original size [2022-01-10 00:57:18,206 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 162 treesize of output 122 [2022-01-10 00:57:18,236 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 00:57:18,237 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 122 treesize of output 114 [2022-01-10 00:57:18,257 INFO L387 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 6 treesize of output 4 [2022-01-10 00:57:18,305 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 00:57:18,310 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 00:57:18,310 INFO L387 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 78 treesize of output 78 [2022-01-10 00:57:18,496 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 57 treesize of output 47 [2022-01-10 00:57:18,550 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 45 treesize of output 37 [2022-01-10 00:57:18,613 INFO L387 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 61 treesize of output 51 [2022-01-10 00:57:18,791 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 00:57:18,792 INFO L387 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 463 treesize of output 425