./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f6eaec015dd6fdb220ef146938a83a65106037c982563310cbbb34d0417543f1 --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 19:52:01,810 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 19:52:01,812 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 19:52:01,871 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 19:52:01,872 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 19:52:01,874 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 19:52:01,875 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 19:52:01,877 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 19:52:01,878 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 19:52:01,882 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 19:52:01,882 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 19:52:01,883 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 19:52:01,883 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 19:52:01,885 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 19:52:01,886 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 19:52:01,889 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 19:52:01,890 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 19:52:01,891 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 19:52:01,892 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 19:52:01,894 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 19:52:01,895 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 19:52:01,895 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 19:52:01,896 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 19:52:01,897 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 19:52:01,902 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 19:52:01,903 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 19:52:01,903 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 19:52:01,904 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 19:52:01,904 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 19:52:01,905 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 19:52:01,905 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 19:52:01,906 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 19:52:01,907 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 19:52:01,907 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 19:52:01,908 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 19:52:01,908 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 19:52:01,909 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 19:52:01,909 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 19:52:01,909 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 19:52:01,909 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 19:52:01,910 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 19:52:01,911 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-14 19:52:01,931 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 19:52:01,931 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 19:52:01,931 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 19:52:01,932 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 19:52:01,932 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 19:52:01,932 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 19:52:01,933 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 19:52:01,933 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 19:52:01,933 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 19:52:01,933 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 19:52:01,934 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 19:52:01,934 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-14 19:52:01,934 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 19:52:01,934 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 19:52:01,934 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 19:52:01,935 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-14 19:52:01,935 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-14 19:52:01,935 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-14 19:52:01,935 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 19:52:01,935 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-14 19:52:01,935 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 19:52:01,935 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 19:52:01,936 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 19:52:01,936 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 19:52:01,936 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 19:52:01,936 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 19:52:01,936 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 19:52:01,936 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 19:52:01,936 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 19:52:01,937 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 19:52:01,937 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 19:52:01,938 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f6eaec015dd6fdb220ef146938a83a65106037c982563310cbbb34d0417543f1 [2021-12-14 19:52:02,109 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 19:52:02,128 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 19:52:02,129 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 19:52:02,130 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 19:52:02,131 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 19:52:02,132 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-1.i [2021-12-14 19:52:02,183 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/139c69078/3b8eafa74bef4a5ca2d475c580714702/FLAGf10dbf725 [2021-12-14 19:52:02,558 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 19:52:02,558 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-1.i [2021-12-14 19:52:02,573 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/139c69078/3b8eafa74bef4a5ca2d475c580714702/FLAGf10dbf725 [2021-12-14 19:52:02,936 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/139c69078/3b8eafa74bef4a5ca2d475c580714702 [2021-12-14 19:52:02,939 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 19:52:02,941 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 19:52:02,943 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 19:52:02,943 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 19:52:02,945 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 19:52:02,946 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:52:02" (1/1) ... [2021-12-14 19:52:02,947 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4568d4ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:52:02, skipping insertion in model container [2021-12-14 19:52:02,947 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:52:02" (1/1) ... [2021-12-14 19:52:02,953 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 19:52:02,987 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 19:52:03,208 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:52:03,213 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 19:52:03,255 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:52:03,273 INFO L208 MainTranslator]: Completed translation [2021-12-14 19:52:03,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:52:03 WrapperNode [2021-12-14 19:52:03,273 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 19:52:03,274 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 19:52:03,274 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 19:52:03,275 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 19:52:03,279 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:52:03" (1/1) ... [2021-12-14 19:52:03,302 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:52:03" (1/1) ... [2021-12-14 19:52:03,319 INFO L137 Inliner]: procedures = 116, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 128 [2021-12-14 19:52:03,323 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 19:52:03,323 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 19:52:03,323 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 19:52:03,324 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 19:52:03,329 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:52:03" (1/1) ... [2021-12-14 19:52:03,329 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:52:03" (1/1) ... [2021-12-14 19:52:03,331 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:52:03" (1/1) ... [2021-12-14 19:52:03,331 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:52:03" (1/1) ... [2021-12-14 19:52:03,336 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:52:03" (1/1) ... [2021-12-14 19:52:03,338 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:52:03" (1/1) ... [2021-12-14 19:52:03,339 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:52:03" (1/1) ... [2021-12-14 19:52:03,340 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 19:52:03,341 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 19:52:03,341 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 19:52:03,341 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 19:52:03,342 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:52:03" (1/1) ... [2021-12-14 19:52:03,346 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 19:52:03,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:52:03,362 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-14 19:52:03,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-14 19:52:03,385 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2021-12-14 19:52:03,385 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2021-12-14 19:52:03,385 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-14 19:52:03,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-14 19:52:03,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-14 19:52:03,386 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-14 19:52:03,386 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 19:52:03,386 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 19:52:03,455 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 19:52:03,456 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 19:52:03,486 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2021-12-14 19:52:03,680 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 19:52:03,685 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 19:52:03,686 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-14 19:52:03,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:52:03 BoogieIcfgContainer [2021-12-14 19:52:03,687 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 19:52:03,688 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 19:52:03,688 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 19:52:03,691 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 19:52:03,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 07:52:02" (1/3) ... [2021-12-14 19:52:03,691 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f047c59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:52:03, skipping insertion in model container [2021-12-14 19:52:03,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:52:03" (2/3) ... [2021-12-14 19:52:03,692 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f047c59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:52:03, skipping insertion in model container [2021-12-14 19:52:03,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:52:03" (3/3) ... [2021-12-14 19:52:03,693 INFO L111 eAbstractionObserver]: Analyzing ICFG dll_nondet_free_order-1.i [2021-12-14 19:52:03,696 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 19:52:03,696 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 62 error locations. [2021-12-14 19:52:03,720 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 19:52:03,725 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-14 19:52:03,725 INFO L340 AbstractCegarLoop]: Starting to check reachability of 62 error locations. [2021-12-14 19:52:03,735 INFO L276 IsEmpty]: Start isEmpty. Operand has 139 states, 74 states have (on average 1.9594594594594594) internal successors, (145), 137 states have internal predecessors, (145), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:03,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-12-14 19:52:03,739 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:52:03,740 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-12-14 19:52:03,740 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-14 19:52:03,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:52:03,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1079622, now seen corresponding path program 1 times [2021-12-14 19:52:03,749 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:52:03,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681910397] [2021-12-14 19:52:03,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:52:03,750 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:52:03,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:52:03,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:52:03,874 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:52:03,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681910397] [2021-12-14 19:52:03,875 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681910397] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:52:03,876 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:52:03,876 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:52:03,877 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577922624] [2021-12-14 19:52:03,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:52:03,880 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:52:03,880 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:52:03,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:52:03,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:52:03,903 INFO L87 Difference]: Start difference. First operand has 139 states, 74 states have (on average 1.9594594594594594) internal successors, (145), 137 states have internal predecessors, (145), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:04,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:52:04,021 INFO L93 Difference]: Finished difference Result 136 states and 143 transitions. [2021-12-14 19:52:04,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:52:04,023 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2021-12-14 19:52:04,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:52:04,030 INFO L225 Difference]: With dead ends: 136 [2021-12-14 19:52:04,031 INFO L226 Difference]: Without dead ends: 130 [2021-12-14 19:52:04,033 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:52:04,035 INFO L933 BasicCegarLoop]: 117 mSDtfsCounter, 50 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:52:04,036 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 175 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:52:04,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-12-14 19:52:04,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2021-12-14 19:52:04,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 71 states have (on average 1.9014084507042253) internal successors, (135), 129 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:04,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 135 transitions. [2021-12-14 19:52:04,061 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 135 transitions. Word has length 4 [2021-12-14 19:52:04,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:52:04,061 INFO L470 AbstractCegarLoop]: Abstraction has 130 states and 135 transitions. [2021-12-14 19:52:04,061 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:04,061 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 135 transitions. [2021-12-14 19:52:04,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-12-14 19:52:04,062 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:52:04,062 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-12-14 19:52:04,062 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 19:52:04,062 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-14 19:52:04,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:52:04,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1079623, now seen corresponding path program 1 times [2021-12-14 19:52:04,063 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:52:04,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440820190] [2021-12-14 19:52:04,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:52:04,063 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:52:04,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:52:04,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:52:04,090 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:52:04,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440820190] [2021-12-14 19:52:04,090 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440820190] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:52:04,090 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:52:04,091 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:52:04,091 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842701563] [2021-12-14 19:52:04,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:52:04,092 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:52:04,092 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:52:04,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:52:04,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:52:04,093 INFO L87 Difference]: Start difference. First operand 130 states and 135 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:04,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:52:04,114 INFO L93 Difference]: Finished difference Result 127 states and 132 transitions. [2021-12-14 19:52:04,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:52:04,115 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2021-12-14 19:52:04,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:52:04,116 INFO L225 Difference]: With dead ends: 127 [2021-12-14 19:52:04,116 INFO L226 Difference]: Without dead ends: 127 [2021-12-14 19:52:04,116 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:52:04,117 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 128 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:52:04,117 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 117 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:52:04,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2021-12-14 19:52:04,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2021-12-14 19:52:04,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 71 states have (on average 1.8591549295774648) internal successors, (132), 126 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:04,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 132 transitions. [2021-12-14 19:52:04,123 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 132 transitions. Word has length 4 [2021-12-14 19:52:04,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:52:04,124 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 132 transitions. [2021-12-14 19:52:04,124 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:04,124 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 132 transitions. [2021-12-14 19:52:04,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-14 19:52:04,124 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:52:04,124 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:52:04,125 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-14 19:52:04,125 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-14 19:52:04,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:52:04,125 INFO L85 PathProgramCache]: Analyzing trace with hash 2065247192, now seen corresponding path program 1 times [2021-12-14 19:52:04,126 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:52:04,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557292504] [2021-12-14 19:52:04,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:52:04,126 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:52:04,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:52:04,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:52:04,176 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:52:04,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557292504] [2021-12-14 19:52:04,176 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557292504] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:52:04,176 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:52:04,176 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 19:52:04,177 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585396351] [2021-12-14 19:52:04,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:52:04,177 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 19:52:04,177 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:52:04,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 19:52:04,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:52:04,178 INFO L87 Difference]: Start difference. First operand 127 states and 132 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:04,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:52:04,250 INFO L93 Difference]: Finished difference Result 137 states and 143 transitions. [2021-12-14 19:52:04,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 19:52:04,251 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-12-14 19:52:04,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:52:04,251 INFO L225 Difference]: With dead ends: 137 [2021-12-14 19:52:04,252 INFO L226 Difference]: Without dead ends: 137 [2021-12-14 19:52:04,252 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:52:04,253 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 130 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:52:04,253 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 220 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:52:04,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-12-14 19:52:04,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 133. [2021-12-14 19:52:04,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 77 states have (on average 1.8571428571428572) internal successors, (143), 132 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:04,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 143 transitions. [2021-12-14 19:52:04,259 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 143 transitions. Word has length 9 [2021-12-14 19:52:04,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:52:04,259 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 143 transitions. [2021-12-14 19:52:04,259 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:04,259 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 143 transitions. [2021-12-14 19:52:04,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-14 19:52:04,260 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:52:04,260 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:52:04,260 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-14 19:52:04,260 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-14 19:52:04,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:52:04,261 INFO L85 PathProgramCache]: Analyzing trace with hash 2065247193, now seen corresponding path program 1 times [2021-12-14 19:52:04,261 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:52:04,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139406874] [2021-12-14 19:52:04,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:52:04,262 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:52:04,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:52:04,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:52:04,289 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:52:04,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139406874] [2021-12-14 19:52:04,289 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139406874] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:52:04,289 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:52:04,289 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:52:04,289 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97930113] [2021-12-14 19:52:04,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:52:04,290 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:52:04,290 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:52:04,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:52:04,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:52:04,291 INFO L87 Difference]: Start difference. First operand 133 states and 143 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:04,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:52:04,297 INFO L93 Difference]: Finished difference Result 135 states and 140 transitions. [2021-12-14 19:52:04,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:52:04,298 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-12-14 19:52:04,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:52:04,299 INFO L225 Difference]: With dead ends: 135 [2021-12-14 19:52:04,299 INFO L226 Difference]: Without dead ends: 135 [2021-12-14 19:52:04,299 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:52:04,300 INFO L933 BasicCegarLoop]: 130 mSDtfsCounter, 7 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:52:04,300 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 254 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:52:04,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2021-12-14 19:52:04,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 131. [2021-12-14 19:52:04,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 75 states have (on average 1.8533333333333333) internal successors, (139), 130 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:04,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 139 transitions. [2021-12-14 19:52:04,304 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 139 transitions. Word has length 9 [2021-12-14 19:52:04,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:52:04,304 INFO L470 AbstractCegarLoop]: Abstraction has 131 states and 139 transitions. [2021-12-14 19:52:04,305 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:04,305 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 139 transitions. [2021-12-14 19:52:04,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-14 19:52:04,305 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:52:04,305 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:52:04,305 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-14 19:52:04,306 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-14 19:52:04,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:52:04,306 INFO L85 PathProgramCache]: Analyzing trace with hash 2065248729, now seen corresponding path program 1 times [2021-12-14 19:52:04,306 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:52:04,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681338971] [2021-12-14 19:52:04,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:52:04,307 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:52:04,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:52:04,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:52:04,330 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:52:04,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681338971] [2021-12-14 19:52:04,330 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681338971] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:52:04,330 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:52:04,330 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:52:04,331 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594325126] [2021-12-14 19:52:04,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:52:04,331 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:52:04,331 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:52:04,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:52:04,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:52:04,332 INFO L87 Difference]: Start difference. First operand 131 states and 139 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:04,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:52:04,378 INFO L93 Difference]: Finished difference Result 130 states and 137 transitions. [2021-12-14 19:52:04,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:52:04,379 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-12-14 19:52:04,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:52:04,379 INFO L225 Difference]: With dead ends: 130 [2021-12-14 19:52:04,379 INFO L226 Difference]: Without dead ends: 130 [2021-12-14 19:52:04,380 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:52:04,381 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 40 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:52:04,381 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 169 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:52:04,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-12-14 19:52:04,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2021-12-14 19:52:04,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 75 states have (on average 1.8266666666666667) internal successors, (137), 129 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:04,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 137 transitions. [2021-12-14 19:52:04,385 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 137 transitions. Word has length 9 [2021-12-14 19:52:04,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:52:04,385 INFO L470 AbstractCegarLoop]: Abstraction has 130 states and 137 transitions. [2021-12-14 19:52:04,385 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:04,386 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 137 transitions. [2021-12-14 19:52:04,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-14 19:52:04,386 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:52:04,386 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:52:04,386 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-14 19:52:04,386 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-14 19:52:04,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:52:04,387 INFO L85 PathProgramCache]: Analyzing trace with hash 2065248730, now seen corresponding path program 1 times [2021-12-14 19:52:04,387 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:52:04,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384288714] [2021-12-14 19:52:04,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:52:04,388 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:52:04,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:52:04,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:52:04,415 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:52:04,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384288714] [2021-12-14 19:52:04,416 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384288714] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:52:04,416 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:52:04,416 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:52:04,416 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725623012] [2021-12-14 19:52:04,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:52:04,417 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:52:04,417 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:52:04,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:52:04,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:52:04,417 INFO L87 Difference]: Start difference. First operand 130 states and 137 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:04,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:52:04,434 INFO L93 Difference]: Finished difference Result 129 states and 135 transitions. [2021-12-14 19:52:04,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:52:04,434 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-12-14 19:52:04,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:52:04,435 INFO L225 Difference]: With dead ends: 129 [2021-12-14 19:52:04,435 INFO L226 Difference]: Without dead ends: 129 [2021-12-14 19:52:04,435 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:52:04,436 INFO L933 BasicCegarLoop]: 118 mSDtfsCounter, 122 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:52:04,436 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 121 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:52:04,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2021-12-14 19:52:04,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2021-12-14 19:52:04,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 75 states have (on average 1.8) internal successors, (135), 128 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:04,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 135 transitions. [2021-12-14 19:52:04,440 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 135 transitions. Word has length 9 [2021-12-14 19:52:04,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:52:04,440 INFO L470 AbstractCegarLoop]: Abstraction has 129 states and 135 transitions. [2021-12-14 19:52:04,440 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:04,440 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 135 transitions. [2021-12-14 19:52:04,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-14 19:52:04,440 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:52:04,441 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:52:04,441 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-14 19:52:04,441 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-14 19:52:04,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:52:04,441 INFO L85 PathProgramCache]: Analyzing trace with hash -401798829, now seen corresponding path program 1 times [2021-12-14 19:52:04,442 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:52:04,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813863442] [2021-12-14 19:52:04,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:52:04,442 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:52:04,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:52:04,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:52:04,505 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:52:04,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813863442] [2021-12-14 19:52:04,505 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813863442] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:52:04,505 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:52:04,506 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:52:04,506 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12531048] [2021-12-14 19:52:04,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:52:04,506 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:52:04,506 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:52:04,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:52:04,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:52:04,507 INFO L87 Difference]: Start difference. First operand 129 states and 135 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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) [2021-12-14 19:52:04,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:52:04,540 INFO L93 Difference]: Finished difference Result 130 states and 135 transitions. [2021-12-14 19:52:04,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 19:52:04,541 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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 [2021-12-14 19:52:04,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:52:04,541 INFO L225 Difference]: With dead ends: 130 [2021-12-14 19:52:04,541 INFO L226 Difference]: Without dead ends: 130 [2021-12-14 19:52:04,542 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:52:04,542 INFO L933 BasicCegarLoop]: 115 mSDtfsCounter, 129 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:52:04,543 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 226 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:52:04,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-12-14 19:52:04,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2021-12-14 19:52:04,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 75 states have (on average 1.7866666666666666) internal successors, (134), 128 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:04,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 134 transitions. [2021-12-14 19:52:04,546 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 134 transitions. Word has length 10 [2021-12-14 19:52:04,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:52:04,546 INFO L470 AbstractCegarLoop]: Abstraction has 129 states and 134 transitions. [2021-12-14 19:52:04,546 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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) [2021-12-14 19:52:04,546 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 134 transitions. [2021-12-14 19:52:04,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-14 19:52:04,547 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:52:04,547 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:52:04,547 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-14 19:52:04,547 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-14 19:52:04,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:52:04,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1662359483, now seen corresponding path program 1 times [2021-12-14 19:52:04,548 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:52:04,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248037554] [2021-12-14 19:52:04,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:52:04,549 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:52:04,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:52:04,577 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:52:04,578 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:52:04,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248037554] [2021-12-14 19:52:04,578 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248037554] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:52:04,578 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:52:04,578 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:52:04,579 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624838550] [2021-12-14 19:52:04,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:52:04,579 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:52:04,579 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:52:04,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:52:04,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:52:04,580 INFO L87 Difference]: Start difference. First operand 129 states and 134 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:04,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:52:04,639 INFO L93 Difference]: Finished difference Result 127 states and 132 transitions. [2021-12-14 19:52:04,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 19:52:04,640 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 14 [2021-12-14 19:52:04,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:52:04,641 INFO L225 Difference]: With dead ends: 127 [2021-12-14 19:52:04,641 INFO L226 Difference]: Without dead ends: 127 [2021-12-14 19:52:04,641 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:52:04,642 INFO L933 BasicCegarLoop]: 109 mSDtfsCounter, 69 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:52:04,642 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 222 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:52:04,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2021-12-14 19:52:04,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2021-12-14 19:52:04,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 75 states have (on average 1.76) internal successors, (132), 126 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:04,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 132 transitions. [2021-12-14 19:52:04,645 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 132 transitions. Word has length 14 [2021-12-14 19:52:04,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:52:04,645 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 132 transitions. [2021-12-14 19:52:04,645 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:04,645 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 132 transitions. [2021-12-14 19:52:04,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-14 19:52:04,646 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:52:04,646 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:52:04,646 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-14 19:52:04,646 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-14 19:52:04,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:52:04,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1662359482, now seen corresponding path program 1 times [2021-12-14 19:52:04,647 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:52:04,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437903] [2021-12-14 19:52:04,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:52:04,647 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:52:04,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:52:04,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:52:04,682 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:52:04,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437903] [2021-12-14 19:52:04,683 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437903] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:52:04,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112941263] [2021-12-14 19:52:04,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:52:04,683 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:52:04,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:52:04,693 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:52:04,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-14 19:52:04,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:52:04,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-14 19:52:04,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:52:04,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:52:04,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:52:04,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:52:04,863 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112941263] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:52:04,863 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:52:04,863 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2021-12-14 19:52:04,864 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036814266] [2021-12-14 19:52:04,864 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:52:04,864 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:52:04,864 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:52:04,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:52:04,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:52:04,865 INFO L87 Difference]: Start difference. First operand 127 states and 132 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:04,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:52:04,872 INFO L93 Difference]: Finished difference Result 129 states and 134 transitions. [2021-12-14 19:52:04,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 19:52:04,873 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 14 [2021-12-14 19:52:04,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:52:04,873 INFO L225 Difference]: With dead ends: 129 [2021-12-14 19:52:04,874 INFO L226 Difference]: Without dead ends: 129 [2021-12-14 19:52:04,874 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:52:04,874 INFO L933 BasicCegarLoop]: 126 mSDtfsCounter, 13 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:52:04,875 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 362 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:52:04,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2021-12-14 19:52:04,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2021-12-14 19:52:04,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 77 states have (on average 1.7402597402597402) internal successors, (134), 128 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:04,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 134 transitions. [2021-12-14 19:52:04,877 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 134 transitions. Word has length 14 [2021-12-14 19:52:04,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:52:04,877 INFO L470 AbstractCegarLoop]: Abstraction has 129 states and 134 transitions. [2021-12-14 19:52:04,877 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:04,877 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 134 transitions. [2021-12-14 19:52:04,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-14 19:52:04,878 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:52:04,878 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:52:04,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-14 19:52:05,097 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:52:05,097 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-14 19:52:05,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:52:05,098 INFO L85 PathProgramCache]: Analyzing trace with hash 6511238, now seen corresponding path program 1 times [2021-12-14 19:52:05,098 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:52:05,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062588380] [2021-12-14 19:52:05,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:52:05,098 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:52:05,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:52:05,156 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:52:05,157 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:52:05,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062588380] [2021-12-14 19:52:05,157 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062588380] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:52:05,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1566755974] [2021-12-14 19:52:05,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:52:05,157 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:52:05,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:52:05,176 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:52:05,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-14 19:52:05,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:52:05,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-14 19:52:05,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:52:05,292 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:52:05,296 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:52:05,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:52:05,336 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2021-12-14 19:52:05,342 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:52:05,342 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-14 19:52:05,352 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:52:05,352 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:52:05,502 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:52:05,503 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1566755974] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:52:05,503 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:52:05,503 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2021-12-14 19:52:05,503 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563011023] [2021-12-14 19:52:05,503 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:52:05,504 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-14 19:52:05,504 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:52:05,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-14 19:52:05,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-14 19:52:05,504 INFO L87 Difference]: Start difference. First operand 129 states and 134 transitions. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:05,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:52:05,606 INFO L93 Difference]: Finished difference Result 127 states and 132 transitions. [2021-12-14 19:52:05,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:52:05,607 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-14 19:52:05,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:52:05,607 INFO L225 Difference]: With dead ends: 127 [2021-12-14 19:52:05,607 INFO L226 Difference]: Without dead ends: 127 [2021-12-14 19:52:05,607 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-12-14 19:52:05,608 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 405 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:52:05,608 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [405 Valid, 280 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 92 Invalid, 0 Unknown, 70 Unchecked, 0.1s Time] [2021-12-14 19:52:05,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2021-12-14 19:52:05,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2021-12-14 19:52:05,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 77 states have (on average 1.7142857142857142) internal successors, (132), 126 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:05,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 132 transitions. [2021-12-14 19:52:05,610 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 132 transitions. Word has length 15 [2021-12-14 19:52:05,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:52:05,610 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 132 transitions. [2021-12-14 19:52:05,610 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:05,610 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 132 transitions. [2021-12-14 19:52:05,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-14 19:52:05,610 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:52:05,611 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:52:05,629 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-14 19:52:05,819 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-12-14 19:52:05,819 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-14 19:52:05,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:52:05,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1580520033, now seen corresponding path program 1 times [2021-12-14 19:52:05,820 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:52:05,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393601195] [2021-12-14 19:52:05,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:52:05,820 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:52:05,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:52:05,867 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-14 19:52:05,867 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:52:05,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393601195] [2021-12-14 19:52:05,867 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393601195] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:52:05,867 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:52:05,868 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 19:52:05,868 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55660005] [2021-12-14 19:52:05,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:52:05,868 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:52:05,868 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:52:05,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:52:05,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:52:05,869 INFO L87 Difference]: Start difference. First operand 127 states and 132 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:05,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:52:05,976 INFO L93 Difference]: Finished difference Result 124 states and 129 transitions. [2021-12-14 19:52:05,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:52:05,977 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 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 [2021-12-14 19:52:05,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:52:05,977 INFO L225 Difference]: With dead ends: 124 [2021-12-14 19:52:05,978 INFO L226 Difference]: Without dead ends: 124 [2021-12-14 19:52:05,978 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-14 19:52:05,978 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 107 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:52:05,979 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 325 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:52:05,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2021-12-14 19:52:05,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2021-12-14 19:52:05,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 77 states have (on average 1.6753246753246753) internal successors, (129), 123 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:05,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 129 transitions. [2021-12-14 19:52:05,981 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 129 transitions. Word has length 22 [2021-12-14 19:52:05,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:52:05,981 INFO L470 AbstractCegarLoop]: Abstraction has 124 states and 129 transitions. [2021-12-14 19:52:05,981 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:05,981 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 129 transitions. [2021-12-14 19:52:05,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-14 19:52:05,982 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:52:05,982 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:52:05,982 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-14 19:52:05,982 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-14 19:52:05,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:52:05,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1580520034, now seen corresponding path program 1 times [2021-12-14 19:52:05,983 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:52:05,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265118593] [2021-12-14 19:52:05,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:52:05,983 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:52:05,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:52:06,034 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:52:06,034 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:52:06,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265118593] [2021-12-14 19:52:06,034 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265118593] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:52:06,034 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:52:06,034 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 19:52:06,035 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137972467] [2021-12-14 19:52:06,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:52:06,035 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:52:06,035 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:52:06,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:52:06,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:52:06,036 INFO L87 Difference]: Start difference. First operand 124 states and 129 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:06,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:52:06,136 INFO L93 Difference]: Finished difference Result 117 states and 122 transitions. [2021-12-14 19:52:06,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:52:06,136 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 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 [2021-12-14 19:52:06,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:52:06,138 INFO L225 Difference]: With dead ends: 117 [2021-12-14 19:52:06,138 INFO L226 Difference]: Without dead ends: 117 [2021-12-14 19:52:06,138 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-14 19:52:06,139 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 412 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:52:06,140 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [412 Valid, 95 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:52:06,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-12-14 19:52:06,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2021-12-14 19:52:06,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 77 states have (on average 1.5844155844155845) internal successors, (122), 116 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:06,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 122 transitions. [2021-12-14 19:52:06,142 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 122 transitions. Word has length 22 [2021-12-14 19:52:06,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:52:06,142 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 122 transitions. [2021-12-14 19:52:06,142 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:06,143 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 122 transitions. [2021-12-14 19:52:06,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-14 19:52:06,144 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:52:06,144 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:52:06,144 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-14 19:52:06,144 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-14 19:52:06,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:52:06,145 INFO L85 PathProgramCache]: Analyzing trace with hash 67241285, now seen corresponding path program 1 times [2021-12-14 19:52:06,145 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:52:06,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545685233] [2021-12-14 19:52:06,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:52:06,145 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:52:06,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:52:06,216 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:52:06,216 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:52:06,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545685233] [2021-12-14 19:52:06,217 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545685233] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:52:06,217 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:52:06,217 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 19:52:06,217 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95242646] [2021-12-14 19:52:06,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:52:06,218 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:52:06,218 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:52:06,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:52:06,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:52:06,219 INFO L87 Difference]: Start difference. First operand 117 states and 122 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:06,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:52:06,298 INFO L93 Difference]: Finished difference Result 112 states and 117 transitions. [2021-12-14 19:52:06,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:52:06,299 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-12-14 19:52:06,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:52:06,299 INFO L225 Difference]: With dead ends: 112 [2021-12-14 19:52:06,300 INFO L226 Difference]: Without dead ends: 112 [2021-12-14 19:52:06,300 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-14 19:52:06,300 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 386 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:52:06,301 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [386 Valid, 84 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:52:06,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2021-12-14 19:52:06,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2021-12-14 19:52:06,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 77 states have (on average 1.5194805194805194) internal successors, (117), 111 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:06,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 117 transitions. [2021-12-14 19:52:06,303 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 117 transitions. Word has length 28 [2021-12-14 19:52:06,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:52:06,304 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 117 transitions. [2021-12-14 19:52:06,304 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:06,304 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 117 transitions. [2021-12-14 19:52:06,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-14 19:52:06,304 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:52:06,305 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:52:06,305 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-14 19:52:06,305 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-14 19:52:06,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:52:06,305 INFO L85 PathProgramCache]: Analyzing trace with hash 67280267, now seen corresponding path program 1 times [2021-12-14 19:52:06,306 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:52:06,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555483171] [2021-12-14 19:52:06,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:52:06,306 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:52:06,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:52:06,471 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:52:06,472 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:52:06,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555483171] [2021-12-14 19:52:06,472 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555483171] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:52:06,472 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:52:06,472 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-14 19:52:06,474 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430747228] [2021-12-14 19:52:06,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:52:06,474 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-14 19:52:06,475 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:52:06,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 19:52:06,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-12-14 19:52:06,475 INFO L87 Difference]: Start difference. First operand 112 states and 117 transitions. Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:06,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:52:06,627 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2021-12-14 19:52:06,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 19:52:06,628 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-12-14 19:52:06,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:52:06,628 INFO L225 Difference]: With dead ends: 107 [2021-12-14 19:52:06,628 INFO L226 Difference]: Without dead ends: 107 [2021-12-14 19:52:06,628 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2021-12-14 19:52:06,629 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 632 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 632 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:52:06,629 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [632 Valid, 156 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:52:06,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-12-14 19:52:06,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2021-12-14 19:52:06,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 106 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:06,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 112 transitions. [2021-12-14 19:52:06,632 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 112 transitions. Word has length 28 [2021-12-14 19:52:06,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:52:06,634 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 112 transitions. [2021-12-14 19:52:06,634 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:06,634 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2021-12-14 19:52:06,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-14 19:52:06,637 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:52:06,637 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:52:06,637 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-14 19:52:06,637 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-14 19:52:06,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:52:06,640 INFO L85 PathProgramCache]: Analyzing trace with hash 67279051, now seen corresponding path program 1 times [2021-12-14 19:52:06,640 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:52:06,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929361713] [2021-12-14 19:52:06,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:52:06,640 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:52:06,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:52:06,863 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:52:06,863 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:52:06,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929361713] [2021-12-14 19:52:06,863 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929361713] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:52:06,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771499158] [2021-12-14 19:52:06,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:52:06,864 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:52:06,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:52:06,865 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:52:06,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-14 19:52:06,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:52:06,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 55 conjunts are in the unsatisfiable core [2021-12-14 19:52:06,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:52:06,982 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:52:07,028 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:52:07,028 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-12-14 19:52:07,111 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-12-14 19:52:07,111 INFO L388 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 [2021-12-14 19:52:07,153 INFO L388 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 11 treesize of output 7 [2021-12-14 19:52:07,186 INFO L388 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 14 treesize of output 16 [2021-12-14 19:52:07,245 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-14 19:52:07,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:52:07,271 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-14 19:52:07,352 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:52:07,352 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2021-12-14 19:52:07,358 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:52:07,358 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:52:07,385 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_434 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_434) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 0)) is different from false [2021-12-14 19:52:07,409 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_434 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_434) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) 0)) is different from false [2021-12-14 19:52:07,416 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_432 (Array Int Int)) (v_ArrVal_434 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_432) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_434) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) 0)) is different from false [2021-12-14 19:52:07,423 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:52:07,423 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2021-12-14 19:52:07,431 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2021-12-14 19:52:07,434 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2021-12-14 19:52:07,437 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2021-12-14 19:52:07,711 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2021-12-14 19:52:07,712 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1771499158] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:52:07,712 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:52:07,712 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 13] total 33 [2021-12-14 19:52:07,712 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396563925] [2021-12-14 19:52:07,712 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:52:07,713 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-12-14 19:52:07,713 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:52:07,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-12-14 19:52:07,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=840, Unknown=3, NotChecked=180, Total=1122 [2021-12-14 19:52:07,714 INFO L87 Difference]: Start difference. First operand 107 states and 112 transitions. Second operand has 34 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 34 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:08,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:52:08,238 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2021-12-14 19:52:08,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-14 19:52:08,239 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 34 states have internal predecessors, (68), 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 28 [2021-12-14 19:52:08,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:52:08,239 INFO L225 Difference]: With dead ends: 102 [2021-12-14 19:52:08,239 INFO L226 Difference]: Without dead ends: 102 [2021-12-14 19:52:08,240 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=252, Invalid=1563, Unknown=3, NotChecked=252, Total=2070 [2021-12-14 19:52:08,240 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 444 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 357 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:52:08,241 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [444 Valid, 693 Invalid, 890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 515 Invalid, 0 Unknown, 357 Unchecked, 0.2s Time] [2021-12-14 19:52:08,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-12-14 19:52:08,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2021-12-14 19:52:08,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 77 states have (on average 1.3896103896103895) internal successors, (107), 101 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:08,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 107 transitions. [2021-12-14 19:52:08,242 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 107 transitions. Word has length 28 [2021-12-14 19:52:08,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:52:08,242 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 107 transitions. [2021-12-14 19:52:08,242 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 34 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:08,243 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 107 transitions. [2021-12-14 19:52:08,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-14 19:52:08,243 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:52:08,243 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:52:08,264 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-14 19:52:08,443 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:52:08,444 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-14 19:52:08,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:52:08,444 INFO L85 PathProgramCache]: Analyzing trace with hash 2085688457, now seen corresponding path program 1 times [2021-12-14 19:52:08,444 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:52:08,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456893651] [2021-12-14 19:52:08,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:52:08,444 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:52:08,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:52:08,551 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:52:08,551 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:52:08,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456893651] [2021-12-14 19:52:08,552 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456893651] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:52:08,552 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:52:08,552 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-14 19:52:08,552 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766233914] [2021-12-14 19:52:08,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:52:08,552 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-14 19:52:08,552 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:52:08,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 19:52:08,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-12-14 19:52:08,553 INFO L87 Difference]: Start difference. First operand 102 states and 107 transitions. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:08,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:52:08,856 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2021-12-14 19:52:08,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 19:52:08,857 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 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 29 [2021-12-14 19:52:08,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:52:08,857 INFO L225 Difference]: With dead ends: 97 [2021-12-14 19:52:08,857 INFO L226 Difference]: Without dead ends: 97 [2021-12-14 19:52:08,858 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2021-12-14 19:52:08,858 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 645 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 645 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:52:08,858 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [645 Valid, 74 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:52:08,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-12-14 19:52:08,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2021-12-14 19:52:08,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 77 states have (on average 1.3246753246753247) internal successors, (102), 96 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:08,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 102 transitions. [2021-12-14 19:52:08,860 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 102 transitions. Word has length 29 [2021-12-14 19:52:08,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:52:08,860 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 102 transitions. [2021-12-14 19:52:08,860 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:08,860 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 102 transitions. [2021-12-14 19:52:08,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-14 19:52:08,860 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:52:08,861 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:52:08,861 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-14 19:52:08,861 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-14 19:52:08,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:52:08,861 INFO L85 PathProgramCache]: Analyzing trace with hash 2085650723, now seen corresponding path program 1 times [2021-12-14 19:52:08,861 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:52:08,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499764888] [2021-12-14 19:52:08,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:52:08,861 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:52:08,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:52:09,064 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:52:09,065 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:52:09,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499764888] [2021-12-14 19:52:09,065 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499764888] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:52:09,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120229286] [2021-12-14 19:52:09,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:52:09,065 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:52:09,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:52:09,066 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:52:09,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-14 19:52:09,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:52:09,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 46 conjunts are in the unsatisfiable core [2021-12-14 19:52:09,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:52:09,182 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:52:09,231 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-12-14 19:52:09,233 INFO L388 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 [2021-12-14 19:52:09,251 INFO L388 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 11 treesize of output 7 [2021-12-14 19:52:09,283 INFO L388 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 14 treesize of output 16 [2021-12-14 19:52:09,366 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2021-12-14 19:52:09,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:52:09,400 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 38 [2021-12-14 19:52:09,509 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2021-12-14 19:52:09,526 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:52:09,526 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:52:09,582 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_556 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_556) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 1) |c_#StackHeapBarrier|)) is different from false [2021-12-14 19:52:09,591 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_556 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_556) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) 1) |c_#StackHeapBarrier|)) is different from false [2021-12-14 19:52:09,596 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_556 (Array Int Int)) (v_ArrVal_555 (Array Int Int))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_555) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_556) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) 1) |c_#StackHeapBarrier|)) is different from false [2021-12-14 19:52:09,606 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:52:09,607 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2021-12-14 19:52:09,612 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 125 [2021-12-14 19:52:09,617 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 57 [2021-12-14 19:52:09,620 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 110 [2021-12-14 19:52:09,886 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-14 19:52:09,887 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2021-12-14 19:52:09,920 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2021-12-14 19:52:09,920 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2120229286] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:52:09,921 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:52:09,921 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2021-12-14 19:52:09,921 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8288406] [2021-12-14 19:52:09,921 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:52:09,921 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-12-14 19:52:09,921 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:52:09,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-12-14 19:52:09,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=581, Unknown=3, NotChecked=150, Total=812 [2021-12-14 19:52:09,922 INFO L87 Difference]: Start difference. First operand 97 states and 102 transitions. Second operand has 29 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 29 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:10,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:52:10,853 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2021-12-14 19:52:10,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-14 19:52:10,854 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 29 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-14 19:52:10,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:52:10,854 INFO L225 Difference]: With dead ends: 96 [2021-12-14 19:52:10,854 INFO L226 Difference]: Without dead ends: 96 [2021-12-14 19:52:10,855 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 42 SyntacticMatches, 6 SemanticMatches, 39 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=264, Invalid=1151, Unknown=3, NotChecked=222, Total=1640 [2021-12-14 19:52:10,855 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 695 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 695 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 1075 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 447 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 19:52:10,855 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [695 Valid, 264 Invalid, 1075 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 553 Invalid, 0 Unknown, 447 Unchecked, 0.3s Time] [2021-12-14 19:52:10,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-12-14 19:52:10,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 92. [2021-12-14 19:52:10,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 77 states have (on average 1.2597402597402598) internal successors, (97), 91 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:10,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 97 transitions. [2021-12-14 19:52:10,857 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 97 transitions. Word has length 29 [2021-12-14 19:52:10,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:52:10,857 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 97 transitions. [2021-12-14 19:52:10,857 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 29 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:10,857 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 97 transitions. [2021-12-14 19:52:10,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-14 19:52:10,858 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:52:10,858 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:52:10,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-14 19:52:11,058 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-12-14 19:52:11,058 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-14 19:52:11,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:52:11,059 INFO L85 PathProgramCache]: Analyzing trace with hash 231832909, now seen corresponding path program 1 times [2021-12-14 19:52:11,059 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:52:11,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582828740] [2021-12-14 19:52:11,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:52:11,059 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:52:11,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:52:11,168 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:52:11,169 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:52:11,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582828740] [2021-12-14 19:52:11,169 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582828740] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:52:11,169 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:52:11,169 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-14 19:52:11,169 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687391621] [2021-12-14 19:52:11,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:52:11,170 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-14 19:52:11,170 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:52:11,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-14 19:52:11,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-12-14 19:52:11,171 INFO L87 Difference]: Start difference. First operand 92 states and 97 transitions. Second operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:11,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:52:11,447 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2021-12-14 19:52:11,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 19:52:11,448 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 12 states have internal predecessors, (30), 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 30 [2021-12-14 19:52:11,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:52:11,448 INFO L225 Difference]: With dead ends: 91 [2021-12-14 19:52:11,449 INFO L226 Difference]: Without dead ends: 91 [2021-12-14 19:52:11,449 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2021-12-14 19:52:11,449 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 229 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:52:11,450 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [229 Valid, 279 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:52:11,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2021-12-14 19:52:11,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2021-12-14 19:52:11,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 77 states have (on average 1.2467532467532467) internal successors, (96), 90 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:11,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 96 transitions. [2021-12-14 19:52:11,452 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 96 transitions. Word has length 30 [2021-12-14 19:52:11,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:52:11,452 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 96 transitions. [2021-12-14 19:52:11,452 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:11,452 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 96 transitions. [2021-12-14 19:52:11,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-14 19:52:11,452 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:52:11,453 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:52:11,453 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-14 19:52:11,453 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-14 19:52:11,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:52:11,453 INFO L85 PathProgramCache]: Analyzing trace with hash 230663117, now seen corresponding path program 1 times [2021-12-14 19:52:11,454 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:52:11,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487908465] [2021-12-14 19:52:11,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:52:11,454 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:52:11,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:52:11,581 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:52:11,581 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:52:11,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487908465] [2021-12-14 19:52:11,581 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487908465] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:52:11,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231847615] [2021-12-14 19:52:11,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:52:11,582 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:52:11,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:52:11,583 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:52:11,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-14 19:52:11,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:52:11,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 55 conjunts are in the unsatisfiable core [2021-12-14 19:52:11,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:52:11,670 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:52:11,695 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:52:11,695 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-12-14 19:52:11,754 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-12-14 19:52:11,754 INFO L388 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 [2021-12-14 19:52:11,766 INFO L388 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 11 treesize of output 7 [2021-12-14 19:52:11,780 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:52:11,781 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2021-12-14 19:52:11,835 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2021-12-14 19:52:11,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:52:11,863 INFO L388 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 31 treesize of output 26 [2021-12-14 19:52:11,975 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:52:11,975 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 22 [2021-12-14 19:52:11,994 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:52:11,994 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:52:12,084 INFO L354 Elim1Store]: treesize reduction 18, result has 60.0 percent of original size [2021-12-14 19:52:12,084 INFO L388 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 28 treesize of output 38 [2021-12-14 19:52:12,089 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_679 (Array Int Int)) (v_ArrVal_680 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_679) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_680) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (or (= .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) is different from false [2021-12-14 19:52:12,096 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:52:12,096 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 35 [2021-12-14 19:52:12,098 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 235 treesize of output 215 [2021-12-14 19:52:12,103 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 195 treesize of output 187 [2021-12-14 19:52:12,112 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 171 [2021-12-14 19:52:12,215 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-12-14 19:52:12,215 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231847615] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:52:12,215 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:52:12,215 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 13] total 28 [2021-12-14 19:52:12,216 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364079691] [2021-12-14 19:52:12,216 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:52:12,216 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-12-14 19:52:12,216 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:52:12,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-12-14 19:52:12,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=673, Unknown=2, NotChecked=52, Total=812 [2021-12-14 19:52:12,217 INFO L87 Difference]: Start difference. First operand 91 states and 96 transitions. Second operand has 29 states, 28 states have (on average 2.3214285714285716) internal successors, (65), 29 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:12,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:52:12,779 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2021-12-14 19:52:12,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-14 19:52:12,779 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.3214285714285716) internal successors, (65), 29 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-12-14 19:52:12,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:52:12,780 INFO L225 Difference]: With dead ends: 90 [2021-12-14 19:52:12,780 INFO L226 Difference]: Without dead ends: 90 [2021-12-14 19:52:12,780 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 46 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=238, Invalid=1246, Unknown=2, NotChecked=74, Total=1560 [2021-12-14 19:52:12,781 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 130 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 149 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 19:52:12,781 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 770 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 625 Invalid, 0 Unknown, 149 Unchecked, 0.3s Time] [2021-12-14 19:52:12,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2021-12-14 19:52:12,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2021-12-14 19:52:12,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 77 states have (on average 1.2337662337662338) internal successors, (95), 89 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:12,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2021-12-14 19:52:12,783 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 30 [2021-12-14 19:52:12,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:52:12,783 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2021-12-14 19:52:12,783 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.3214285714285716) internal successors, (65), 29 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:12,783 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2021-12-14 19:52:12,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-14 19:52:12,784 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:52:12,784 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:52:12,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-14 19:52:13,000 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:52:13,000 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-14 19:52:13,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:52:13,000 INFO L85 PathProgramCache]: Analyzing trace with hash 823875782, now seen corresponding path program 1 times [2021-12-14 19:52:13,001 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:52:13,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074200460] [2021-12-14 19:52:13,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:52:13,001 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:52:13,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:52:13,185 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:52:13,186 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:52:13,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074200460] [2021-12-14 19:52:13,186 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074200460] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:52:13,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737517718] [2021-12-14 19:52:13,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:52:13,186 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:52:13,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:52:13,187 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:52:13,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-14 19:52:13,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:52:13,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 38 conjunts are in the unsatisfiable core [2021-12-14 19:52:13,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:52:13,341 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:52:13,341 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-14 19:52:13,413 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:52:13,462 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:52:13,463 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 23 [2021-12-14 19:52:13,632 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2021-12-14 19:52:13,638 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:52:13,638 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:52:13,802 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2021-12-14 19:52:13,803 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2021-12-14 19:52:13,809 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2021-12-14 19:52:13,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:52:13,824 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-12-14 19:52:13,861 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-14 19:52:13,862 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2021-12-14 19:52:13,871 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:52:13,871 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [737517718] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:52:13,871 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:52:13,871 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 29 [2021-12-14 19:52:13,871 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346329554] [2021-12-14 19:52:13,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:52:13,872 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-12-14 19:52:13,872 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:52:13,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-12-14 19:52:13,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=773, Unknown=0, NotChecked=0, Total=870 [2021-12-14 19:52:13,873 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand has 30 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 30 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:14,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:52:14,243 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2021-12-14 19:52:14,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-14 19:52:14,244 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 30 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-12-14 19:52:14,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:52:14,244 INFO L225 Difference]: With dead ends: 89 [2021-12-14 19:52:14,244 INFO L226 Difference]: Without dead ends: 89 [2021-12-14 19:52:14,245 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=282, Invalid=1358, Unknown=0, NotChecked=0, Total=1640 [2021-12-14 19:52:14,245 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 488 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 64 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:52:14,245 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [488 Valid, 480 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 501 Invalid, 0 Unknown, 64 Unchecked, 0.2s Time] [2021-12-14 19:52:14,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-12-14 19:52:14,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2021-12-14 19:52:14,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 77 states have (on average 1.2207792207792207) internal successors, (94), 88 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:14,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 94 transitions. [2021-12-14 19:52:14,247 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 94 transitions. Word has length 33 [2021-12-14 19:52:14,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:52:14,247 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 94 transitions. [2021-12-14 19:52:14,247 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 30 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:14,247 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2021-12-14 19:52:14,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-14 19:52:14,247 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:52:14,247 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:52:14,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-14 19:52:14,459 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:52:14,459 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-14 19:52:14,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:52:14,460 INFO L85 PathProgramCache]: Analyzing trace with hash 823444806, now seen corresponding path program 1 times [2021-12-14 19:52:14,460 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:52:14,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554469709] [2021-12-14 19:52:14,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:52:14,460 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:52:14,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:52:14,654 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:52:14,655 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:52:14,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554469709] [2021-12-14 19:52:14,655 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554469709] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:52:14,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1250734504] [2021-12-14 19:52:14,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:52:14,655 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:52:14,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:52:14,656 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:52:14,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-14 19:52:14,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:52:14,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 46 conjunts are in the unsatisfiable core [2021-12-14 19:52:14,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:52:14,765 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:52:14,836 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-12-14 19:52:14,837 INFO L388 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 [2021-12-14 19:52:14,851 INFO L388 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 11 treesize of output 7 [2021-12-14 19:52:14,869 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:52:14,870 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2021-12-14 19:52:14,916 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2021-12-14 19:52:14,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:52:14,943 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2021-12-14 19:52:15,014 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:52:15,015 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 21 [2021-12-14 19:52:15,197 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2021-12-14 19:52:15,203 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:52:15,203 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:52:17,447 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_851 Int) (v_ArrVal_850 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_850) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) v_ArrVal_851) 0)))) (forall ((v_ArrVal_851 Int) (v_ArrVal_850 (Array Int Int))) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_850) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) v_ArrVal_851) 0)) 1))) is different from false [2021-12-14 19:52:17,472 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| Int)) (or (< |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (and (forall ((v_ArrVal_851 Int) (v_ArrVal_850 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_850) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| 4) v_ArrVal_851) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (forall ((v_ArrVal_851 Int) (v_ArrVal_850 (Array Int Int))) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_850) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| 4) v_ArrVal_851) 0)) 1))))) is different from false [2021-12-14 19:52:17,485 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:52:17,485 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 51 [2021-12-14 19:52:17,527 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| Int)) (or (< |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (and (forall ((v_prenex_3 Int) (v_ArrVal_849 (Array Int Int)) (v_prenex_4 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_849) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_4) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| 4) v_prenex_3) 0)))) (forall ((v_ArrVal_851 Int) (v_ArrVal_849 (Array Int Int)) (v_ArrVal_850 (Array Int Int))) (= (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_849) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_850) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| 4) v_ArrVal_851) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))))) is different from false [2021-12-14 19:52:17,554 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:52:17,554 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2021-12-14 19:52:17,557 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 325 treesize of output 315 [2021-12-14 19:52:17,566 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:52:17,566 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 365 treesize of output 363 [2021-12-14 19:52:17,572 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 376 treesize of output 372 [2021-12-14 19:52:17,577 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 424 treesize of output 416 [2021-12-14 19:52:17,581 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 464 treesize of output 456 [2021-12-14 19:52:17,586 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 480 treesize of output 476 [2021-12-14 19:52:17,746 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-14 19:52:17,746 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2021-12-14 19:52:17,758 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2021-12-14 19:52:17,758 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1250734504] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:52:17,758 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:52:17,758 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 33 [2021-12-14 19:52:17,758 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103307629] [2021-12-14 19:52:17,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:52:17,759 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-12-14 19:52:17,759 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:52:17,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-12-14 19:52:17,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=848, Unknown=3, NotChecked=180, Total=1122 [2021-12-14 19:52:17,760 INFO L87 Difference]: Start difference. First operand 89 states and 94 transitions. Second operand has 34 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 34 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:19,854 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (and (= .cse0 1) (not (= .cse0 0)) (not (= 0 (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (forall ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| Int)) (or (< |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (and (forall ((v_prenex_3 Int) (v_ArrVal_849 (Array Int Int)) (v_prenex_4 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_849) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_4) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| 4) v_prenex_3) 0)))) (forall ((v_ArrVal_851 Int) (v_ArrVal_849 (Array Int Int)) (v_ArrVal_850 (Array Int Int))) (= (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_849) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_850) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| 4) v_ArrVal_851) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))))) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0)))) is different from false [2021-12-14 19:52:20,355 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= (select |c_#valid| .cse0) 1) (forall ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| Int)) (or (< |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (and (forall ((v_ArrVal_851 Int) (v_ArrVal_850 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_850) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| 4) v_ArrVal_851) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (forall ((v_ArrVal_851 Int) (v_ArrVal_850 (Array Int Int))) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_850) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| 4) v_ArrVal_851) 0)) 1))))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0))) is different from false [2021-12-14 19:52:22,405 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| Int)) (or (< |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (and (forall ((v_prenex_3 Int) (v_ArrVal_849 (Array Int Int)) (v_prenex_4 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_849) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_4) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| 4) v_prenex_3) 0)))) (forall ((v_ArrVal_851 Int) (v_ArrVal_849 (Array Int Int)) (v_ArrVal_850 (Array Int Int))) (= (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_849) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_850) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| 4) v_ArrVal_851) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))))) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0)) is different from false [2021-12-14 19:52:22,852 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= (select |c_#valid| .cse0) 1) (forall ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| Int)) (or (< |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (and (forall ((v_ArrVal_851 Int) (v_ArrVal_850 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_850) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| 4) v_ArrVal_851) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (forall ((v_ArrVal_851 Int) (v_ArrVal_850 (Array Int Int))) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_850) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| 4) v_ArrVal_851) 0)) 1))))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0))) is different from false [2021-12-14 19:52:23,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:52:23,426 INFO L93 Difference]: Finished difference Result 120 states and 129 transitions. [2021-12-14 19:52:23,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-14 19:52:23,426 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 34 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-12-14 19:52:23,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:52:23,427 INFO L225 Difference]: With dead ends: 120 [2021-12-14 19:52:23,427 INFO L226 Difference]: Without dead ends: 120 [2021-12-14 19:52:23,427 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=196, Invalid=1547, Unknown=7, NotChecked=602, Total=2352 [2021-12-14 19:52:23,428 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 131 mSDsluCounter, 1026 mSDsCounter, 0 mSdLazyCounter, 838 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 1089 SdHoareTripleChecker+Invalid, 1132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 280 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 19:52:23,428 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 1089 Invalid, 1132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 838 Invalid, 0 Unknown, 280 Unchecked, 0.4s Time] [2021-12-14 19:52:23,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-12-14 19:52:23,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 110. [2021-12-14 19:52:23,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 98 states have (on average 1.2040816326530612) internal successors, (118), 109 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:23,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 118 transitions. [2021-12-14 19:52:23,430 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 118 transitions. Word has length 33 [2021-12-14 19:52:23,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:52:23,430 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 118 transitions. [2021-12-14 19:52:23,430 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 34 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:23,430 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 118 transitions. [2021-12-14 19:52:23,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-14 19:52:23,430 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:52:23,430 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:52:23,452 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-14 19:52:23,651 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:52:23,652 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-14 19:52:23,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:52:23,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1553624943, now seen corresponding path program 1 times [2021-12-14 19:52:23,658 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:52:23,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780256213] [2021-12-14 19:52:23,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:52:23,658 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:52:23,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:52:23,987 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:52:23,987 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:52:23,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780256213] [2021-12-14 19:52:23,987 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780256213] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:52:23,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363187857] [2021-12-14 19:52:23,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:52:23,987 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:52:23,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:52:23,991 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:52:23,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-14 19:52:24,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:52:24,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 65 conjunts are in the unsatisfiable core [2021-12-14 19:52:24,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:52:24,107 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:52:24,158 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-14 19:52:24,158 INFO L388 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 [2021-12-14 19:52:24,256 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-12-14 19:52:24,257 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2021-12-14 19:52:24,292 INFO L388 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 11 treesize of output 7 [2021-12-14 19:52:24,333 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:52:24,334 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2021-12-14 19:52:24,410 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2021-12-14 19:52:24,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:52:24,438 INFO L388 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 39 treesize of output 30 [2021-12-14 19:52:24,611 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:52:24,611 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 24 [2021-12-14 19:52:24,633 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2021-12-14 19:52:24,638 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:52:24,638 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:52:25,022 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:52:25,023 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 51 [2021-12-14 19:52:25,096 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:52:25,097 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2021-12-14 19:52:25,098 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 81 [2021-12-14 19:52:25,114 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:52:25,115 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 60 [2021-12-14 19:52:25,117 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:52:25,118 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 53 [2021-12-14 19:52:25,119 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:52:25,120 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 51 [2021-12-14 19:52:25,131 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-14 19:52:25,131 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 1 [2021-12-14 19:52:25,477 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:52:25,477 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1363187857] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:52:25,477 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:52:25,478 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 19] total 49 [2021-12-14 19:52:25,478 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699748869] [2021-12-14 19:52:25,478 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:52:25,478 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2021-12-14 19:52:25,478 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:52:25,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-12-14 19:52:25,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=2265, Unknown=4, NotChecked=0, Total=2450 [2021-12-14 19:52:25,479 INFO L87 Difference]: Start difference. First operand 110 states and 118 transitions. Second operand has 50 states, 49 states have (on average 1.6326530612244898) internal successors, (80), 50 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:27,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:52:27,119 INFO L93 Difference]: Finished difference Result 109 states and 117 transitions. [2021-12-14 19:52:27,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-14 19:52:27,119 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 1.6326530612244898) internal successors, (80), 50 states have internal predecessors, (80), 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 34 [2021-12-14 19:52:27,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:52:27,120 INFO L225 Difference]: With dead ends: 109 [2021-12-14 19:52:27,120 INFO L226 Difference]: Without dead ends: 109 [2021-12-14 19:52:27,121 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 881 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=615, Invalid=3803, Unknown=4, NotChecked=0, Total=4422 [2021-12-14 19:52:27,121 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 294 mSDsluCounter, 903 mSDsCounter, 0 mSdLazyCounter, 1452 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 952 SdHoareTripleChecker+Invalid, 1793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 1452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 246 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-14 19:52:27,121 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [294 Valid, 952 Invalid, 1793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 1452 Invalid, 0 Unknown, 246 Unchecked, 0.6s Time] [2021-12-14 19:52:27,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-12-14 19:52:27,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2021-12-14 19:52:27,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 98 states have (on average 1.1938775510204083) internal successors, (117), 108 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:27,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions. [2021-12-14 19:52:27,123 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 34 [2021-12-14 19:52:27,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:52:27,123 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions. [2021-12-14 19:52:27,123 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 1.6326530612244898) internal successors, (80), 50 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:27,123 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2021-12-14 19:52:27,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-14 19:52:27,123 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:52:27,123 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:52:27,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-12-14 19:52:27,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-12-14 19:52:27,335 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-14 19:52:27,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:52:27,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1554055919, now seen corresponding path program 1 times [2021-12-14 19:52:27,336 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:52:27,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301944301] [2021-12-14 19:52:27,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:52:27,336 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:52:27,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:52:27,547 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:52:27,547 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:52:27,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301944301] [2021-12-14 19:52:27,547 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301944301] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:52:27,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75002091] [2021-12-14 19:52:27,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:52:27,547 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:52:27,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:52:27,551 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:52:27,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-14 19:52:27,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:52:27,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 38 conjunts are in the unsatisfiable core [2021-12-14 19:52:27,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:52:27,693 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:52:27,693 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-14 19:52:27,747 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:52:27,790 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:52:27,791 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2021-12-14 19:52:27,901 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-14 19:52:27,901 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2021-12-14 19:52:27,928 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:52:27,928 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:52:28,012 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2021-12-14 19:52:28,041 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2021-12-14 19:52:28,042 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2021-12-14 19:52:28,074 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-14 19:52:28,074 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2021-12-14 19:52:28,080 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:52:28,080 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75002091] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:52:28,080 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:52:28,080 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 30 [2021-12-14 19:52:28,080 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839794764] [2021-12-14 19:52:28,081 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:52:28,081 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-12-14 19:52:28,081 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:52:28,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-12-14 19:52:28,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=818, Unknown=0, NotChecked=0, Total=930 [2021-12-14 19:52:28,082 INFO L87 Difference]: Start difference. First operand 109 states and 117 transitions. Second operand has 31 states, 30 states have (on average 2.6333333333333333) internal successors, (79), 31 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:28,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:52:28,477 INFO L93 Difference]: Finished difference Result 108 states and 116 transitions. [2021-12-14 19:52:28,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-14 19:52:28,477 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.6333333333333333) internal successors, (79), 31 states have internal predecessors, (79), 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 34 [2021-12-14 19:52:28,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:52:28,478 INFO L225 Difference]: With dead ends: 108 [2021-12-14 19:52:28,478 INFO L226 Difference]: Without dead ends: 108 [2021-12-14 19:52:28,478 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=289, Invalid=1351, Unknown=0, NotChecked=0, Total=1640 [2021-12-14 19:52:28,479 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 561 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 115 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:52:28,479 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [561 Valid, 425 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 546 Invalid, 0 Unknown, 115 Unchecked, 0.2s Time] [2021-12-14 19:52:28,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-12-14 19:52:28,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2021-12-14 19:52:28,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 98 states have (on average 1.183673469387755) internal successors, (116), 107 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:28,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2021-12-14 19:52:28,481 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 34 [2021-12-14 19:52:28,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:52:28,481 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2021-12-14 19:52:28,481 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.6333333333333333) internal successors, (79), 31 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:28,481 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2021-12-14 19:52:28,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-14 19:52:28,481 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:52:28,481 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:52:28,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-14 19:52:28,682 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:52:28,682 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-14 19:52:28,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:52:28,682 INFO L85 PathProgramCache]: Analyzing trace with hash 449486225, now seen corresponding path program 1 times [2021-12-14 19:52:28,682 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:52:28,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875253318] [2021-12-14 19:52:28,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:52:28,683 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:52:28,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:52:29,037 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:52:29,037 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:52:29,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875253318] [2021-12-14 19:52:29,037 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875253318] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:52:29,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650397125] [2021-12-14 19:52:29,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:52:29,037 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:52:29,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:52:29,038 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:52:29,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-14 19:52:29,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:52:29,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 58 conjunts are in the unsatisfiable core [2021-12-14 19:52:29,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:52:29,139 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:52:29,176 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-14 19:52:29,176 INFO L388 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 [2021-12-14 19:52:29,242 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-12-14 19:52:29,242 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2021-12-14 19:52:29,289 INFO L388 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 11 treesize of output 7 [2021-12-14 19:52:29,328 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:52:29,328 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2021-12-14 19:52:29,394 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2021-12-14 19:52:29,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:52:29,429 INFO L388 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 30 treesize of output 25 [2021-12-14 19:52:29,601 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:52:29,601 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 24 [2021-12-14 19:52:29,626 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2021-12-14 19:52:29,632 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:52:29,632 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:52:29,815 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-12-14 19:52:29,818 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1110 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1110) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) is different from false [2021-12-14 19:52:29,824 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1110 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1110) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) is different from false [2021-12-14 19:52:29,828 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1109 (Array Int Int)) (v_ArrVal_1110 (Array Int Int))) (not (= (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1109) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1110) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) is different from false [2021-12-14 19:52:29,832 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:52:29,832 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2021-12-14 19:52:29,834 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 81 [2021-12-14 19:52:29,836 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 85 [2021-12-14 19:52:29,840 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2021-12-14 19:52:29,843 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2021-12-14 19:52:29,849 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2021-12-14 19:52:30,159 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2021-12-14 19:52:30,160 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1650397125] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:52:30,160 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:52:30,160 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17, 17] total 47 [2021-12-14 19:52:30,160 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685940010] [2021-12-14 19:52:30,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:52:30,161 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2021-12-14 19:52:30,161 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:52:30,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-12-14 19:52:30,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1817, Unknown=3, NotChecked=264, Total=2256 [2021-12-14 19:52:30,162 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand has 48 states, 47 states have (on average 1.702127659574468) internal successors, (80), 48 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:31,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:52:31,323 INFO L93 Difference]: Finished difference Result 105 states and 113 transitions. [2021-12-14 19:52:31,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-14 19:52:31,324 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 1.702127659574468) internal successors, (80), 48 states have internal predecessors, (80), 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 34 [2021-12-14 19:52:31,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:52:31,325 INFO L225 Difference]: With dead ends: 105 [2021-12-14 19:52:31,325 INFO L226 Difference]: Without dead ends: 105 [2021-12-14 19:52:31,326 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 956 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=572, Invalid=3097, Unknown=3, NotChecked=360, Total=4032 [2021-12-14 19:52:31,326 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 555 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 1162 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 555 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 1628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 1162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 310 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-14 19:52:31,326 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [555 Valid, 638 Invalid, 1628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 1162 Invalid, 0 Unknown, 310 Unchecked, 0.5s Time] [2021-12-14 19:52:31,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-12-14 19:52:31,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2021-12-14 19:52:31,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 98 states have (on average 1.153061224489796) internal successors, (113), 104 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:31,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 113 transitions. [2021-12-14 19:52:31,329 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 113 transitions. Word has length 34 [2021-12-14 19:52:31,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:52:31,329 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 113 transitions. [2021-12-14 19:52:31,329 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 1.702127659574468) internal successors, (80), 48 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:31,329 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 113 transitions. [2021-12-14 19:52:31,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-14 19:52:31,330 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:52:31,330 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:52:31,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-14 19:52:31,543 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-12-14 19:52:31,543 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-14 19:52:31,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:52:31,543 INFO L85 PathProgramCache]: Analyzing trace with hash 449055249, now seen corresponding path program 1 times [2021-12-14 19:52:31,543 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:52:31,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824195847] [2021-12-14 19:52:31,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:52:31,544 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:52:31,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:52:31,714 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:52:31,714 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:52:31,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824195847] [2021-12-14 19:52:31,714 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824195847] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:52:31,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815634462] [2021-12-14 19:52:31,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:52:31,715 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:52:31,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:52:31,716 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:52:31,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-14 19:52:31,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:52:31,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 44 conjunts are in the unsatisfiable core [2021-12-14 19:52:31,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:52:31,814 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:52:31,832 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:52:31,833 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-12-14 19:52:31,871 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-12-14 19:52:31,871 INFO L388 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 [2021-12-14 19:52:31,879 INFO L388 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 11 treesize of output 7 [2021-12-14 19:52:31,896 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:52:31,897 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2021-12-14 19:52:31,921 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2021-12-14 19:52:31,931 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-14 19:52:31,931 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 27 [2021-12-14 19:52:31,981 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:52:31,981 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 16 [2021-12-14 19:52:32,044 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-14 19:52:32,045 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2021-12-14 19:52:32,073 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:52:32,073 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:52:32,178 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-12-14 19:52:32,465 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0)))) is different from false [2021-12-14 19:52:32,469 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int) (v_ArrVal_1198 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1198) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0)))) is different from false [2021-12-14 19:52:32,473 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int) (v_ArrVal_1198 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1198) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) is different from false [2021-12-14 19:52:32,477 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int) (v_ArrVal_1198 (Array Int Int)) (v_ArrVal_1197 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1197) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1198) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0)))) is different from false [2021-12-14 19:52:32,480 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:52:32,480 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2021-12-14 19:52:32,481 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 171 treesize of output 165 [2021-12-14 19:52:32,483 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 184 treesize of output 180 [2021-12-14 19:52:32,488 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:52:32,488 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 213 treesize of output 215 [2021-12-14 19:52:32,490 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 254 treesize of output 246 [2021-12-14 19:52:32,593 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2021-12-14 19:52:32,594 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1815634462] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:52:32,594 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:52:32,594 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 17] total 36 [2021-12-14 19:52:32,594 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798478239] [2021-12-14 19:52:32,594 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:52:32,594 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2021-12-14 19:52:32,594 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:52:32,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-12-14 19:52:32,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=957, Unknown=4, NotChecked=260, Total=1332 [2021-12-14 19:52:32,595 INFO L87 Difference]: Start difference. First operand 105 states and 113 transitions. Second operand has 37 states, 36 states have (on average 2.4444444444444446) internal successors, (88), 37 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:33,060 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (forall ((|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int) (v_ArrVal_1198 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1198) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (not (= (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select .cse0 0)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0))) is different from false [2021-12-14 19:52:33,413 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (forall ((|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int) (v_ArrVal_1198 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1198) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0)))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (not (= (select .cse0 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) is different from false [2021-12-14 19:52:35,992 WARN L838 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (forall ((|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int) (v_ArrVal_1198 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1198) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0)) is different from false [2021-12-14 19:52:36,328 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (forall ((|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int) (v_ArrVal_1198 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1198) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0)))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (not (= (select .cse0 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) is different from false [2021-12-14 19:52:36,613 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (forall ((|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0)))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (not (= (select .cse0 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) is different from false [2021-12-14 19:52:37,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:52:37,020 INFO L93 Difference]: Finished difference Result 154 states and 164 transitions. [2021-12-14 19:52:37,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-14 19:52:37,020 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.4444444444444446) internal successors, (88), 37 states have internal predecessors, (88), 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 34 [2021-12-14 19:52:37,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:52:37,021 INFO L225 Difference]: With dead ends: 154 [2021-12-14 19:52:37,021 INFO L226 Difference]: Without dead ends: 154 [2021-12-14 19:52:37,022 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=270, Invalid=1827, Unknown=9, NotChecked=864, Total=2970 [2021-12-14 19:52:37,022 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 293 mSDsluCounter, 794 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 1020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 382 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:52:37,022 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [293 Valid, 842 Invalid, 1020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 602 Invalid, 0 Unknown, 382 Unchecked, 0.2s Time] [2021-12-14 19:52:37,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2021-12-14 19:52:37,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 113. [2021-12-14 19:52:37,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 106 states have (on average 1.1603773584905661) internal successors, (123), 112 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:37,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 123 transitions. [2021-12-14 19:52:37,024 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 123 transitions. Word has length 34 [2021-12-14 19:52:37,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:52:37,024 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 123 transitions. [2021-12-14 19:52:37,024 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.4444444444444446) internal successors, (88), 37 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:37,024 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 123 transitions. [2021-12-14 19:52:37,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-14 19:52:37,024 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:52:37,024 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:52:37,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2021-12-14 19:52:37,236 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-12-14 19:52:37,237 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-14 19:52:37,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:52:37,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1654547908, now seen corresponding path program 1 times [2021-12-14 19:52:37,237 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:52:37,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95987795] [2021-12-14 19:52:37,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:52:37,237 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:52:37,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:52:37,635 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:52:37,636 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:52:37,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95987795] [2021-12-14 19:52:37,636 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95987795] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:52:37,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057805948] [2021-12-14 19:52:37,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:52:37,636 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:52:37,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:52:37,638 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:52:37,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-14 19:52:37,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:52:37,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 57 conjunts are in the unsatisfiable core [2021-12-14 19:52:37,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:52:37,765 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:52:37,792 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-14 19:52:37,793 INFO L388 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 [2021-12-14 19:52:37,868 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-12-14 19:52:37,868 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2021-12-14 19:52:37,914 INFO L388 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 11 treesize of output 7 [2021-12-14 19:52:37,950 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:52:37,950 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2021-12-14 19:52:38,022 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2021-12-14 19:52:38,058 INFO L388 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 37 treesize of output 28 [2021-12-14 19:52:38,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:52:38,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:52:38,235 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:52:38,235 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 55 [2021-12-14 19:52:38,776 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2021-12-14 19:52:38,822 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 17 treesize of output 17 [2021-12-14 19:52:38,827 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:52:38,827 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:52:39,791 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (< |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (< 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (let ((.cse0 (select .cse1 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))) (and (not (= .cse0 (select .cse1 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)))) (= (select |c_#valid| .cse0) 1) (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))))))) is different from false [2021-12-14 19:52:40,205 INFO L354 Elim1Store]: treesize reduction 8, result has 85.5 percent of original size [2021-12-14 19:52:40,206 INFO L388 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 89 treesize of output 114 [2021-12-14 19:52:40,457 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (< |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (< 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) (and (forall ((v_ArrVal_1289 (Array Int Int)) (v_ArrVal_1288 (Array Int Int))) (not (= (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1288) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1289) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (forall ((v_ArrVal_1288 (Array Int Int)) (v_prenex_11 (Array Int Int))) (let ((.cse0 (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1288) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_11) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse0) (and (forall ((v_ArrVal_1289 (Array Int Int))) (not (= (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1288) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1289) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (forall ((v_prenex_10 (Array Int Int))) (not (let ((.cse1 (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1288) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_10) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (= (select .cse1 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) (select .cse1 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)))))) (= .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))))) (forall ((v_prenex_10 (Array Int Int)) (v_ArrVal_1288 (Array Int Int))) (not (let ((.cse2 (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1288) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_10) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (= (select .cse2 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) (select .cse2 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4))))))))) is different from false [2021-12-14 19:52:40,484 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:52:40,485 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 213 treesize of output 158 [2021-12-14 19:52:40,488 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 703 treesize of output 681 [2021-12-14 19:52:40,493 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:52:40,502 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:52:40,503 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 859 treesize of output 839 [2021-12-14 19:52:40,523 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:52:40,524 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 858 treesize of output 838 [2021-12-14 19:52:40,538 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 858 treesize of output 850 [2021-12-14 19:52:40,546 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:52:40,547 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 948 treesize of output 924 [2021-12-14 19:52:40,564 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 922 treesize of output 914 [2021-12-14 19:52:40,582 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:52:40,583 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 998 treesize of output 974 [2021-12-14 19:52:40,598 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 984 treesize of output 976 [2021-12-14 19:52:40,607 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1002 treesize of output 998 [2021-12-14 19:52:40,617 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:52:40,618 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1051 treesize of output 1039 [2021-12-14 19:52:41,138 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-12-14 19:52:41,138 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2057805948] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:52:41,138 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:52:41,139 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 19, 19] total 54 [2021-12-14 19:52:41,139 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003702480] [2021-12-14 19:52:41,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:52:41,139 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2021-12-14 19:52:41,140 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:52:41,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2021-12-14 19:52:41,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=2570, Unknown=3, NotChecked=206, Total=2970 [2021-12-14 19:52:41,141 INFO L87 Difference]: Start difference. First operand 113 states and 123 transitions. Second operand has 55 states, 54 states have (on average 1.7222222222222223) internal successors, (93), 55 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:42,000 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (< |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (< 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (let ((.cse0 (select .cse1 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))) (and (not (= .cse0 (select .cse1 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)))) (= (select |c_#valid| .cse0) 1) (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))))))) (not (= .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= (select |c_#valid| .cse3) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= (select |c_#valid| .cse2) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse3)) (not (= .cse2 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse3)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) is different from false [2021-12-14 19:52:42,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:52:42,810 INFO L93 Difference]: Finished difference Result 111 states and 121 transitions. [2021-12-14 19:52:42,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-14 19:52:42,811 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 1.7222222222222223) internal successors, (93), 55 states have internal predecessors, (93), 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 36 [2021-12-14 19:52:42,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:52:42,811 INFO L225 Difference]: With dead ends: 111 [2021-12-14 19:52:42,811 INFO L226 Difference]: Without dead ends: 111 [2021-12-14 19:52:42,812 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 38 SyntacticMatches, 6 SemanticMatches, 68 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1356 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=414, Invalid=4016, Unknown=4, NotChecked=396, Total=4830 [2021-12-14 19:52:42,813 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 129 mSDsluCounter, 964 mSDsCounter, 0 mSdLazyCounter, 1034 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 1017 SdHoareTripleChecker+Invalid, 1596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 528 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 19:52:42,813 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 1017 Invalid, 1596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1034 Invalid, 0 Unknown, 528 Unchecked, 0.4s Time] [2021-12-14 19:52:42,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-12-14 19:52:42,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 104. [2021-12-14 19:52:42,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 99 states have (on average 1.1414141414141414) internal successors, (113), 103 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:42,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 113 transitions. [2021-12-14 19:52:42,815 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 113 transitions. Word has length 36 [2021-12-14 19:52:42,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:52:42,815 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 113 transitions. [2021-12-14 19:52:42,815 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 1.7222222222222223) internal successors, (93), 55 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:42,815 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 113 transitions. [2021-12-14 19:52:42,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-14 19:52:42,815 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:52:42,816 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:52:42,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-12-14 19:52:43,032 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-12-14 19:52:43,033 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-14 19:52:43,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:52:43,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1472889600, now seen corresponding path program 1 times [2021-12-14 19:52:43,033 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:52:43,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888510973] [2021-12-14 19:52:43,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:52:43,034 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:52:43,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:52:43,446 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:52:43,446 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:52:43,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888510973] [2021-12-14 19:52:43,446 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888510973] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:52:43,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82227834] [2021-12-14 19:52:43,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:52:43,447 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:52:43,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:52:43,448 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:52:43,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-14 19:52:43,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:52:43,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 51 conjunts are in the unsatisfiable core [2021-12-14 19:52:43,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:52:43,586 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:52:43,607 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:52:43,608 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-12-14 19:52:43,655 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-12-14 19:52:43,655 INFO L388 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 [2021-12-14 19:52:43,679 INFO L388 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 11 treesize of output 7 [2021-12-14 19:52:43,707 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:52:43,708 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2021-12-14 19:52:43,761 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2021-12-14 19:52:43,770 INFO L388 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 20 treesize of output 19 [2021-12-14 19:52:43,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:52:43,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:52:43,889 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:52:43,889 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 41 [2021-12-14 19:52:44,118 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-14 19:52:44,118 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2021-12-14 19:52:44,258 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-14 19:52:44,258 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 38 [2021-12-14 19:52:44,310 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:52:44,311 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:52:44,524 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 74 [2021-12-14 19:52:44,631 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1380 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1380) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (forall ((v_ArrVal_1380 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1380) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0))))) is different from false [2021-12-14 19:52:44,642 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1380 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1380) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0)))) (forall ((v_ArrVal_1380 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1380) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))))) is different from false [2021-12-14 19:52:44,649 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1379 (Array Int Int)) (v_ArrVal_1380 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1379) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1380) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4)))) (forall ((v_ArrVal_1379 (Array Int Int)) (v_ArrVal_1380 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1379) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1380) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0))))) is different from false [2021-12-14 19:52:44,654 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:52:44,654 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2021-12-14 19:52:44,656 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 171 treesize of output 165 [2021-12-14 19:52:44,658 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 210 treesize of output 202 [2021-12-14 19:52:44,661 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 228 treesize of output 224 [2021-12-14 19:52:44,666 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:52:44,667 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 257 treesize of output 259 [2021-12-14 19:52:44,707 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:52:44,707 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2021-12-14 19:52:44,709 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:52:44,710 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 43 treesize of output 39 [2021-12-14 19:52:44,712 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:52:44,713 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2021-12-14 19:52:44,714 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:52:44,718 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:52:44,718 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2021-12-14 19:52:44,850 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2021-12-14 19:52:44,850 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [82227834] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:52:44,850 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:52:44,850 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18, 19] total 50 [2021-12-14 19:52:44,851 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16804836] [2021-12-14 19:52:44,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:52:44,851 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2021-12-14 19:52:44,851 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:52:44,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2021-12-14 19:52:44,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=2061, Unknown=3, NotChecked=282, Total=2550 [2021-12-14 19:52:44,852 INFO L87 Difference]: Start difference. First operand 104 states and 113 transitions. Second operand has 51 states, 50 states have (on average 2.04) internal successors, (102), 51 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:46,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:52:46,127 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2021-12-14 19:52:46,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-14 19:52:46,127 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 2.04) internal successors, (102), 51 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-12-14 19:52:46,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:52:46,128 INFO L225 Difference]: With dead ends: 101 [2021-12-14 19:52:46,128 INFO L226 Difference]: Without dead ends: 101 [2021-12-14 19:52:46,129 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 68 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1152 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=597, Invalid=3833, Unknown=4, NotChecked=396, Total=4830 [2021-12-14 19:52:46,129 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 539 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 539 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 1307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 386 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 19:52:46,129 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [539 Valid, 584 Invalid, 1307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 785 Invalid, 0 Unknown, 386 Unchecked, 0.4s Time] [2021-12-14 19:52:46,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-12-14 19:52:46,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 79. [2021-12-14 19:52:46,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 77 states have (on average 1.0909090909090908) internal successors, (84), 78 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:46,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2021-12-14 19:52:46,131 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 37 [2021-12-14 19:52:46,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:52:46,131 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2021-12-14 19:52:46,131 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 2.04) internal successors, (102), 51 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:52:46,131 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2021-12-14 19:52:46,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-14 19:52:46,131 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:52:46,131 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:52:46,148 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2021-12-14 19:52:46,331 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-12-14 19:52:46,332 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2021-12-14 19:52:46,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:52:46,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1427207630, now seen corresponding path program 1 times [2021-12-14 19:52:46,332 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:52:46,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495760208] [2021-12-14 19:52:46,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:52:46,332 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:52:46,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:52:46,729 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:52:46,729 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:52:46,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495760208] [2021-12-14 19:52:46,729 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495760208] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:52:46,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1788242556] [2021-12-14 19:52:46,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:52:46,729 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:52:46,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:52:46,730 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:52:46,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-14 19:52:46,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:52:46,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 57 conjunts are in the unsatisfiable core [2021-12-14 19:52:46,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:52:46,868 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:52:46,921 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-14 19:52:46,922 INFO L388 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 [2021-12-14 19:52:47,023 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-12-14 19:52:47,023 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2021-12-14 19:52:47,061 INFO L388 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 11 treesize of output 7 [2021-12-14 19:52:47,102 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:52:47,102 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2021-12-14 19:52:47,180 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2021-12-14 19:52:47,191 INFO L388 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 37 treesize of output 28 [2021-12-14 19:52:47,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:52:47,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:52:47,342 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:52:47,342 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 54 treesize of output 50 [2021-12-14 19:52:47,710 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-14 19:52:47,710 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 18 [2021-12-14 19:52:47,907 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2021-12-14 19:52:47,928 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:52:47,929 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:52:50,491 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (< |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (< 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) (and (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (forall ((v_ArrVal_1474 Int)) (= (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (select (store |c_#valid| (select .cse0 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) v_ArrVal_1474) (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))) 1))))) is different from false [2021-12-14 19:52:50,520 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (< |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (and (forall ((v_ArrVal_1471 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1471) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (forall ((v_ArrVal_1474 Int) (v_ArrVal_1471 (Array Int Int))) (= (let ((.cse0 (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1471) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (select (store |c_#valid| (select .cse0 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) v_ArrVal_1474) (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))) 1))) (< 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))) is different from false [2021-12-14 19:52:50,563 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (< |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (< 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) (and (forall ((v_ArrVal_1471 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1471) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)))) (forall ((v_ArrVal_1474 Int) (v_ArrVal_1471 (Array Int Int))) (= (let ((.cse0 (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1471) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (select (store |c_#valid| (select .cse0 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) v_ArrVal_1474) (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))) 1))))) is different from false [2021-12-14 19:52:50,576 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:52:50,576 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 124 treesize of output 128 [2021-12-14 19:52:50,637 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (< |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0) (< 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) (and (forall ((v_ArrVal_1470 (Array Int Int)) (v_prenex_17 (Array Int Int))) (= (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1470) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_17) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (forall ((v_ArrVal_1470 (Array Int Int)) (v_prenex_17 (Array Int Int))) (not (let ((.cse0 (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1470) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_17) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (= (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) (select .cse0 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)))))) (forall ((v_ArrVal_1471 (Array Int Int)) (v_ArrVal_1470 (Array Int Int))) (not (= (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1470) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1471) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))))) is different from false [2021-12-14 19:52:50,647 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:52:50,647 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 83 [2021-12-14 19:52:50,650 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 270 treesize of output 260 [2021-12-14 19:52:50,653 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:52:50,662 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:52:50,662 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 338 treesize of output 338 [2021-12-14 19:52:50,671 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 314 treesize of output 310 [2021-12-14 19:52:50,677 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 322 treesize of output 320 [2021-12-14 19:52:50,683 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:52:50,683 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 426 treesize of output 402 [2021-12-14 19:52:50,692 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:52:50,692 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 401 treesize of output 389 [2021-12-14 19:52:50,700 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 394 treesize of output 390 [2021-12-14 19:52:50,706 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 403 treesize of output 401 [2021-12-14 19:52:51,242 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2021-12-14 19:52:51,243 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1788242556] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:52:51,243 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:52:51,243 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 21] total 56 [2021-12-14 19:52:51,243 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584218053] [2021-12-14 19:52:51,243 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:52:51,243 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2021-12-14 19:52:51,243 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:52:51,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2021-12-14 19:52:51,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=2573, Unknown=4, NotChecked=420, Total=3192 [2021-12-14 19:52:51,244 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand has 57 states, 56 states have (on average 1.75) internal successors, (98), 57 states have internal predecessors, (98), 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)