./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version ff03de63 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-2.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 2f737570030041640fd86c7d2770b30b4e6ee4ac0d1c521887700aab87fb1426 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ff03de6 [2021-12-21 18:18:44,439 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 18:18:44,442 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 18:18:44,498 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 18:18:44,499 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 18:18:44,500 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 18:18:44,501 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 18:18:44,508 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 18:18:44,509 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 18:18:44,510 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 18:18:44,511 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 18:18:44,512 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 18:18:44,512 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 18:18:44,513 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 18:18:44,514 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 18:18:44,515 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 18:18:44,515 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 18:18:44,516 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 18:18:44,517 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 18:18:44,519 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 18:18:44,520 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 18:18:44,523 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 18:18:44,523 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 18:18:44,525 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 18:18:44,527 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 18:18:44,527 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 18:18:44,527 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 18:18:44,528 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 18:18:44,528 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 18:18:44,529 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 18:18:44,529 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 18:18:44,530 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 18:18:44,531 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 18:18:44,531 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 18:18:44,532 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 18:18:44,532 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 18:18:44,533 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 18:18:44,533 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 18:18:44,533 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 18:18:44,534 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 18:18:44,535 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 18:18:44,539 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-21 18:18:44,557 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 18:18:44,557 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 18:18:44,557 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 18:18:44,558 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 18:18:44,558 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-21 18:18:44,558 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-21 18:18:44,559 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 18:18:44,559 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 18:18:44,559 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 18:18:44,559 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 18:18:44,559 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-21 18:18:44,560 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-21 18:18:44,560 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-21 18:18:44,560 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-21 18:18:44,560 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 18:18:44,560 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-21 18:18:44,560 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-21 18:18:44,561 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-21 18:18:44,561 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-21 18:18:44,561 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-21 18:18:44,561 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-21 18:18:44,561 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 18:18:44,562 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 18:18:44,562 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 18:18:44,562 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-21 18:18:44,562 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 18:18:44,562 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 18:18:44,562 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-21 18:18:44,563 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-21 18:18:44,563 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-21 18:18:44,563 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 18:18:44,563 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 -> 2f737570030041640fd86c7d2770b30b4e6ee4ac0d1c521887700aab87fb1426 [2021-12-21 18:18:44,788 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 18:18:44,808 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 18:18:44,812 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 18:18:44,813 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 18:18:44,813 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 18:18:44,821 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-2.i [2021-12-21 18:18:44,875 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/795f0c880/a325fc1c5ff249aea0351446b394e4d8/FLAGe31d2b0a5 [2021-12-21 18:18:45,320 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 18:18:45,320 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-2.i [2021-12-21 18:18:45,330 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/795f0c880/a325fc1c5ff249aea0351446b394e4d8/FLAGe31d2b0a5 [2021-12-21 18:18:45,656 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/795f0c880/a325fc1c5ff249aea0351446b394e4d8 [2021-12-21 18:18:45,658 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 18:18:45,659 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 18:18:45,660 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 18:18:45,660 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 18:18:45,662 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 18:18:45,663 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 06:18:45" (1/1) ... [2021-12-21 18:18:45,664 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5567cbd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:18:45, skipping insertion in model container [2021-12-21 18:18:45,664 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 06:18:45" (1/1) ... [2021-12-21 18:18:45,671 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 18:18:45,704 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 18:18:45,931 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 18:18:45,935 INFO L203 MainTranslator]: Completed pre-run [2021-12-21 18:18:45,966 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 18:18:45,985 INFO L208 MainTranslator]: Completed translation [2021-12-21 18:18:45,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:18:45 WrapperNode [2021-12-21 18:18:45,986 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 18:18:45,986 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-21 18:18:45,986 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-21 18:18:45,987 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-21 18:18:45,992 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:18:45" (1/1) ... [2021-12-21 18:18:46,002 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:18:45" (1/1) ... [2021-12-21 18:18:46,023 INFO L137 Inliner]: procedures = 116, calls = 30, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 124 [2021-12-21 18:18:46,025 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-21 18:18:46,026 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-21 18:18:46,026 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-21 18:18:46,027 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-21 18:18:46,033 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:18:45" (1/1) ... [2021-12-21 18:18:46,033 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:18:45" (1/1) ... [2021-12-21 18:18:46,049 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:18:45" (1/1) ... [2021-12-21 18:18:46,050 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:18:45" (1/1) ... [2021-12-21 18:18:46,058 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:18:45" (1/1) ... [2021-12-21 18:18:46,072 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:18:45" (1/1) ... [2021-12-21 18:18:46,073 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:18:45" (1/1) ... [2021-12-21 18:18:46,081 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-21 18:18:46,082 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-21 18:18:46,084 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-21 18:18:46,085 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-21 18:18:46,085 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:18:45" (1/1) ... [2021-12-21 18:18:46,091 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 18:18:46,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 18:18:46,114 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-21 18:18:46,118 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-21 18:18:46,145 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2021-12-21 18:18:46,145 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2021-12-21 18:18:46,146 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-21 18:18:46,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-21 18:18:46,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-21 18:18:46,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-21 18:18:46,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-21 18:18:46,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-21 18:18:46,243 INFO L234 CfgBuilder]: Building ICFG [2021-12-21 18:18:46,244 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-21 18:18:46,278 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2021-12-21 18:18:46,536 INFO L275 CfgBuilder]: Performing block encoding [2021-12-21 18:18:46,542 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-21 18:18:46,544 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-21 18:18:46,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 06:18:46 BoogieIcfgContainer [2021-12-21 18:18:46,546 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-21 18:18:46,547 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-21 18:18:46,547 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-21 18:18:46,550 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-21 18:18:46,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 06:18:45" (1/3) ... [2021-12-21 18:18:46,551 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d6222dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 06:18:46, skipping insertion in model container [2021-12-21 18:18:46,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:18:45" (2/3) ... [2021-12-21 18:18:46,552 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d6222dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 06:18:46, skipping insertion in model container [2021-12-21 18:18:46,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 06:18:46" (3/3) ... [2021-12-21 18:18:46,554 INFO L111 eAbstractionObserver]: Analyzing ICFG dll_nondet_free_order-2.i [2021-12-21 18:18:46,560 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-21 18:18:46,560 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 59 error locations. [2021-12-21 18:18:46,605 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-21 18:18:46,613 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-21 18:18:46,614 INFO L340 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2021-12-21 18:18:46,631 INFO L276 IsEmpty]: Start isEmpty. Operand has 133 states, 71 states have (on average 1.9577464788732395) internal successors, (139), 131 states have internal predecessors, (139), 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-21 18:18:46,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-12-21 18:18:46,651 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:18:46,652 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-12-21 18:18:46,652 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 55 more)] === [2021-12-21 18:18:46,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:18:46,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1079622, now seen corresponding path program 1 times [2021-12-21 18:18:46,665 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:18:46,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81236249] [2021-12-21 18:18:46,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:18:46,666 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:18:46,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:18:46,840 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-21 18:18:46,841 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:18:46,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81236249] [2021-12-21 18:18:46,842 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81236249] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:18:46,842 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:18:46,842 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 18:18:46,844 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283572068] [2021-12-21 18:18:46,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:18:46,847 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 18:18:46,848 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:18:46,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 18:18:46,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 18:18:46,876 INFO L87 Difference]: Start difference. First operand has 133 states, 71 states have (on average 1.9577464788732395) internal successors, (139), 131 states have internal predecessors, (139), 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-21 18:18:47,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:18:47,003 INFO L93 Difference]: Finished difference Result 130 states and 137 transitions. [2021-12-21 18:18:47,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 18:18:47,005 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-21 18:18:47,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:18:47,012 INFO L225 Difference]: With dead ends: 130 [2021-12-21 18:18:47,012 INFO L226 Difference]: Without dead ends: 124 [2021-12-21 18:18:47,015 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-21 18:18:47,018 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 50 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 18:18:47,018 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 165 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 18:18:47,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2021-12-21 18:18:47,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2021-12-21 18:18:47,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 68 states have (on average 1.8970588235294117) 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-21 18:18:47,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 129 transitions. [2021-12-21 18:18:47,060 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 129 transitions. Word has length 4 [2021-12-21 18:18:47,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:18:47,060 INFO L470 AbstractCegarLoop]: Abstraction has 124 states and 129 transitions. [2021-12-21 18:18:47,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-21 18:18:47,061 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 129 transitions. [2021-12-21 18:18:47,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-12-21 18:18:47,061 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:18:47,061 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-12-21 18:18:47,062 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-21 18:18:47,062 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 55 more)] === [2021-12-21 18:18:47,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:18:47,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1079623, now seen corresponding path program 1 times [2021-12-21 18:18:47,063 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:18:47,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218665035] [2021-12-21 18:18:47,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:18:47,064 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:18:47,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:18:47,103 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-21 18:18:47,103 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:18:47,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218665035] [2021-12-21 18:18:47,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218665035] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:18:47,104 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:18:47,104 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 18:18:47,104 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512185742] [2021-12-21 18:18:47,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:18:47,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 18:18:47,105 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:18:47,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 18:18:47,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 18:18:47,106 INFO L87 Difference]: Start difference. First operand 124 states and 129 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-21 18:18:47,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:18:47,135 INFO L93 Difference]: Finished difference Result 121 states and 126 transitions. [2021-12-21 18:18:47,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 18:18:47,136 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-21 18:18:47,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:18:47,137 INFO L225 Difference]: With dead ends: 121 [2021-12-21 18:18:47,137 INFO L226 Difference]: Without dead ends: 121 [2021-12-21 18:18:47,137 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-21 18:18:47,139 INFO L933 BasicCegarLoop]: 110 mSDtfsCounter, 122 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 111 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-21 18:18:47,139 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 111 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 18:18:47,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-12-21 18:18:47,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2021-12-21 18:18:47,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 68 states have (on average 1.8529411764705883) internal successors, (126), 120 states have internal predecessors, (126), 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-21 18:18:47,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 126 transitions. [2021-12-21 18:18:47,147 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 126 transitions. Word has length 4 [2021-12-21 18:18:47,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:18:47,147 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 126 transitions. [2021-12-21 18:18:47,147 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-21 18:18:47,147 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 126 transitions. [2021-12-21 18:18:47,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-21 18:18:47,148 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:18:47,148 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:18:47,148 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-21 18:18:47,148 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 55 more)] === [2021-12-21 18:18:47,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:18:47,149 INFO L85 PathProgramCache]: Analyzing trace with hash 2065247192, now seen corresponding path program 1 times [2021-12-21 18:18:47,149 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:18:47,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285818954] [2021-12-21 18:18:47,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:18:47,150 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:18:47,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:18:47,191 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-21 18:18:47,191 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:18:47,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285818954] [2021-12-21 18:18:47,191 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285818954] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:18:47,192 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:18:47,192 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 18:18:47,192 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294382024] [2021-12-21 18:18:47,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:18:47,193 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 18:18:47,193 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:18:47,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 18:18:47,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 18:18:47,194 INFO L87 Difference]: Start difference. First operand 121 states and 126 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-21 18:18:47,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:18:47,206 INFO L93 Difference]: Finished difference Result 130 states and 135 transitions. [2021-12-21 18:18:47,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 18:18:47,206 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-21 18:18:47,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:18:47,208 INFO L225 Difference]: With dead ends: 130 [2021-12-21 18:18:47,208 INFO L226 Difference]: Without dead ends: 130 [2021-12-21 18:18:47,208 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-21 18:18:47,209 INFO L933 BasicCegarLoop]: 124 mSDtfsCounter, 8 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 242 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-21 18:18:47,210 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 242 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 18:18:47,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-12-21 18:18:47,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 122. [2021-12-21 18:18:47,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 69 states have (on average 1.8405797101449275) internal successors, (127), 121 states have internal predecessors, (127), 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-21 18:18:47,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 127 transitions. [2021-12-21 18:18:47,217 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 127 transitions. Word has length 9 [2021-12-21 18:18:47,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:18:47,218 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 127 transitions. [2021-12-21 18:18:47,218 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-21 18:18:47,218 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 127 transitions. [2021-12-21 18:18:47,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-21 18:18:47,218 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:18:47,218 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:18:47,219 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-21 18:18:47,219 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 55 more)] === [2021-12-21 18:18:47,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:18:47,219 INFO L85 PathProgramCache]: Analyzing trace with hash 2065248729, now seen corresponding path program 1 times [2021-12-21 18:18:47,220 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:18:47,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842555356] [2021-12-21 18:18:47,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:18:47,220 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:18:47,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:18:47,262 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-21 18:18:47,263 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:18:47,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842555356] [2021-12-21 18:18:47,263 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842555356] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:18:47,263 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:18:47,263 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 18:18:47,264 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439727633] [2021-12-21 18:18:47,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:18:47,264 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 18:18:47,264 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:18:47,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 18:18:47,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 18:18:47,265 INFO L87 Difference]: Start difference. First operand 122 states and 127 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-21 18:18:47,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:18:47,338 INFO L93 Difference]: Finished difference Result 121 states and 126 transitions. [2021-12-21 18:18:47,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 18:18:47,338 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-21 18:18:47,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:18:47,340 INFO L225 Difference]: With dead ends: 121 [2021-12-21 18:18:47,340 INFO L226 Difference]: Without dead ends: 121 [2021-12-21 18:18:47,341 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-21 18:18:47,342 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 40 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 18:18:47,343 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 159 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 18:18:47,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-12-21 18:18:47,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2021-12-21 18:18:47,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 69 states have (on average 1.826086956521739) internal successors, (126), 120 states have internal predecessors, (126), 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-21 18:18:47,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 126 transitions. [2021-12-21 18:18:47,351 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 126 transitions. Word has length 9 [2021-12-21 18:18:47,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:18:47,351 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 126 transitions. [2021-12-21 18:18:47,351 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-21 18:18:47,351 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 126 transitions. [2021-12-21 18:18:47,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-21 18:18:47,352 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:18:47,352 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:18:47,352 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-21 18:18:47,352 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 55 more)] === [2021-12-21 18:18:47,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:18:47,353 INFO L85 PathProgramCache]: Analyzing trace with hash 2065248730, now seen corresponding path program 1 times [2021-12-21 18:18:47,353 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:18:47,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069292113] [2021-12-21 18:18:47,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:18:47,354 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:18:47,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:18:47,421 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-21 18:18:47,422 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:18:47,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069292113] [2021-12-21 18:18:47,422 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069292113] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:18:47,422 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:18:47,423 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 18:18:47,423 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436768348] [2021-12-21 18:18:47,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:18:47,423 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 18:18:47,424 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:18:47,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 18:18:47,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 18:18:47,424 INFO L87 Difference]: Start difference. First operand 121 states and 126 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-21 18:18:47,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:18:47,446 INFO L93 Difference]: Finished difference Result 120 states and 125 transitions. [2021-12-21 18:18:47,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 18:18:47,447 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-21 18:18:47,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:18:47,448 INFO L225 Difference]: With dead ends: 120 [2021-12-21 18:18:47,448 INFO L226 Difference]: Without dead ends: 120 [2021-12-21 18:18:47,448 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-21 18:18:47,449 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 116 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 115 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-21 18:18:47,450 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 115 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 18:18:47,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-12-21 18:18:47,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2021-12-21 18:18:47,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 69 states have (on average 1.8115942028985508) internal successors, (125), 119 states have internal predecessors, (125), 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-21 18:18:47,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 125 transitions. [2021-12-21 18:18:47,455 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 125 transitions. Word has length 9 [2021-12-21 18:18:47,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:18:47,455 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 125 transitions. [2021-12-21 18:18:47,456 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-21 18:18:47,456 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 125 transitions. [2021-12-21 18:18:47,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-21 18:18:47,456 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:18:47,456 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:18:47,457 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-21 18:18:47,457 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 55 more)] === [2021-12-21 18:18:47,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:18:47,457 INFO L85 PathProgramCache]: Analyzing trace with hash -401798830, now seen corresponding path program 1 times [2021-12-21 18:18:47,458 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:18:47,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921185133] [2021-12-21 18:18:47,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:18:47,458 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:18:47,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:18:47,522 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-21 18:18:47,523 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:18:47,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921185133] [2021-12-21 18:18:47,524 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921185133] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:18:47,524 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:18:47,524 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 18:18:47,524 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200252927] [2021-12-21 18:18:47,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:18:47,525 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 18:18:47,525 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:18:47,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 18:18:47,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-21 18:18:47,526 INFO L87 Difference]: Start difference. First operand 120 states and 125 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 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-21 18:18:47,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:18:47,635 INFO L93 Difference]: Finished difference Result 124 states and 129 transitions. [2021-12-21 18:18:47,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 18:18:47,636 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 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-21 18:18:47,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:18:47,638 INFO L225 Difference]: With dead ends: 124 [2021-12-21 18:18:47,638 INFO L226 Difference]: Without dead ends: 124 [2021-12-21 18:18:47,638 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-12-21 18:18:47,640 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 82 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 18:18:47,641 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 255 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 18:18:47,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2021-12-21 18:18:47,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2021-12-21 18:18:47,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 72 states have (on average 1.7916666666666667) internal successors, (129), 122 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-21 18:18:47,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 129 transitions. [2021-12-21 18:18:47,647 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 129 transitions. Word has length 10 [2021-12-21 18:18:47,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:18:47,647 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 129 transitions. [2021-12-21 18:18:47,647 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 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-21 18:18:47,647 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 129 transitions. [2021-12-21 18:18:47,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-21 18:18:47,648 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:18:47,648 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:18:47,648 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-21 18:18:47,648 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 55 more)] === [2021-12-21 18:18:47,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:18:47,649 INFO L85 PathProgramCache]: Analyzing trace with hash -401798829, now seen corresponding path program 1 times [2021-12-21 18:18:47,649 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:18:47,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937305369] [2021-12-21 18:18:47,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:18:47,649 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:18:47,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:18:47,789 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-21 18:18:47,790 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:18:47,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937305369] [2021-12-21 18:18:47,790 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937305369] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:18:47,790 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:18:47,790 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-21 18:18:47,791 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504922697] [2021-12-21 18:18:47,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:18:47,791 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 18:18:47,791 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:18:47,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 18:18:47,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-21 18:18:47,792 INFO L87 Difference]: Start difference. First operand 123 states and 129 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 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-21 18:18:47,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:18:47,926 INFO L93 Difference]: Finished difference Result 124 states and 129 transitions. [2021-12-21 18:18:47,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 18:18:47,927 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 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-21 18:18:47,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:18:47,928 INFO L225 Difference]: With dead ends: 124 [2021-12-21 18:18:47,928 INFO L226 Difference]: Without dead ends: 124 [2021-12-21 18:18:47,929 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-21 18:18:47,931 INFO L933 BasicCegarLoop]: 99 mSDtfsCounter, 170 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 18:18:47,931 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 319 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 18:18:47,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2021-12-21 18:18:47,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2021-12-21 18:18:47,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 72 states have (on average 1.7777777777777777) internal successors, (128), 122 states have internal predecessors, (128), 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-21 18:18:47,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 128 transitions. [2021-12-21 18:18:47,954 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 128 transitions. Word has length 10 [2021-12-21 18:18:47,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:18:47,955 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 128 transitions. [2021-12-21 18:18:47,955 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 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-21 18:18:47,955 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 128 transitions. [2021-12-21 18:18:47,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-21 18:18:47,956 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:18:47,956 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:18:47,956 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-21 18:18:47,956 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 55 more)] === [2021-12-21 18:18:47,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:18:47,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1662359483, now seen corresponding path program 1 times [2021-12-21 18:18:47,957 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:18:47,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98615342] [2021-12-21 18:18:47,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:18:47,957 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:18:47,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:18:48,012 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-21 18:18:48,013 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:18:48,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98615342] [2021-12-21 18:18:48,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98615342] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:18:48,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679058743] [2021-12-21 18:18:48,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:18:48,014 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:18:48,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 18:18:48,019 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-21 18:18:48,024 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-21 18:18:48,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:18:48,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-21 18:18:48,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:18:48,170 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-21 18:18:48,171 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:18:48,213 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-21 18:18:48,213 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679058743] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 18:18:48,213 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 18:18:48,213 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2021-12-21 18:18:48,214 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741919577] [2021-12-21 18:18:48,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 18:18:48,214 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 18:18:48,214 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:18:48,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 18:18:48,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-12-21 18:18:48,215 INFO L87 Difference]: Start difference. First operand 123 states and 128 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:18:48,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:18:48,227 INFO L93 Difference]: Finished difference Result 125 states and 130 transitions. [2021-12-21 18:18:48,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 18:18:48,228 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-12-21 18:18:48,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:18:48,228 INFO L225 Difference]: With dead ends: 125 [2021-12-21 18:18:48,228 INFO L226 Difference]: Without dead ends: 125 [2021-12-21 18:18:48,229 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-12-21 18:18:48,229 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 14 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 18:18:48,230 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 465 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 18:18:48,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-12-21 18:18:48,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2021-12-21 18:18:48,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 74 states have (on average 1.7567567567567568) internal successors, (130), 124 states have internal predecessors, (130), 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-21 18:18:48,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 130 transitions. [2021-12-21 18:18:48,233 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 130 transitions. Word has length 14 [2021-12-21 18:18:48,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:18:48,234 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 130 transitions. [2021-12-21 18:18:48,234 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:18:48,234 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 130 transitions. [2021-12-21 18:18:48,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-21 18:18:48,234 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:18:48,235 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:18:48,262 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-21 18:18:48,453 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:18:48,453 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 55 more)] === [2021-12-21 18:18:48,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:18:48,454 INFO L85 PathProgramCache]: Analyzing trace with hash 6511237, now seen corresponding path program 1 times [2021-12-21 18:18:48,454 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:18:48,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602490374] [2021-12-21 18:18:48,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:18:48,454 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:18:48,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:18:48,517 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:18:48,518 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:18:48,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602490374] [2021-12-21 18:18:48,518 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602490374] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:18:48,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [281236819] [2021-12-21 18:18:48,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:18:48,519 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:18:48,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 18:18:48,520 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-21 18:18:48,521 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-21 18:18:48,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:18:48,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-21 18:18:48,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:18:48,643 INFO L387 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-21 18:18:48,699 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-21 18:18:48,699 INFO L387 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-21 18:18:48,711 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-21 18:18:48,711 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:18:48,835 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-21 18:18:48,835 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [281236819] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 18:18:48,836 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 18:18:48,836 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2021-12-21 18:18:48,836 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858658530] [2021-12-21 18:18:48,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 18:18:48,837 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 18:18:48,837 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:18:48,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 18:18:48,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-21 18:18:48,838 INFO L87 Difference]: Start difference. First operand 125 states and 130 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 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-21 18:18:48,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:18:48,911 INFO L93 Difference]: Finished difference Result 123 states and 128 transitions. [2021-12-21 18:18:48,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 18:18:48,911 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 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-21 18:18:48,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:18:48,912 INFO L225 Difference]: With dead ends: 123 [2021-12-21 18:18:48,912 INFO L226 Difference]: Without dead ends: 123 [2021-12-21 18:18:48,913 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-12-21 18:18:48,913 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 141 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 66 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 18:18:48,914 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 313 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 87 Invalid, 0 Unknown, 66 Unchecked, 0.1s Time] [2021-12-21 18:18:48,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-12-21 18:18:48,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2021-12-21 18:18:48,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 74 states have (on average 1.7297297297297298) internal successors, (128), 122 states have internal predecessors, (128), 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-21 18:18:48,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 128 transitions. [2021-12-21 18:18:48,918 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 128 transitions. Word has length 15 [2021-12-21 18:18:48,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:18:48,918 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 128 transitions. [2021-12-21 18:18:48,918 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 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-21 18:18:48,918 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 128 transitions. [2021-12-21 18:18:48,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-21 18:18:48,919 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:18:48,919 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:18:48,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-21 18:18:49,135 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,SelfDestructingSolverStorable8 [2021-12-21 18:18:49,136 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 55 more)] === [2021-12-21 18:18:49,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:18:49,136 INFO L85 PathProgramCache]: Analyzing trace with hash 6511238, now seen corresponding path program 1 times [2021-12-21 18:18:49,136 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:18:49,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353414907] [2021-12-21 18:18:49,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:18:49,137 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:18:49,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:18:49,244 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-21 18:18:49,244 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:18:49,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353414907] [2021-12-21 18:18:49,244 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353414907] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:18:49,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424785588] [2021-12-21 18:18:49,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:18:49,245 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:18:49,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 18:18:49,248 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-21 18:18:49,254 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-21 18:18:49,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:18:49,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-21 18:18:49,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:18:49,340 INFO L387 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-21 18:18:49,343 INFO L387 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-21 18:18:49,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:18:49,410 INFO L387 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-21 18:18:49,416 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-21 18:18:49,417 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-21 18:18:49,437 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-21 18:18:49,437 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:18:49,673 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-21 18:18:49,674 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [424785588] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 18:18:49,674 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 18:18:49,674 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 12 [2021-12-21 18:18:49,676 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86322440] [2021-12-21 18:18:49,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 18:18:49,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-21 18:18:49,677 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:18:49,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-21 18:18:49,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2021-12-21 18:18:49,678 INFO L87 Difference]: Start difference. First operand 123 states and 128 transitions. Second operand has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:18:49,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:18:49,892 INFO L93 Difference]: Finished difference Result 121 states and 126 transitions. [2021-12-21 18:18:49,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 18:18:49,894 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-21 18:18:49,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:18:49,894 INFO L225 Difference]: With dead ends: 121 [2021-12-21 18:18:49,894 INFO L226 Difference]: Without dead ends: 121 [2021-12-21 18:18:49,895 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2021-12-21 18:18:49,895 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 356 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 68 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 18:18:49,895 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [356 Valid, 406 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 177 Invalid, 0 Unknown, 68 Unchecked, 0.1s Time] [2021-12-21 18:18:49,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-12-21 18:18:49,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2021-12-21 18:18:49,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 74 states have (on average 1.7027027027027026) internal successors, (126), 120 states have internal predecessors, (126), 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-21 18:18:49,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 126 transitions. [2021-12-21 18:18:49,898 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 126 transitions. Word has length 15 [2021-12-21 18:18:49,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:18:49,899 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 126 transitions. [2021-12-21 18:18:49,899 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:18:49,899 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 126 transitions. [2021-12-21 18:18:49,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-21 18:18:49,899 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:18:49,899 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:18:49,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-21 18:18:50,100 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:18:50,100 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 55 more)] === [2021-12-21 18:18:50,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:18:50,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1580520033, now seen corresponding path program 1 times [2021-12-21 18:18:50,100 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:18:50,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660822232] [2021-12-21 18:18:50,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:18:50,101 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:18:50,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:18:50,183 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-21 18:18:50,183 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:18:50,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660822232] [2021-12-21 18:18:50,184 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660822232] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:18:50,184 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:18:50,184 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-21 18:18:50,184 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663957297] [2021-12-21 18:18:50,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:18:50,184 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 18:18:50,185 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:18:50,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 18:18:50,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-21 18:18:50,185 INFO L87 Difference]: Start difference. First operand 121 states and 126 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-21 18:18:50,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:18:50,309 INFO L93 Difference]: Finished difference Result 118 states and 123 transitions. [2021-12-21 18:18:50,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 18:18:50,310 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-21 18:18:50,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:18:50,311 INFO L225 Difference]: With dead ends: 118 [2021-12-21 18:18:50,311 INFO L226 Difference]: Without dead ends: 118 [2021-12-21 18:18:50,311 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-21 18:18:50,311 INFO L933 BasicCegarLoop]: 98 mSDtfsCounter, 107 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 18:18:50,312 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 303 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 18:18:50,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-12-21 18:18:50,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2021-12-21 18:18:50,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 74 states have (on average 1.662162162162162) internal successors, (123), 117 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-21 18:18:50,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 123 transitions. [2021-12-21 18:18:50,314 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 123 transitions. Word has length 22 [2021-12-21 18:18:50,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:18:50,315 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 123 transitions. [2021-12-21 18:18:50,315 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-21 18:18:50,315 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 123 transitions. [2021-12-21 18:18:50,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-21 18:18:50,315 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:18:50,315 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:18:50,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-21 18:18:50,316 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 55 more)] === [2021-12-21 18:18:50,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:18:50,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1580520034, now seen corresponding path program 1 times [2021-12-21 18:18:50,316 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:18:50,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578346359] [2021-12-21 18:18:50,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:18:50,316 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:18:50,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:18:50,381 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-21 18:18:50,382 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:18:50,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578346359] [2021-12-21 18:18:50,382 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578346359] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:18:50,382 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:18:50,382 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-21 18:18:50,382 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261833856] [2021-12-21 18:18:50,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:18:50,383 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 18:18:50,383 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:18:50,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 18:18:50,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-21 18:18:50,384 INFO L87 Difference]: Start difference. First operand 118 states and 123 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-21 18:18:50,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:18:50,475 INFO L93 Difference]: Finished difference Result 111 states and 116 transitions. [2021-12-21 18:18:50,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 18:18:50,476 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-21 18:18:50,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:18:50,477 INFO L225 Difference]: With dead ends: 111 [2021-12-21 18:18:50,477 INFO L226 Difference]: Without dead ends: 111 [2021-12-21 18:18:50,477 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-21 18:18:50,478 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 388 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 89 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-21 18:18:50,478 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [388 Valid, 89 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 18:18:50,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-12-21 18:18:50,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2021-12-21 18:18:50,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 74 states have (on average 1.5675675675675675) internal successors, (116), 110 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-21 18:18:50,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 116 transitions. [2021-12-21 18:18:50,487 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 116 transitions. Word has length 22 [2021-12-21 18:18:50,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:18:50,487 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 116 transitions. [2021-12-21 18:18:50,487 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-21 18:18:50,487 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 116 transitions. [2021-12-21 18:18:50,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-21 18:18:50,488 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:18:50,488 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-21 18:18:50,488 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-21 18:18:50,489 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 55 more)] === [2021-12-21 18:18:50,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:18:50,489 INFO L85 PathProgramCache]: Analyzing trace with hash 67241285, now seen corresponding path program 1 times [2021-12-21 18:18:50,489 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:18:50,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660432476] [2021-12-21 18:18:50,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:18:50,490 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:18:50,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:18:50,574 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-21 18:18:50,574 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:18:50,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660432476] [2021-12-21 18:18:50,574 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660432476] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:18:50,575 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:18:50,575 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-21 18:18:50,575 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058799518] [2021-12-21 18:18:50,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:18:50,575 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 18:18:50,576 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:18:50,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 18:18:50,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-21 18:18:50,576 INFO L87 Difference]: Start difference. First operand 111 states and 116 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-21 18:18:50,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:18:50,664 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2021-12-21 18:18:50,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 18:18:50,665 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-21 18:18:50,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:18:50,666 INFO L225 Difference]: With dead ends: 106 [2021-12-21 18:18:50,666 INFO L226 Difference]: Without dead ends: 106 [2021-12-21 18:18:50,667 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-21 18:18:50,667 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 362 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 18:18:50,668 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [362 Valid, 80 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 18:18:50,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-12-21 18:18:50,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2021-12-21 18:18:50,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 74 states have (on average 1.5) internal successors, (111), 105 states have internal predecessors, (111), 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-21 18:18:50,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 111 transitions. [2021-12-21 18:18:50,670 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 111 transitions. Word has length 28 [2021-12-21 18:18:50,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:18:50,671 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 111 transitions. [2021-12-21 18:18:50,671 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-21 18:18:50,671 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2021-12-21 18:18:50,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-21 18:18:50,672 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:18:50,672 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-21 18:18:50,672 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-21 18:18:50,672 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 55 more)] === [2021-12-21 18:18:50,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:18:50,673 INFO L85 PathProgramCache]: Analyzing trace with hash 67280267, now seen corresponding path program 1 times [2021-12-21 18:18:50,673 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:18:50,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441148490] [2021-12-21 18:18:50,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:18:50,673 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:18:50,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:18:50,801 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-21 18:18:50,801 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:18:50,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441148490] [2021-12-21 18:18:50,802 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441148490] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:18:50,802 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:18:50,802 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-21 18:18:50,802 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433279857] [2021-12-21 18:18:50,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:18:50,803 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-21 18:18:50,803 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:18:50,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-21 18:18:50,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-12-21 18:18:50,804 INFO L87 Difference]: Start difference. First operand 106 states and 111 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-21 18:18:50,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:18:50,973 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2021-12-21 18:18:50,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-21 18:18:50,973 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-21 18:18:50,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:18:50,974 INFO L225 Difference]: With dead ends: 101 [2021-12-21 18:18:50,974 INFO L226 Difference]: Without dead ends: 101 [2021-12-21 18:18:50,974 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-21 18:18:50,975 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 514 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 18:18:50,975 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [514 Valid, 149 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 18:18:50,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-12-21 18:18:50,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2021-12-21 18:18:50,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 74 states have (on average 1.4324324324324325) internal successors, (106), 100 states have internal predecessors, (106), 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-21 18:18:50,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2021-12-21 18:18:50,978 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 28 [2021-12-21 18:18:50,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:18:50,978 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2021-12-21 18:18:50,978 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-21 18:18:50,978 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2021-12-21 18:18:50,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-21 18:18:50,979 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:18:50,979 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-21 18:18:50,979 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-21 18:18:50,979 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 55 more)] === [2021-12-21 18:18:50,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:18:50,980 INFO L85 PathProgramCache]: Analyzing trace with hash 67279051, now seen corresponding path program 1 times [2021-12-21 18:18:50,980 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:18:50,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587785806] [2021-12-21 18:18:50,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:18:50,981 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:18:51,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:18:51,222 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-21 18:18:51,222 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:18:51,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587785806] [2021-12-21 18:18:51,222 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587785806] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:18:51,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588218846] [2021-12-21 18:18:51,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:18:51,222 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:18:51,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 18:18:51,223 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-21 18:18:51,224 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-21 18:18:51,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:18:51,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 56 conjunts are in the unsatisfiable core [2021-12-21 18:18:51,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:18:51,350 INFO L387 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-21 18:18:51,464 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-12-21 18:18:51,465 INFO L387 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-21 18:18:51,513 INFO L387 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-21 18:18:51,551 INFO L387 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-21 18:18:51,630 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-21 18:18:51,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:18:51,665 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-21 18:18:51,788 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:18:51,788 INFO L387 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-21 18:18:51,795 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-21 18:18:51,795 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:18:51,825 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_465 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_465) |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-21 18:18:51,836 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_465 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_465) |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-21 18:18:51,842 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_465 (Array Int Int)) (v_ArrVal_464 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_464) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_465) |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-21 18:18:51,848 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:18:51,848 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2021-12-21 18:18:51,860 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2021-12-21 18:18:51,863 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2021-12-21 18:18:51,866 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2021-12-21 18:18:52,115 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-21 18:18:52,116 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2021-12-21 18:18:52,131 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-21 18:18:52,131 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [588218846] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 18:18:52,132 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 18:18:52,132 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 14] total 35 [2021-12-21 18:18:52,132 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732877391] [2021-12-21 18:18:52,132 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 18:18:52,132 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-12-21 18:18:52,133 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:18:52,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-12-21 18:18:52,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=952, Unknown=3, NotChecked=192, Total=1260 [2021-12-21 18:18:52,134 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand has 36 states, 35 states have (on average 1.8) internal successors, (63), 36 states have internal predecessors, (63), 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-21 18:18:52,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:18:52,790 INFO L93 Difference]: Finished difference Result 193 states and 202 transitions. [2021-12-21 18:18:52,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-21 18:18:52,791 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 36 states have internal predecessors, (63), 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-21 18:18:52,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:18:52,792 INFO L225 Difference]: With dead ends: 193 [2021-12-21 18:18:52,792 INFO L226 Difference]: Without dead ends: 193 [2021-12-21 18:18:52,793 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=242, Invalid=1573, Unknown=3, NotChecked=252, Total=2070 [2021-12-21 18:18:52,793 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 873 mSDsluCounter, 1270 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 873 SdHoareTripleChecker+Valid, 1335 SdHoareTripleChecker+Invalid, 1321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 623 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-21 18:18:52,793 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [873 Valid, 1335 Invalid, 1321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 659 Invalid, 0 Unknown, 623 Unchecked, 0.4s Time] [2021-12-21 18:18:52,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2021-12-21 18:18:52,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 134. [2021-12-21 18:18:52,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 107 states have (on average 1.3925233644859814) internal successors, (149), 133 states have internal predecessors, (149), 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-21 18:18:52,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 149 transitions. [2021-12-21 18:18:52,796 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 149 transitions. Word has length 28 [2021-12-21 18:18:52,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:18:52,797 INFO L470 AbstractCegarLoop]: Abstraction has 134 states and 149 transitions. [2021-12-21 18:18:52,797 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 36 states have internal predecessors, (63), 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-21 18:18:52,797 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 149 transitions. [2021-12-21 18:18:52,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-21 18:18:52,797 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:18:52,797 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-21 18:18:52,823 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-21 18:18:53,011 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,SelfDestructingSolverStorable14 [2021-12-21 18:18:53,011 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 55 more)] === [2021-12-21 18:18:53,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:18:53,012 INFO L85 PathProgramCache]: Analyzing trace with hash 2085688457, now seen corresponding path program 1 times [2021-12-21 18:18:53,012 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:18:53,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744281472] [2021-12-21 18:18:53,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:18:53,012 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:18:53,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:18:53,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-21 18:18:53,168 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:18:53,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744281472] [2021-12-21 18:18:53,169 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744281472] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:18:53,169 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:18:53,169 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-21 18:18:53,169 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624884587] [2021-12-21 18:18:53,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:18:53,170 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-21 18:18:53,170 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:18:53,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-21 18:18:53,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-12-21 18:18:53,171 INFO L87 Difference]: Start difference. First operand 134 states and 149 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-21 18:18:53,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:18:53,416 INFO L93 Difference]: Finished difference Result 129 states and 142 transitions. [2021-12-21 18:18:53,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-21 18:18:53,417 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-21 18:18:53,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:18:53,418 INFO L225 Difference]: With dead ends: 129 [2021-12-21 18:18:53,418 INFO L226 Difference]: Without dead ends: 129 [2021-12-21 18:18:53,418 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-21 18:18:53,419 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 565 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 18:18:53,419 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [565 Valid, 77 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 18:18:53,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2021-12-21 18:18:53,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2021-12-21 18:18:53,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 107 states have (on average 1.3271028037383177) internal successors, (142), 128 states have internal predecessors, (142), 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-21 18:18:53,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 142 transitions. [2021-12-21 18:18:53,422 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 142 transitions. Word has length 29 [2021-12-21 18:18:53,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:18:53,422 INFO L470 AbstractCegarLoop]: Abstraction has 129 states and 142 transitions. [2021-12-21 18:18:53,422 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-21 18:18:53,422 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 142 transitions. [2021-12-21 18:18:53,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-21 18:18:53,423 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:18:53,423 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-21 18:18:53,423 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-21 18:18:53,423 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 55 more)] === [2021-12-21 18:18:53,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:18:53,423 INFO L85 PathProgramCache]: Analyzing trace with hash 2085650723, now seen corresponding path program 1 times [2021-12-21 18:18:53,423 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:18:53,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950457942] [2021-12-21 18:18:53,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:18:53,424 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:18:53,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:18:53,630 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-21 18:18:53,630 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:18:53,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950457942] [2021-12-21 18:18:53,630 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950457942] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:18:53,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998984646] [2021-12-21 18:18:53,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:18:53,630 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:18:53,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 18:18:53,631 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-21 18:18:53,657 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-21 18:18:53,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:18:53,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 46 conjunts are in the unsatisfiable core [2021-12-21 18:18:53,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:18:53,747 INFO L387 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-21 18:18:53,798 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-12-21 18:18:53,799 INFO L387 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-21 18:18:53,821 INFO L387 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-21 18:18:53,863 INFO L387 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-21 18:18:53,976 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2021-12-21 18:18:54,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:18:54,025 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 38 [2021-12-21 18:18:54,166 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2021-12-21 18:18:54,184 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-21 18:18:54,184 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:18:54,246 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_587 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_587) |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-21 18:18:54,255 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_587 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_587) |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-21 18:18:54,261 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_586 (Array Int Int)) (v_ArrVal_587 (Array Int Int))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_586) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_587) |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-21 18:18:54,271 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:18:54,271 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2021-12-21 18:18:54,274 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 60 [2021-12-21 18:18:54,277 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2021-12-21 18:18:54,280 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2021-12-21 18:18:54,547 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-21 18:18:54,548 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2021-12-21 18:18:54,574 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-21 18:18:54,575 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [998984646] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 18:18:54,575 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 18:18:54,575 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2021-12-21 18:18:54,575 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255806558] [2021-12-21 18:18:54,575 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 18:18:54,576 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-12-21 18:18:54,576 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:18:54,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-12-21 18:18:54,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=581, Unknown=3, NotChecked=150, Total=812 [2021-12-21 18:18:54,577 INFO L87 Difference]: Start difference. First operand 129 states and 142 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-21 18:18:55,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:18:55,311 INFO L93 Difference]: Finished difference Result 175 states and 184 transitions. [2021-12-21 18:18:55,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-21 18:18:55,315 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-21 18:18:55,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:18:55,316 INFO L225 Difference]: With dead ends: 175 [2021-12-21 18:18:55,316 INFO L226 Difference]: Without dead ends: 175 [2021-12-21 18:18:55,317 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 42 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=131, Invalid=870, Unknown=3, NotChecked=186, Total=1190 [2021-12-21 18:18:55,317 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 389 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 1361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 597 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-21 18:18:55,317 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [389 Valid, 687 Invalid, 1361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 744 Invalid, 0 Unknown, 597 Unchecked, 0.4s Time] [2021-12-21 18:18:55,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2021-12-21 18:18:55,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 133. [2021-12-21 18:18:55,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 111 states have (on average 1.3153153153153154) internal successors, (146), 132 states have internal predecessors, (146), 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-21 18:18:55,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 146 transitions. [2021-12-21 18:18:55,320 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 146 transitions. Word has length 29 [2021-12-21 18:18:55,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:18:55,321 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 146 transitions. [2021-12-21 18:18:55,321 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-21 18:18:55,321 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 146 transitions. [2021-12-21 18:18:55,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-21 18:18:55,321 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:18:55,321 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-21 18:18:55,345 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-21 18:18:55,522 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-12-21 18:18:55,522 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 55 more)] === [2021-12-21 18:18:55,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:18:55,522 INFO L85 PathProgramCache]: Analyzing trace with hash 231832909, now seen corresponding path program 1 times [2021-12-21 18:18:55,522 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:18:55,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877191757] [2021-12-21 18:18:55,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:18:55,523 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:18:55,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:18:55,654 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-21 18:18:55,654 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:18:55,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877191757] [2021-12-21 18:18:55,655 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877191757] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:18:55,656 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:18:55,656 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-21 18:18:55,656 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77834446] [2021-12-21 18:18:55,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:18:55,656 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-21 18:18:55,657 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:18:55,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-21 18:18:55,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-12-21 18:18:55,657 INFO L87 Difference]: Start difference. First operand 133 states and 146 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-21 18:18:55,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:18:55,913 INFO L93 Difference]: Finished difference Result 132 states and 144 transitions. [2021-12-21 18:18:55,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-21 18:18:55,914 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-21 18:18:55,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:18:55,914 INFO L225 Difference]: With dead ends: 132 [2021-12-21 18:18:55,914 INFO L226 Difference]: Without dead ends: 132 [2021-12-21 18:18:55,914 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-21 18:18:55,915 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 227 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 18:18:55,915 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [227 Valid, 314 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 18:18:55,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2021-12-21 18:18:55,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2021-12-21 18:18:55,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 111 states have (on average 1.2972972972972974) internal successors, (144), 131 states have internal predecessors, (144), 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-21 18:18:55,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 144 transitions. [2021-12-21 18:18:55,918 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 144 transitions. Word has length 30 [2021-12-21 18:18:55,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:18:55,919 INFO L470 AbstractCegarLoop]: Abstraction has 132 states and 144 transitions. [2021-12-21 18:18:55,919 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-21 18:18:55,919 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 144 transitions. [2021-12-21 18:18:55,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-21 18:18:55,919 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:18:55,920 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-21 18:18:55,920 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-21 18:18:55,920 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 55 more)] === [2021-12-21 18:18:55,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:18:55,920 INFO L85 PathProgramCache]: Analyzing trace with hash 230663117, now seen corresponding path program 1 times [2021-12-21 18:18:55,920 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:18:55,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496828991] [2021-12-21 18:18:55,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:18:55,921 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:18:55,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:18:56,114 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-21 18:18:56,115 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:18:56,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496828991] [2021-12-21 18:18:56,115 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496828991] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:18:56,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944230180] [2021-12-21 18:18:56,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:18:56,116 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:18:56,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 18:18:56,119 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-21 18:18:56,123 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-21 18:18:56,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:18:56,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 53 conjunts are in the unsatisfiable core [2021-12-21 18:18:56,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:18:56,225 INFO L387 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-21 18:18:56,249 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 18:18:56,249 INFO L387 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-21 18:18:56,282 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-12-21 18:18:56,283 INFO L387 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-21 18:18:56,299 INFO L387 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-21 18:18:56,317 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 18:18:56,317 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2021-12-21 18:18:56,381 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2021-12-21 18:18:56,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:18:56,422 INFO L387 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-21 18:18:56,550 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:18:56,550 INFO L387 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-21 18:18:56,575 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-21 18:18:56,575 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:18:56,707 INFO L353 Elim1Store]: treesize reduction 18, result has 60.0 percent of original size [2021-12-21 18:18:56,707 INFO L387 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-21 18:18:56,714 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_710 (Array Int Int)) (v_ArrVal_709 (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_709) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_710) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0)))) is different from false [2021-12-21 18:18:56,721 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:18:56,722 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 35 [2021-12-21 18:18:56,725 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 235 treesize of output 215 [2021-12-21 18:18:56,731 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 195 treesize of output 187 [2021-12-21 18:18:56,735 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 171 [2021-12-21 18:18:56,952 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-21 18:18:56,952 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944230180] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 18:18:56,952 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 18:18:56,952 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 13] total 28 [2021-12-21 18:18:56,952 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051673523] [2021-12-21 18:18:56,952 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 18:18:56,953 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-12-21 18:18:56,953 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:18:56,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-12-21 18:18:56,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=673, Unknown=2, NotChecked=52, Total=812 [2021-12-21 18:18:56,954 INFO L87 Difference]: Start difference. First operand 132 states and 144 transitions. Second operand has 29 states, 28 states have (on average 2.357142857142857) internal successors, (66), 29 states have internal predecessors, (66), 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-21 18:18:57,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:18:57,581 INFO L93 Difference]: Finished difference Result 131 states and 143 transitions. [2021-12-21 18:18:57,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-21 18:18:57,582 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.357142857142857) internal successors, (66), 29 states have internal predecessors, (66), 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-21 18:18:57,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:18:57,582 INFO L225 Difference]: With dead ends: 131 [2021-12-21 18:18:57,582 INFO L226 Difference]: Without dead ends: 131 [2021-12-21 18:18:57,583 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=247, Invalid=1395, Unknown=2, NotChecked=78, Total=1722 [2021-12-21 18:18:57,584 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 157 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 182 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 18:18:57,584 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [157 Valid, 717 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 508 Invalid, 0 Unknown, 182 Unchecked, 0.2s Time] [2021-12-21 18:18:57,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-12-21 18:18:57,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2021-12-21 18:18:57,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 111 states have (on average 1.2882882882882882) internal successors, (143), 130 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-21 18:18:57,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 143 transitions. [2021-12-21 18:18:57,587 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 143 transitions. Word has length 30 [2021-12-21 18:18:57,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:18:57,587 INFO L470 AbstractCegarLoop]: Abstraction has 131 states and 143 transitions. [2021-12-21 18:18:57,587 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.357142857142857) internal successors, (66), 29 states have internal predecessors, (66), 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-21 18:18:57,587 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 143 transitions. [2021-12-21 18:18:57,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-21 18:18:57,587 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:18:57,588 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-21 18:18:57,613 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-21 18:18:57,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:18:57,807 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 55 more)] === [2021-12-21 18:18:57,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:18:57,808 INFO L85 PathProgramCache]: Analyzing trace with hash 823875782, now seen corresponding path program 1 times [2021-12-21 18:18:57,808 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:18:57,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345811845] [2021-12-21 18:18:57,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:18:57,808 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:18:57,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:18:58,028 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-21 18:18:58,029 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:18:58,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345811845] [2021-12-21 18:18:58,029 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345811845] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:18:58,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983171813] [2021-12-21 18:18:58,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:18:58,029 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:18:58,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 18:18:58,030 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-21 18:18:58,031 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-21 18:18:58,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:18:58,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 36 conjunts are in the unsatisfiable core [2021-12-21 18:18:58,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:18:58,177 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-21 18:18:58,178 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-21 18:18:58,251 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 18:18:58,312 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:18:58,313 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 23 [2021-12-21 18:18:58,500 INFO L387 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-21 18:18:58,511 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-21 18:18:58,512 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:18:58,701 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2021-12-21 18:18:58,703 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2021-12-21 18:18:58,710 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2021-12-21 18:18:58,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:18:58,732 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-12-21 18:18:58,782 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-21 18:18:58,782 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2021-12-21 18:18:58,797 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-21 18:18:58,797 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [983171813] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 18:18:58,797 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 18:18:58,797 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 29 [2021-12-21 18:18:58,797 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187528626] [2021-12-21 18:18:58,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 18:18:58,797 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-12-21 18:18:58,797 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:18:58,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-12-21 18:18:58,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=773, Unknown=0, NotChecked=0, Total=870 [2021-12-21 18:18:58,798 INFO L87 Difference]: Start difference. First operand 131 states and 143 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-21 18:18:59,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:18:59,395 INFO L93 Difference]: Finished difference Result 130 states and 141 transitions. [2021-12-21 18:18:59,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-21 18:18:59,395 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-21 18:18:59,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:18:59,396 INFO L225 Difference]: With dead ends: 130 [2021-12-21 18:18:59,396 INFO L226 Difference]: Without dead ends: 130 [2021-12-21 18:18:59,397 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=282, Invalid=1358, Unknown=0, NotChecked=0, Total=1640 [2021-12-21 18:18:59,397 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 325 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 57 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-21 18:18:59,397 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [325 Valid, 653 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 712 Invalid, 0 Unknown, 57 Unchecked, 0.3s Time] [2021-12-21 18:18:59,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-12-21 18:18:59,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2021-12-21 18:18:59,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 111 states have (on average 1.2702702702702702) internal successors, (141), 129 states have internal predecessors, (141), 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-21 18:18:59,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 141 transitions. [2021-12-21 18:18:59,400 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 141 transitions. Word has length 33 [2021-12-21 18:18:59,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:18:59,401 INFO L470 AbstractCegarLoop]: Abstraction has 130 states and 141 transitions. [2021-12-21 18:18:59,401 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-21 18:18:59,401 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 141 transitions. [2021-12-21 18:18:59,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-21 18:18:59,401 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:18:59,402 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-21 18:18:59,423 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-12-21 18:18:59,616 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:18:59,617 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 55 more)] === [2021-12-21 18:18:59,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:18:59,617 INFO L85 PathProgramCache]: Analyzing trace with hash 823444806, now seen corresponding path program 1 times [2021-12-21 18:18:59,617 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:18:59,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404118458] [2021-12-21 18:18:59,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:18:59,618 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:18:59,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:18:59,826 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-21 18:18:59,826 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:18:59,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404118458] [2021-12-21 18:18:59,826 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404118458] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:18:59,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889914450] [2021-12-21 18:18:59,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:18:59,827 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:18:59,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 18:18:59,828 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-21 18:18:59,835 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-21 18:18:59,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:18:59,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 45 conjunts are in the unsatisfiable core [2021-12-21 18:18:59,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:18:59,958 INFO L387 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-21 18:18:59,985 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 18:18:59,985 INFO L387 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-21 18:19:00,050 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-12-21 18:19:00,050 INFO L387 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-21 18:19:00,066 INFO L387 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-21 18:19:00,089 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 18:19:00,089 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2021-12-21 18:19:00,140 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2021-12-21 18:19:00,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:19:00,171 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2021-12-21 18:19:00,251 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:19:00,253 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 21 [2021-12-21 18:19:00,392 INFO L387 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-21 18:19:00,400 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-21 18:19:00,400 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:19:00,611 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_881 Int) (v_ArrVal_880 (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_880) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_881) 0)) 1)) (forall ((v_ArrVal_881 Int) (v_ArrVal_880 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_880) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_881) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) is different from false [2021-12-21 18:19:00,645 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| Int)) (or (and (forall ((v_ArrVal_881 Int) (v_ArrVal_880 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_880) |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_881) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (forall ((v_ArrVal_881 Int) (v_ArrVal_880 (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_880) |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_881) 0)) 1))) (not (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29|)))) is different from false [2021-12-21 18:19:00,665 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:19:00,666 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 51 [2021-12-21 18:19:00,717 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| Int)) (or (and (forall ((v_ArrVal_881 Int) (v_ArrVal_879 (Array Int Int)) (v_ArrVal_880 (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_879) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_880) |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_881) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (forall ((v_ArrVal_879 (Array Int Int)) (v_prenex_3 Int) (v_prenex_4 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_create_~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_879) |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)))) (not (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29|)))) is different from false [2021-12-21 18:19:00,728 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:19:00,729 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 47 [2021-12-21 18:19:00,731 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 243 treesize of output 235 [2021-12-21 18:19:00,745 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:19:00,745 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 273 treesize of output 273 [2021-12-21 18:19:00,752 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 286 treesize of output 282 [2021-12-21 18:19:00,758 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 306 treesize of output 302 [2021-12-21 18:19:00,763 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 314 treesize of output 312 [2021-12-21 18:19:00,769 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 364 treesize of output 356 [2021-12-21 18:19:00,925 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-21 18:19:00,925 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889914450] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 18:19:00,926 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 18:19:00,926 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 32 [2021-12-21 18:19:00,926 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140923340] [2021-12-21 18:19:00,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 18:19:00,927 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-12-21 18:19:00,927 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:19:00,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-12-21 18:19:00,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=793, Unknown=3, NotChecked=174, Total=1056 [2021-12-21 18:19:00,928 INFO L87 Difference]: Start difference. First operand 130 states and 141 transitions. Second operand has 33 states, 32 states have (on average 2.28125) internal successors, (73), 33 states have internal predecessors, (73), 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-21 18:19:03,042 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.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| .cse0) 1) (not (= .cse1 0)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |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_~new_head~0#1.base|)) (= .cse1 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (forall ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| Int)) (or (and (forall ((v_ArrVal_881 Int) (v_ArrVal_879 (Array Int Int)) (v_ArrVal_880 (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_879) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_880) |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_881) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (forall ((v_ArrVal_879 (Array Int Int)) (v_prenex_3 Int) (v_prenex_4 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_create_~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_879) |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)))) (not (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29|)))))) is different from false [2021-12-21 18:19:03,538 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| .cse0) 1) (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (forall ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| Int)) (or (and (forall ((v_ArrVal_881 Int) (v_ArrVal_880 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_880) |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_881) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (forall ((v_ArrVal_881 Int) (v_ArrVal_880 (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_880) |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_881) 0)) 1))) (not (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29|)))) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) is different from false [2021-12-21 18:19:17,172 WARN L227 SmtUtils]: Spent 13.53s on a formula simplification. DAG size of input: 63 DAG size of output: 54 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-21 18:19:17,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:19:17,606 INFO L93 Difference]: Finished difference Result 129 states and 140 transitions. [2021-12-21 18:19:17,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-21 18:19:17,607 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.28125) internal successors, (73), 33 states have internal predecessors, (73), 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-21 18:19:17,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:19:17,607 INFO L225 Difference]: With dead ends: 129 [2021-12-21 18:19:17,607 INFO L226 Difference]: Without dead ends: 129 [2021-12-21 18:19:17,608 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=222, Invalid=1433, Unknown=5, NotChecked=410, Total=2070 [2021-12-21 18:19:17,608 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 211 mSDsluCounter, 884 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 948 SdHoareTripleChecker+Invalid, 1027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 282 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-21 18:19:17,608 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [211 Valid, 948 Invalid, 1027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 705 Invalid, 0 Unknown, 282 Unchecked, 0.3s Time] [2021-12-21 18:19:17,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2021-12-21 18:19:17,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2021-12-21 18:19:17,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 111 states have (on average 1.2612612612612613) internal successors, (140), 128 states have internal predecessors, (140), 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-21 18:19:17,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 140 transitions. [2021-12-21 18:19:17,611 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 140 transitions. Word has length 33 [2021-12-21 18:19:17,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:19:17,611 INFO L470 AbstractCegarLoop]: Abstraction has 129 states and 140 transitions. [2021-12-21 18:19:17,612 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.28125) internal successors, (73), 33 states have internal predecessors, (73), 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-21 18:19:17,612 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 140 transitions. [2021-12-21 18:19:17,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-21 18:19:17,612 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:19:17,612 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:19:17,632 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-21 18:19:17,827 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,SelfDestructingSolverStorable20 [2021-12-21 18:19:17,827 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 55 more)] === [2021-12-21 18:19:17,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:19:17,828 INFO L85 PathProgramCache]: Analyzing trace with hash -726129858, now seen corresponding path program 2 times [2021-12-21 18:19:17,828 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:19:17,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374547590] [2021-12-21 18:19:17,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:19:17,828 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:19:17,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:19:17,868 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:19:17,868 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:19:17,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374547590] [2021-12-21 18:19:17,869 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374547590] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:19:17,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756814560] [2021-12-21 18:19:17,869 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-21 18:19:17,869 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:19:17,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 18:19:17,870 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-21 18:19:17,881 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-21 18:19:17,997 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-21 18:19:17,997 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 18:19:17,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-21 18:19:18,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:19:18,055 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 18:19:18,055 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:19:18,055 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1756814560] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:19:18,056 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 18:19:18,056 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2021-12-21 18:19:18,056 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59561721] [2021-12-21 18:19:18,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:19:18,056 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 18:19:18,057 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:19:18,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 18:19:18,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-21 18:19:18,057 INFO L87 Difference]: Start difference. First operand 129 states and 140 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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-21 18:19:18,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:19:18,067 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2021-12-21 18:19:18,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 18:19:18,068 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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-21 18:19:18,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:19:18,068 INFO L225 Difference]: With dead ends: 84 [2021-12-21 18:19:18,068 INFO L226 Difference]: Without dead ends: 84 [2021-12-21 18:19:18,068 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-21 18:19:18,069 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 72 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 18:19:18,069 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 102 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 18:19:18,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-12-21 18:19:18,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2021-12-21 18:19:18,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 74 states have (on average 1.1891891891891893) internal successors, (88), 83 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-21 18:19:18,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2021-12-21 18:19:18,071 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 33 [2021-12-21 18:19:18,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:19:18,072 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2021-12-21 18:19:18,072 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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-21 18:19:18,072 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2021-12-21 18:19:18,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-21 18:19:18,072 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:19:18,073 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-21 18:19:18,098 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-21 18:19:18,295 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:19:18,296 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 55 more)] === [2021-12-21 18:19:18,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:19:18,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1553624943, now seen corresponding path program 1 times [2021-12-21 18:19:18,296 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:19:18,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346053075] [2021-12-21 18:19:18,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:19:18,296 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:19:18,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:19:18,486 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-21 18:19:18,486 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:19:18,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346053075] [2021-12-21 18:19:18,486 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346053075] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:19:18,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074815967] [2021-12-21 18:19:18,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:19:18,487 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:19:18,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 18:19:18,488 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-21 18:19:18,488 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-21 18:19:18,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:19:18,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 34 conjunts are in the unsatisfiable core [2021-12-21 18:19:18,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:19:18,633 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-21 18:19:18,634 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-21 18:19:18,684 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 18:19:18,731 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:19:18,731 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2021-12-21 18:19:18,870 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-21 18:19:18,870 INFO L387 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-21 18:19:18,917 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-21 18:19:18,918 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:19:19,066 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2021-12-21 18:19:19,102 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2021-12-21 18:19:19,104 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2021-12-21 18:19:19,158 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-21 18:19:19,158 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2021-12-21 18:19:19,168 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-21 18:19:19,168 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074815967] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 18:19:19,168 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 18:19:19,168 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 29 [2021-12-21 18:19:19,168 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167263954] [2021-12-21 18:19:19,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 18:19:19,169 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-12-21 18:19:19,169 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:19:19,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-12-21 18:19:19,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=763, Unknown=0, NotChecked=0, Total=870 [2021-12-21 18:19:19,169 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand has 30 states, 29 states have (on average 2.7241379310344827) internal successors, (79), 30 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-21 18:19:19,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:19:19,622 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2021-12-21 18:19:19,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-21 18:19:19,623 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.7241379310344827) internal successors, (79), 30 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-21 18:19:19,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:19:19,623 INFO L225 Difference]: With dead ends: 82 [2021-12-21 18:19:19,623 INFO L226 Difference]: Without dead ends: 82 [2021-12-21 18:19:19,624 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=272, Invalid=1288, Unknown=0, NotChecked=0, Total=1560 [2021-12-21 18:19:19,624 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 445 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 111 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 18:19:19,624 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [445 Valid, 367 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 394 Invalid, 0 Unknown, 111 Unchecked, 0.2s Time] [2021-12-21 18:19:19,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2021-12-21 18:19:19,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2021-12-21 18:19:19,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 74 states have (on average 1.162162162162162) internal successors, (86), 81 states have internal predecessors, (86), 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-21 18:19:19,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2021-12-21 18:19:19,630 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 86 transitions. Word has length 34 [2021-12-21 18:19:19,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:19:19,631 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 86 transitions. [2021-12-21 18:19:19,632 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.7241379310344827) internal successors, (79), 30 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-21 18:19:19,632 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2021-12-21 18:19:19,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-21 18:19:19,633 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:19:19,633 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-21 18:19:19,654 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-21 18:19:19,843 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,SelfDestructingSolverStorable22 [2021-12-21 18:19:19,843 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 55 more)] === [2021-12-21 18:19:19,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:19:19,844 INFO L85 PathProgramCache]: Analyzing trace with hash 449486225, now seen corresponding path program 1 times [2021-12-21 18:19:19,844 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:19:19,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479624346] [2021-12-21 18:19:19,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:19:19,844 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:19:19,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:19:20,222 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-21 18:19:20,222 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:19:20,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479624346] [2021-12-21 18:19:20,222 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479624346] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:19:20,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1809136213] [2021-12-21 18:19:20,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:19:20,222 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:19:20,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 18:19:20,223 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-21 18:19:20,224 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-21 18:19:20,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:19:20,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 58 conjunts are in the unsatisfiable core [2021-12-21 18:19:20,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:19:20,324 INFO L387 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-21 18:19:20,356 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-21 18:19:20,356 INFO L387 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-21 18:19:20,424 INFO L353 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-12-21 18:19:20,424 INFO L387 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-21 18:19:20,461 INFO L387 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-21 18:19:20,498 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 18:19:20,498 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2021-12-21 18:19:20,569 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2021-12-21 18:19:20,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:19:20,606 INFO L387 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-21 18:19:20,839 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:19:20,839 INFO L387 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-21 18:19:20,871 INFO L387 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-21 18:19:20,879 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-21 18:19:20,879 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:19:21,109 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-12-21 18:19:21,113 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1145 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1145) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) is different from false [2021-12-21 18:19:21,121 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1145 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1145) |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|)))) is different from false [2021-12-21 18:19:21,126 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1145 (Array Int Int)) (v_ArrVal_1144 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1144) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1145) |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|)))) is different from false [2021-12-21 18:19:21,132 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:19:21,132 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2021-12-21 18:19:21,134 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 171 treesize of output 165 [2021-12-21 18:19:21,136 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 18:19:21,138 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 144 [2021-12-21 18:19:21,140 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 167 treesize of output 161 [2021-12-21 18:19:21,147 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2021-12-21 18:19:21,152 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2021-12-21 18:19:21,525 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-21 18:19:21,526 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1809136213] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 18:19:21,526 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 18:19:21,526 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 17] total 46 [2021-12-21 18:19:21,526 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224780322] [2021-12-21 18:19:21,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 18:19:21,527 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2021-12-21 18:19:21,527 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:19:21,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2021-12-21 18:19:21,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1748, Unknown=3, NotChecked=258, Total=2162 [2021-12-21 18:19:21,528 INFO L87 Difference]: Start difference. First operand 82 states and 86 transitions. Second operand has 47 states, 46 states have (on average 1.7391304347826086) internal successors, (80), 47 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-21 18:19:22,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:19:22,649 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2021-12-21 18:19:22,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-21 18:19:22,649 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 1.7391304347826086) internal successors, (80), 47 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-21 18:19:22,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:19:22,650 INFO L225 Difference]: With dead ends: 79 [2021-12-21 18:19:22,650 INFO L226 Difference]: Without dead ends: 79 [2021-12-21 18:19:22,651 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 844 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=399, Invalid=3392, Unknown=3, NotChecked=366, Total=4160 [2021-12-21 18:19:22,651 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 326 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 939 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 1302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 939 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 297 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-21 18:19:22,651 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [326 Valid, 573 Invalid, 1302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 939 Invalid, 0 Unknown, 297 Unchecked, 0.4s Time] [2021-12-21 18:19:22,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2021-12-21 18:19:22,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2021-12-21 18:19:22,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 74 states have (on average 1.1216216216216217) internal successors, (83), 78 states have internal predecessors, (83), 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-21 18:19:22,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2021-12-21 18:19:22,653 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 34 [2021-12-21 18:19:22,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:19:22,654 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2021-12-21 18:19:22,654 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 1.7391304347826086) internal successors, (80), 47 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-21 18:19:22,654 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2021-12-21 18:19:22,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-21 18:19:22,654 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:19:22,654 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-21 18:19:22,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-12-21 18:19:22,874 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,SelfDestructingSolverStorable23 [2021-12-21 18:19:22,874 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 55 more)] === [2021-12-21 18:19:22,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:19:22,875 INFO L85 PathProgramCache]: Analyzing trace with hash 449055249, now seen corresponding path program 1 times [2021-12-21 18:19:22,875 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:19:22,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940563544] [2021-12-21 18:19:22,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:19:22,875 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:19:22,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:19:23,094 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-21 18:19:23,094 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:19:23,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940563544] [2021-12-21 18:19:23,094 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940563544] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:19:23,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521326636] [2021-12-21 18:19:23,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:19:23,094 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:19:23,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 18:19:23,100 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-21 18:19:23,101 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-21 18:19:23,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:19:23,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 44 conjunts are in the unsatisfiable core [2021-12-21 18:19:23,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:19:23,229 INFO L387 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-21 18:19:23,260 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 18:19:23,260 INFO L387 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-21 18:19:23,299 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-12-21 18:19:23,299 INFO L387 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-21 18:19:23,318 INFO L387 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-21 18:19:23,353 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 18:19:23,353 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2021-12-21 18:19:23,400 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2021-12-21 18:19:23,416 INFO L353 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-21 18:19:23,417 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 27 [2021-12-21 18:19:23,516 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:19:23,517 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 16 [2021-12-21 18:19:23,622 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-21 18:19:23,622 INFO L387 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-21 18:19:23,669 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-21 18:19:23,669 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:19:23,831 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2021-12-21 18:19:24,164 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-21 18:19:24,169 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int) (v_ArrVal_1233 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1233) |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) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) is different from false [2021-12-21 18:19:24,174 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int) (v_ArrVal_1233 (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_1233) |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-21 18:19:24,185 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int) (v_ArrVal_1233 (Array Int Int)) (v_ArrVal_1232 (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_1232) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1233) |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-21 18:19:24,191 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:19:24,192 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2021-12-21 18:19:24,196 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 171 treesize of output 165 [2021-12-21 18:19:24,203 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:19:24,204 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 191 treesize of output 193 [2021-12-21 18:19:24,208 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 206 treesize of output 202 [2021-12-21 18:19:24,211 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 254 treesize of output 246 [2021-12-21 18:19:24,375 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-21 18:19:24,375 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [521326636] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 18:19:24,375 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 18:19:24,375 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 17] total 36 [2021-12-21 18:19:24,375 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709231520] [2021-12-21 18:19:24,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 18:19:24,376 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2021-12-21 18:19:24,376 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:19:24,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-12-21 18:19:24,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=956, Unknown=4, NotChecked=260, Total=1332 [2021-12-21 18:19:24,376 INFO L87 Difference]: Start difference. First operand 79 states and 83 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-21 18:19:24,883 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (forall ((|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int) (v_ArrVal_1233 (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_1233) |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.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~head~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|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) is different from false [2021-12-21 18:19:25,218 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 (not (= (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= (select .cse0 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (forall ((|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int) (v_ArrVal_1233 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1233) |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) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))))) is different from false [2021-12-21 18:19:25,555 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int) (v_ArrVal_1233 (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_1233) |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.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~head~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|)) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) is different from false [2021-12-21 18:19:25,886 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 (not (= (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= (select .cse0 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= (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) (v_ArrVal_1233 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1233) |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) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))))) is different from false [2021-12-21 18:19:26,173 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 (not (= (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= (select .cse0 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= (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)))))) is different from false [2021-12-21 18:19:26,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:19:26,489 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2021-12-21 18:19:26,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-21 18:19:26,490 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-21 18:19:26,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:19:26,490 INFO L225 Difference]: With dead ends: 78 [2021-12-21 18:19:26,490 INFO L226 Difference]: Without dead ends: 78 [2021-12-21 18:19:26,491 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=239, Invalid=1594, Unknown=9, NotChecked=810, Total=2652 [2021-12-21 18:19:26,491 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 257 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 387 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 18:19:26,491 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [257 Valid, 536 Invalid, 970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 549 Invalid, 0 Unknown, 387 Unchecked, 0.2s Time] [2021-12-21 18:19:26,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-12-21 18:19:26,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2021-12-21 18:19:26,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 74 states have (on average 1.1081081081081081) internal successors, (82), 77 states have internal predecessors, (82), 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-21 18:19:26,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2021-12-21 18:19:26,493 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 34 [2021-12-21 18:19:26,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:19:26,494 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2021-12-21 18:19:26,494 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-21 18:19:26,494 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2021-12-21 18:19:26,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-21 18:19:26,494 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:19:26,494 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-21 18:19:26,515 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-21 18:19:26,707 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,SelfDestructingSolverStorable24 [2021-12-21 18:19:26,707 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 55 more)] === [2021-12-21 18:19:26,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:19:26,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1654547908, now seen corresponding path program 1 times [2021-12-21 18:19:26,708 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:19:26,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907275633] [2021-12-21 18:19:26,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:19:26,708 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:19:26,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:19:27,137 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-21 18:19:27,137 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 18:19:27,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907275633] [2021-12-21 18:19:27,138 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907275633] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 18:19:27,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [776570651] [2021-12-21 18:19:27,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:19:27,138 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 18:19:27,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 18:19:27,139 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-21 18:19:27,139 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-21 18:19:27,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:19:27,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 53 conjunts are in the unsatisfiable core [2021-12-21 18:19:27,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:19:27,247 INFO L387 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-21 18:19:27,280 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-21 18:19:27,281 INFO L387 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-21 18:19:27,361 INFO L353 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-12-21 18:19:27,362 INFO L387 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-21 18:19:27,401 INFO L387 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-21 18:19:27,441 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 18:19:27,441 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2021-12-21 18:19:27,526 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2021-12-21 18:19:27,565 INFO L387 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-21 18:19:27,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:19:27,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:19:27,768 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:19:27,769 INFO L387 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-21 18:19:28,508 INFO L387 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-21 18:19:28,558 INFO L387 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-21 18:19:28,565 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-21 18:19:28,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:19:29,503 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (not (<= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0)) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |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 (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse0)) (not (= (select .cse1 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) .cse0)) (= (select |c_#valid| .cse0) 1)))))) is different from false [2021-12-21 18:19:30,358 INFO L353 Elim1Store]: treesize reduction 8, result has 85.5 percent of original size [2021-12-21 18:19:30,358 INFO L387 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-21 18:19:30,479 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (and (forall ((v_prenex_8 (Array Int Int)) (v_ArrVal_1321 (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_1321) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_8) |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_9 (Array Int Int)) (v_ArrVal_1321 (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_1321) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_9) |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| 4)) (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))))) (forall ((v_ArrVal_1322 (Array Int Int)) (v_ArrVal_1321 (Array Int Int))) (let ((.cse1 (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1321) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1322) |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| .cse1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1))))) (not (<= 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (not (<= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0)))) is different from false [2021-12-21 18:19:30,492 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:19:30,493 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 133 treesize of output 102 [2021-12-21 18:19:30,497 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 551 treesize of output 533 [2021-12-21 18:19:30,503 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 18:19:30,513 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:19:30,514 INFO L387 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 677 treesize of output 661 [2021-12-21 18:19:30,535 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 18:19:30,536 INFO L387 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 785 treesize of output 737 [2021-12-21 18:19:30,555 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 18:19:30,555 INFO L387 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 751 treesize of output 727 [2021-12-21 18:19:30,580 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 725 treesize of output 717 [2021-12-21 18:19:30,600 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 723 treesize of output 719 [2021-12-21 18:19:30,619 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 764 treesize of output 756 [2021-12-21 18:19:30,635 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 782 treesize of output 778 [2021-12-21 18:19:31,195 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-21 18:19:31,195 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [776570651] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 18:19:31,195 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 18:19:31,195 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 19, 19] total 54 [2021-12-21 18:19:31,195 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679912995] [2021-12-21 18:19:31,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 18:19:31,196 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2021-12-21 18:19:31,196 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 18:19:31,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2021-12-21 18:19:31,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=2570, Unknown=3, NotChecked=206, Total=2970 [2021-12-21 18:19:31,197 INFO L87 Difference]: Start difference. First operand 78 states and 82 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-21 18:19:31,884 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_~last~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) (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (and (forall ((v_prenex_8 (Array Int Int)) (v_ArrVal_1321 (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_1321) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_8) |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_9 (Array Int Int)) (v_ArrVal_1321 (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_1321) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_9) |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| 4)) (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))))) (forall ((v_ArrVal_1322 (Array Int Int)) (v_ArrVal_1321 (Array Int Int))) (let ((.cse1 (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1321) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1322) |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| .cse1) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse1))))) (not (<= 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (not (<= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0)))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~head~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|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) is different from false [2021-12-21 18:19:32,416 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (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 (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| .cse0) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (not (<= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0)) (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (let ((.cse1 (select .cse2 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))) (and (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse1)) (not (= (select .cse2 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) .cse1)) (= (select |c_#valid| .cse1) 1)))))) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) is different from false [2021-12-21 18:19:33,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:19:33,116 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2021-12-21 18:19:33,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-21 18:19:33,116 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-21 18:19:33,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:19:33,117 INFO L225 Difference]: With dead ends: 77 [2021-12-21 18:19:33,117 INFO L226 Difference]: Without dead ends: 77 [2021-12-21 18:19:33,118 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 67 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1315 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=348, Invalid=3823, Unknown=5, NotChecked=516, Total=4692 [2021-12-21 18:19:33,118 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 89 mSDsluCounter, 929 mSDsCounter, 0 mSdLazyCounter, 863 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 977 SdHoareTripleChecker+Invalid, 1335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 449 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-21 18:19:33,118 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 977 Invalid, 1335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 863 Invalid, 0 Unknown, 449 Unchecked, 0.3s Time] [2021-12-21 18:19:33,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-12-21 18:19:33,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2021-12-21 18:19:33,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 74 states have (on average 1.0945945945945945) internal successors, (81), 76 states have internal predecessors, (81), 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-21 18:19:33,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2021-12-21 18:19:33,120 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 36 [2021-12-21 18:19:33,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:19:33,121 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2021-12-21 18:19:33,121 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-21 18:19:33,121 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2021-12-21 18:19:33,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-21 18:19:33,121 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:19:33,122 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-21 18:19:33,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-12-21 18:19:33,327 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,SelfDestructingSolverStorable25 [2021-12-21 18:19:33,328 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 55 more)] === [2021-12-21 18:19:33,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:19:33,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1615055412, now seen corresponding path program 1 times [2021-12-21 18:19:33,328 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 18:19:33,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339688469] [2021-12-21 18:19:33,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:19:33,329 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 18:19:33,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 18:19:33,359 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 18:19:33,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 18:19:33,400 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 18:19:33,401 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-21 18:19:33,401 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_LEAK (58 of 59 remaining) [2021-12-21 18:19:33,403 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (57 of 59 remaining) [2021-12-21 18:19:33,403 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (56 of 59 remaining) [2021-12-21 18:19:33,403 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (55 of 59 remaining) [2021-12-21 18:19:33,403 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (54 of 59 remaining) [2021-12-21 18:19:33,403 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (53 of 59 remaining) [2021-12-21 18:19:33,403 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (52 of 59 remaining) [2021-12-21 18:19:33,404 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION (51 of 59 remaining) [2021-12-21 18:19:33,404 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION (50 of 59 remaining) [2021-12-21 18:19:33,404 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION (49 of 59 remaining) [2021-12-21 18:19:33,404 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION (48 of 59 remaining) [2021-12-21 18:19:33,404 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION (47 of 59 remaining) [2021-12-21 18:19:33,404 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION (46 of 59 remaining) [2021-12-21 18:19:33,405 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION (45 of 59 remaining) [2021-12-21 18:19:33,405 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION (44 of 59 remaining) [2021-12-21 18:19:33,405 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION (43 of 59 remaining) [2021-12-21 18:19:33,405 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION (42 of 59 remaining) [2021-12-21 18:19:33,405 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE (41 of 59 remaining) [2021-12-21 18:19:33,405 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE (40 of 59 remaining) [2021-12-21 18:19:33,406 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE (39 of 59 remaining) [2021-12-21 18:19:33,406 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE (38 of 59 remaining) [2021-12-21 18:19:33,406 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE (37 of 59 remaining) [2021-12-21 18:19:33,406 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE (36 of 59 remaining) [2021-12-21 18:19:33,406 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE (35 of 59 remaining) [2021-12-21 18:19:33,407 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE (34 of 59 remaining) [2021-12-21 18:19:33,407 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE (33 of 59 remaining) [2021-12-21 18:19:33,407 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE (32 of 59 remaining) [2021-12-21 18:19:33,407 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE (31 of 59 remaining) [2021-12-21 18:19:33,407 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE (30 of 59 remaining) [2021-12-21 18:19:33,407 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE (29 of 59 remaining) [2021-12-21 18:19:33,408 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE (28 of 59 remaining) [2021-12-21 18:19:33,408 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE (27 of 59 remaining) [2021-12-21 18:19:33,408 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE (26 of 59 remaining) [2021-12-21 18:19:33,408 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE (25 of 59 remaining) [2021-12-21 18:19:33,408 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE (24 of 59 remaining) [2021-12-21 18:19:33,408 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE (23 of 59 remaining) [2021-12-21 18:19:33,408 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE (22 of 59 remaining) [2021-12-21 18:19:33,409 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE (21 of 59 remaining) [2021-12-21 18:19:33,409 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE (20 of 59 remaining) [2021-12-21 18:19:33,409 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE (19 of 59 remaining) [2021-12-21 18:19:33,409 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE (18 of 59 remaining) [2021-12-21 18:19:33,409 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE (17 of 59 remaining) [2021-12-21 18:19:33,409 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE (16 of 59 remaining) [2021-12-21 18:19:33,410 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE (15 of 59 remaining) [2021-12-21 18:19:33,410 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE (14 of 59 remaining) [2021-12-21 18:19:33,410 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE (13 of 59 remaining) [2021-12-21 18:19:33,410 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE (12 of 59 remaining) [2021-12-21 18:19:33,410 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE (11 of 59 remaining) [2021-12-21 18:19:33,410 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE (10 of 59 remaining) [2021-12-21 18:19:33,411 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE (9 of 59 remaining) [2021-12-21 18:19:33,411 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE (8 of 59 remaining) [2021-12-21 18:19:33,411 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE (7 of 59 remaining) [2021-12-21 18:19:33,411 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE (6 of 59 remaining) [2021-12-21 18:19:33,412 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE (5 of 59 remaining) [2021-12-21 18:19:33,412 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE (4 of 59 remaining) [2021-12-21 18:19:33,412 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE (3 of 59 remaining) [2021-12-21 18:19:33,412 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE (2 of 59 remaining) [2021-12-21 18:19:33,412 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE (1 of 59 remaining) [2021-12-21 18:19:33,412 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE (0 of 59 remaining) [2021-12-21 18:19:33,413 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-12-21 18:19:33,415 INFO L732 BasicCegarLoop]: Path program histogram: [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] [2021-12-21 18:19:33,418 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-21 18:19:33,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 06:19:33 BoogieIcfgContainer [2021-12-21 18:19:33,470 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-21 18:19:33,471 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-21 18:19:33,471 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-21 18:19:33,472 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-21 18:19:33,472 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 06:18:46" (3/4) ... [2021-12-21 18:19:33,474 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-21 18:19:33,474 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-21 18:19:33,475 INFO L158 Benchmark]: Toolchain (without parser) took 47816.26ms. Allocated memory was 92.3MB in the beginning and 142.6MB in the end (delta: 50.3MB). Free memory was 56.4MB in the beginning and 84.3MB in the end (delta: -28.0MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. [2021-12-21 18:19:33,475 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 92.3MB. Free memory is still 73.8MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 18:19:33,477 INFO L158 Benchmark]: CACSL2BoogieTranslator took 326.07ms. Allocated memory is still 92.3MB. Free memory was 56.1MB in the beginning and 62.6MB in the end (delta: -6.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-21 18:19:33,477 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.07ms. Allocated memory is still 92.3MB. Free memory was 62.6MB in the beginning and 60.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-21 18:19:33,480 INFO L158 Benchmark]: Boogie Preprocessor took 54.80ms. Allocated memory is still 92.3MB. Free memory was 60.5MB in the beginning and 58.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-21 18:19:33,481 INFO L158 Benchmark]: RCFGBuilder took 464.38ms. Allocated memory is still 92.3MB. Free memory was 58.8MB in the beginning and 41.1MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2021-12-21 18:19:33,481 INFO L158 Benchmark]: TraceAbstraction took 46923.27ms. Allocated memory was 92.3MB in the beginning and 142.6MB in the end (delta: 50.3MB). Free memory was 40.4MB in the beginning and 84.3MB in the end (delta: -43.9MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. [2021-12-21 18:19:33,481 INFO L158 Benchmark]: Witness Printer took 3.25ms. Allocated memory is still 142.6MB. Free memory is still 84.3MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 18:19:33,482 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 92.3MB. Free memory is still 73.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 326.07ms. Allocated memory is still 92.3MB. Free memory was 56.1MB in the beginning and 62.6MB in the end (delta: -6.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.07ms. Allocated memory is still 92.3MB. Free memory was 62.6MB in the beginning and 60.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.80ms. Allocated memory is still 92.3MB. Free memory was 60.5MB in the beginning and 58.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 464.38ms. Allocated memory is still 92.3MB. Free memory was 58.8MB in the beginning and 41.1MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 46923.27ms. Allocated memory was 92.3MB in the beginning and 142.6MB in the end (delta: 50.3MB). Free memory was 40.4MB in the beginning and 84.3MB in the end (delta: -43.9MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. * Witness Printer took 3.25ms. Allocated memory is still 142.6MB. Free memory is still 84.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 616]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 616. Possible FailurePath: [L617] const int len = 3; [L618] CALL, EXPR dll_circular_create(len) [L564] DLL last = (DLL) malloc(sizeof(struct node)); [L565] COND FALSE !(((void *)0) == last) VAL [\old(len)=3, last={6:0}, len=3] [L568] last->next = last VAL [\old(len)=3, last={6:0}, len=3] [L569] last->prev = last VAL [\old(len)=3, last={6:0}, len=3] [L570] DLL head = last; VAL [\old(len)=3, head={6:0}, last={6:0}, len=3] [L571] COND TRUE len > 1 [L572] DLL new_head = (DLL) malloc(sizeof(struct node)); [L573] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=3, head={6:0}, last={6:0}, len=3, new_head={-2:0}] [L576] new_head->next = head VAL [\old(len)=3, head={6:0}, last={6:0}, len=3, new_head={-2:0}] [L577] head->prev = new_head VAL [\old(len)=3, head={6:0}, last={6:0}, len=3, new_head={-2:0}] [L578] head = new_head [L579] len-- VAL [\old(len)=3, head={-2:0}, last={6:0}, len=2, new_head={-2:0}] [L571] COND TRUE len > 1 [L572] DLL new_head = (DLL) malloc(sizeof(struct node)); [L573] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=3, head={-2:0}, last={6:0}, len=2, new_head={5:0}] [L576] new_head->next = head VAL [\old(len)=3, head={-2:0}, last={6:0}, len=2, new_head={5:0}] [L577] head->prev = new_head VAL [\old(len)=3, head={-2:0}, last={6:0}, len=2, new_head={5:0}] [L578] head = new_head [L579] len-- VAL [\old(len)=3, head={5:0}, last={6:0}, len=1, new_head={5:0}] [L571] COND FALSE !(len > 1) VAL [\old(len)=3, head={5:0}, last={6:0}, len=1, new_head={5:0}] [L581] last->next = head VAL [\old(len)=3, head={5:0}, last={6:0}, len=1, new_head={5:0}] [L582] head->prev = last VAL [\old(len)=3, head={5:0}, last={6:0}, len=1, new_head={5:0}] [L583] return head; VAL [\old(len)=3, \result={5:0}, head={5:0}, last={6:0}, len=1, new_head={5:0}] [L618] RET, EXPR dll_circular_create(len) [L618] DLL head = dll_circular_create(len); [L619] CALL _destroy_in_nondeterministic_order(head) [L586] EXPR head->prev VAL [head={5:0}, head={5:0}, head->prev={6:0}] [L586] DLL pred = head->prev; [L587] EXPR head->next VAL [head={5:0}, head={5:0}, head->next={-2:0}, pred={6:0}] [L587] DLL succ = head->next; [L588] COND FALSE !(__VERIFIER_nondet_int()) [L597] COND FALSE !(__VERIFIER_nondet_int()) [L607] free(pred) VAL [head={5:0}, head={5:0}, pred={6:0}, succ={-2:0}] [L607] free(pred) VAL [head={5:0}, head={5:0}, pred={6:0}, succ={-2:0}] [L607] free(pred) [L608] COND FALSE !(__VERIFIER_nondet_int()) [L612] free(head) VAL [head={5:0}, head={5:0}, pred={6:0}, succ={-2:0}] [L612] free(head) VAL [head={5:0}, head={5:0}, pred={6:0}, succ={-2:0}] [L612] free(head) [L619] RET _destroy_in_nondeterministic_order(head) [L620] head = ((void *)0) [L621] return 0; VAL [\result=0, head={0:0}, len=3] - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 569]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 569]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 576]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 576]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 577]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 577]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 581]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 581]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 582]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 582]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 586]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 586]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 587]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 587]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 591]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 591]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 591]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 592]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 592]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 592]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 594]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 594]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 594]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 595]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 595]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 595]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 598]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 598]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 598]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 600]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 600]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 600]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 601]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 601]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 601]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 603]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 603]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 603]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 604]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 604]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 604]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 607]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 607]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 607]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 609]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 609]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 609]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 610]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 610]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 610]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 612]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 612]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 612]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 134 locations, 59 error locations. Started 1 CEGAR loops. OverallTime: 46.8s, OverallIterations: 27, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 26.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6406 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6406 mSDsluCounter, 10457 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 3119 IncrementalHoareTripleChecker+Unchecked, 8395 mSDsCounter, 441 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7795 IncrementalHoareTripleChecker+Invalid, 11355 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 441 mSolverCounterUnsat, 2062 mSDtfsCounter, 7795 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1090 GetRequests, 531 SyntacticMatches, 30 SemanticMatches, 529 ConstructedPredicates, 28 IntricatePredicates, 0 DeprecatedPredicates, 4447 ImplicationChecksByTransitivity, 29.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=134occurred in iteration=15, InterpolantAutomatonStates: 245, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 26 MinimizatonAttempts, 111 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 14.8s InterpolantComputationTime, 986 NumberOfCodeBlocks, 986 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 1234 ConstructedInterpolants, 109 QuantifiedInterpolants, 12908 SizeOfPredicates, 177 NumberOfNonLiveVariables, 2685 ConjunctsInSsa, 460 ConjunctsInUnsatCore, 51 InterpolantComputations, 14 PerfectInterpolantSequences, 90/294 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-12-21 18:19:33,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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 2f737570030041640fd86c7d2770b30b4e6ee4ac0d1c521887700aab87fb1426 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ff03de6 [2021-12-21 18:19:35,291 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 18:19:35,293 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 18:19:35,316 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 18:19:35,317 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 18:19:35,318 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 18:19:35,319 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 18:19:35,321 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 18:19:35,322 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 18:19:35,323 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 18:19:35,324 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 18:19:35,325 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 18:19:35,334 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 18:19:35,335 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 18:19:35,336 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 18:19:35,337 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 18:19:35,338 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 18:19:35,339 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 18:19:35,340 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 18:19:35,342 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 18:19:35,343 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 18:19:35,344 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 18:19:35,345 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 18:19:35,346 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 18:19:35,348 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 18:19:35,349 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 18:19:35,349 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 18:19:35,350 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 18:19:35,350 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 18:19:35,351 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 18:19:35,351 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 18:19:35,352 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 18:19:35,353 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 18:19:35,354 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 18:19:35,355 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 18:19:35,355 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 18:19:35,356 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 18:19:35,356 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 18:19:35,357 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 18:19:35,357 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 18:19:35,358 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 18:19:35,359 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-12-21 18:19:35,379 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 18:19:35,379 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 18:19:35,380 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 18:19:35,380 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 18:19:35,380 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-21 18:19:35,381 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-21 18:19:35,381 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 18:19:35,382 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 18:19:35,382 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 18:19:35,382 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 18:19:35,382 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-21 18:19:35,383 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-21 18:19:35,383 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-21 18:19:35,383 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-21 18:19:35,384 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 18:19:35,384 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-21 18:19:35,384 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-21 18:19:35,384 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-21 18:19:35,385 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-21 18:19:35,385 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-21 18:19:35,385 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-21 18:19:35,386 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-21 18:19:35,386 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-21 18:19:35,386 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 18:19:35,386 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 18:19:35,387 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 18:19:35,387 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-21 18:19:35,387 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 18:19:35,388 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 18:19:35,388 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-21 18:19:35,388 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-21 18:19:35,388 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-21 18:19:35,389 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 18:19:35,389 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-21 18:19:35,389 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> 2f737570030041640fd86c7d2770b30b4e6ee4ac0d1c521887700aab87fb1426 [2021-12-21 18:19:35,702 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 18:19:35,727 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 18:19:35,729 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 18:19:35,730 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 18:19:35,730 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 18:19:35,731 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-2.i [2021-12-21 18:19:35,781 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4009bb2cb/d6073976b92440a7a7c70fb733c521cc/FLAG9b6fa513b [2021-12-21 18:19:36,221 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 18:19:36,221 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-2.i [2021-12-21 18:19:36,232 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4009bb2cb/d6073976b92440a7a7c70fb733c521cc/FLAG9b6fa513b [2021-12-21 18:19:36,619 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4009bb2cb/d6073976b92440a7a7c70fb733c521cc [2021-12-21 18:19:36,621 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 18:19:36,622 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 18:19:36,623 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 18:19:36,624 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 18:19:36,627 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 18:19:36,628 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 06:19:36" (1/1) ... [2021-12-21 18:19:36,629 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22cb8f82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:19:36, skipping insertion in model container [2021-12-21 18:19:36,629 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 06:19:36" (1/1) ... [2021-12-21 18:19:36,639 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 18:19:36,671 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 18:19:36,938 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 18:19:36,946 INFO L203 MainTranslator]: Completed pre-run [2021-12-21 18:19:37,003 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 18:19:37,027 INFO L208 MainTranslator]: Completed translation [2021-12-21 18:19:37,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:19:37 WrapperNode [2021-12-21 18:19:37,028 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 18:19:37,029 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-21 18:19:37,030 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-21 18:19:37,030 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-21 18:19:37,042 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:19:37" (1/1) ... [2021-12-21 18:19:37,074 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:19:37" (1/1) ... [2021-12-21 18:19:37,102 INFO L137 Inliner]: procedures = 117, calls = 30, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 120 [2021-12-21 18:19:37,103 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-21 18:19:37,104 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-21 18:19:37,105 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-21 18:19:37,105 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-21 18:19:37,111 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:19:37" (1/1) ... [2021-12-21 18:19:37,112 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:19:37" (1/1) ... [2021-12-21 18:19:37,125 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:19:37" (1/1) ... [2021-12-21 18:19:37,128 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:19:37" (1/1) ... [2021-12-21 18:19:37,139 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:19:37" (1/1) ... [2021-12-21 18:19:37,146 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:19:37" (1/1) ... [2021-12-21 18:19:37,148 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:19:37" (1/1) ... [2021-12-21 18:19:37,157 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-21 18:19:37,161 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-21 18:19:37,161 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-21 18:19:37,161 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-21 18:19:37,162 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:19:37" (1/1) ... [2021-12-21 18:19:37,171 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 18:19:37,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 18:19:37,192 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-21 18:19:37,211 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-21 18:19:37,237 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2021-12-21 18:19:37,237 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2021-12-21 18:19:37,237 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-21 18:19:37,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-21 18:19:37,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-21 18:19:37,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-21 18:19:37,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-21 18:19:37,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-21 18:19:37,342 INFO L234 CfgBuilder]: Building ICFG [2021-12-21 18:19:37,343 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-21 18:19:37,401 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2021-12-21 18:19:37,761 INFO L275 CfgBuilder]: Performing block encoding [2021-12-21 18:19:37,768 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-21 18:19:37,768 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-21 18:19:37,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 06:19:37 BoogieIcfgContainer [2021-12-21 18:19:37,770 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-21 18:19:37,771 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-21 18:19:37,771 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-21 18:19:37,773 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-21 18:19:37,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 06:19:36" (1/3) ... [2021-12-21 18:19:37,774 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@732c5d50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 06:19:37, skipping insertion in model container [2021-12-21 18:19:37,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:19:37" (2/3) ... [2021-12-21 18:19:37,775 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@732c5d50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 06:19:37, skipping insertion in model container [2021-12-21 18:19:37,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 06:19:37" (3/3) ... [2021-12-21 18:19:37,776 INFO L111 eAbstractionObserver]: Analyzing ICFG dll_nondet_free_order-2.i [2021-12-21 18:19:37,783 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-21 18:19:37,783 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 59 error locations. [2021-12-21 18:19:37,824 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-21 18:19:37,831 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-21 18:19:37,832 INFO L340 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2021-12-21 18:19:37,852 INFO L276 IsEmpty]: Start isEmpty. Operand has 133 states, 71 states have (on average 1.9577464788732395) internal successors, (139), 131 states have internal predecessors, (139), 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-21 18:19:37,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-12-21 18:19:37,858 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:19:37,858 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-12-21 18:19:37,859 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 55 more)] === [2021-12-21 18:19:37,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:19:37,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1079622, now seen corresponding path program 1 times [2021-12-21 18:19:37,873 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:19:37,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [700428830] [2021-12-21 18:19:37,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:19:37,875 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:19:37,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:19:37,878 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-21 18:19:37,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-21 18:19:37,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:19:37,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-21 18:19:37,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:19:37,997 INFO L387 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-21 18:19:38,015 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-21 18:19:38,015 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:19:38,016 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:19:38,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [700428830] [2021-12-21 18:19:38,017 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [700428830] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:19:38,017 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:19:38,017 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 18:19:38,019 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165568462] [2021-12-21 18:19:38,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:19:38,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 18:19:38,023 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:19:38,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 18:19:38,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 18:19:38,048 INFO L87 Difference]: Start difference. First operand has 133 states, 71 states have (on average 1.9577464788732395) internal successors, (139), 131 states have internal predecessors, (139), 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-21 18:19:38,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:19:38,192 INFO L93 Difference]: Finished difference Result 130 states and 137 transitions. [2021-12-21 18:19:38,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 18:19:38,194 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-21 18:19:38,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:19:38,208 INFO L225 Difference]: With dead ends: 130 [2021-12-21 18:19:38,208 INFO L226 Difference]: Without dead ends: 124 [2021-12-21 18:19:38,209 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-21 18:19:38,212 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 50 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 18:19:38,213 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 165 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 18:19:38,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2021-12-21 18:19:38,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2021-12-21 18:19:38,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 68 states have (on average 1.8970588235294117) 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-21 18:19:38,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 129 transitions. [2021-12-21 18:19:38,255 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 129 transitions. Word has length 4 [2021-12-21 18:19:38,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:19:38,256 INFO L470 AbstractCegarLoop]: Abstraction has 124 states and 129 transitions. [2021-12-21 18:19:38,256 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-21 18:19:38,256 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 129 transitions. [2021-12-21 18:19:38,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-12-21 18:19:38,260 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:19:38,260 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-12-21 18:19:38,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-21 18:19:38,469 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:19:38,469 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 55 more)] === [2021-12-21 18:19:38,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:19:38,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1079623, now seen corresponding path program 1 times [2021-12-21 18:19:38,470 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:19:38,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1926246472] [2021-12-21 18:19:38,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:19:38,471 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:19:38,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:19:38,472 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-21 18:19:38,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-21 18:19:38,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:19:38,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-21 18:19:38,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:19:38,521 INFO L387 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-21 18:19:38,541 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-21 18:19:38,541 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:19:38,541 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:19:38,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1926246472] [2021-12-21 18:19:38,541 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1926246472] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:19:38,542 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:19:38,542 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 18:19:38,542 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304700197] [2021-12-21 18:19:38,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:19:38,548 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 18:19:38,549 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:19:38,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 18:19:38,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 18:19:38,551 INFO L87 Difference]: Start difference. First operand 124 states and 129 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-21 18:19:38,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:19:38,612 INFO L93 Difference]: Finished difference Result 121 states and 126 transitions. [2021-12-21 18:19:38,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 18:19:38,615 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-21 18:19:38,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:19:38,617 INFO L225 Difference]: With dead ends: 121 [2021-12-21 18:19:38,617 INFO L226 Difference]: Without dead ends: 121 [2021-12-21 18:19:38,617 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-21 18:19:38,618 INFO L933 BasicCegarLoop]: 110 mSDtfsCounter, 122 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 111 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.1s IncrementalHoareTripleChecker+Time [2021-12-21 18:19:38,619 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 111 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 18:19:38,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-12-21 18:19:38,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2021-12-21 18:19:38,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 68 states have (on average 1.8529411764705883) internal successors, (126), 120 states have internal predecessors, (126), 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-21 18:19:38,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 126 transitions. [2021-12-21 18:19:38,637 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 126 transitions. Word has length 4 [2021-12-21 18:19:38,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:19:38,638 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 126 transitions. [2021-12-21 18:19:38,638 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-21 18:19:38,639 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 126 transitions. [2021-12-21 18:19:38,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-21 18:19:38,640 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:19:38,640 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:19:38,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-21 18:19:38,845 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:19:38,846 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 55 more)] === [2021-12-21 18:19:38,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:19:38,847 INFO L85 PathProgramCache]: Analyzing trace with hash 2065247192, now seen corresponding path program 1 times [2021-12-21 18:19:38,847 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:19:38,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [570275822] [2021-12-21 18:19:38,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:19:38,848 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:19:38,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:19:38,850 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-21 18:19:38,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-21 18:19:38,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:19:38,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-21 18:19:38,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:19:38,949 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-21 18:19:38,950 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:19:38,950 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:19:38,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [570275822] [2021-12-21 18:19:38,951 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [570275822] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:19:38,951 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:19:38,951 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 18:19:38,951 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277845383] [2021-12-21 18:19:38,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:19:38,952 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 18:19:38,952 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:19:38,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 18:19:38,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 18:19:38,953 INFO L87 Difference]: Start difference. First operand 121 states and 126 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-21 18:19:38,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:19:38,966 INFO L93 Difference]: Finished difference Result 130 states and 135 transitions. [2021-12-21 18:19:38,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 18:19:38,967 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-21 18:19:38,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:19:38,968 INFO L225 Difference]: With dead ends: 130 [2021-12-21 18:19:38,968 INFO L226 Difference]: Without dead ends: 130 [2021-12-21 18:19:38,969 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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-21 18:19:38,970 INFO L933 BasicCegarLoop]: 124 mSDtfsCounter, 8 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 242 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-21 18:19:38,970 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 242 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 18:19:38,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-12-21 18:19:38,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 122. [2021-12-21 18:19:38,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 69 states have (on average 1.8405797101449275) internal successors, (127), 121 states have internal predecessors, (127), 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-21 18:19:38,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 127 transitions. [2021-12-21 18:19:38,978 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 127 transitions. Word has length 9 [2021-12-21 18:19:38,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:19:38,978 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 127 transitions. [2021-12-21 18:19:38,979 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-21 18:19:38,979 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 127 transitions. [2021-12-21 18:19:38,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-21 18:19:38,979 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:19:38,980 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:19:38,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-12-21 18:19:39,188 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:19:39,189 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 55 more)] === [2021-12-21 18:19:39,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:19:39,189 INFO L85 PathProgramCache]: Analyzing trace with hash 2065248729, now seen corresponding path program 1 times [2021-12-21 18:19:39,190 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:19:39,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2098168671] [2021-12-21 18:19:39,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:19:39,190 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:19:39,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:19:39,191 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-21 18:19:39,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-21 18:19:39,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:19:39,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-21 18:19:39,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:19:39,260 INFO L387 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-21 18:19:39,266 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-21 18:19:39,267 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:19:39,267 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:19:39,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2098168671] [2021-12-21 18:19:39,267 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2098168671] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:19:39,268 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:19:39,268 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 18:19:39,268 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617058659] [2021-12-21 18:19:39,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:19:39,268 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 18:19:39,269 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:19:39,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 18:19:39,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 18:19:39,269 INFO L87 Difference]: Start difference. First operand 122 states and 127 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-21 18:19:39,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:19:39,358 INFO L93 Difference]: Finished difference Result 121 states and 126 transitions. [2021-12-21 18:19:39,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 18:19:39,358 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-21 18:19:39,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:19:39,359 INFO L225 Difference]: With dead ends: 121 [2021-12-21 18:19:39,360 INFO L226 Difference]: Without dead ends: 121 [2021-12-21 18:19:39,360 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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-21 18:19:39,361 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 40 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 18:19:39,361 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 159 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 18:19:39,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-12-21 18:19:39,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2021-12-21 18:19:39,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 69 states have (on average 1.826086956521739) internal successors, (126), 120 states have internal predecessors, (126), 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-21 18:19:39,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 126 transitions. [2021-12-21 18:19:39,376 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 126 transitions. Word has length 9 [2021-12-21 18:19:39,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:19:39,376 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 126 transitions. [2021-12-21 18:19:39,376 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-21 18:19:39,376 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 126 transitions. [2021-12-21 18:19:39,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-21 18:19:39,377 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:19:39,377 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:19:39,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-12-21 18:19:39,577 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:19:39,578 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 55 more)] === [2021-12-21 18:19:39,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:19:39,578 INFO L85 PathProgramCache]: Analyzing trace with hash 2065248730, now seen corresponding path program 1 times [2021-12-21 18:19:39,579 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:19:39,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1959033863] [2021-12-21 18:19:39,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:19:39,579 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:19:39,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:19:39,580 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-21 18:19:39,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-21 18:19:39,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:19:39,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-21 18:19:39,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:19:39,654 INFO L387 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-21 18:19:39,678 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-21 18:19:39,678 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:19:39,678 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:19:39,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1959033863] [2021-12-21 18:19:39,679 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1959033863] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:19:39,679 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:19:39,679 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 18:19:39,679 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831529772] [2021-12-21 18:19:39,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:19:39,680 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 18:19:39,680 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:19:39,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 18:19:39,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 18:19:39,681 INFO L87 Difference]: Start difference. First operand 121 states and 126 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-21 18:19:39,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:19:39,727 INFO L93 Difference]: Finished difference Result 120 states and 125 transitions. [2021-12-21 18:19:39,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 18:19:39,728 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-21 18:19:39,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:19:39,729 INFO L225 Difference]: With dead ends: 120 [2021-12-21 18:19:39,729 INFO L226 Difference]: Without dead ends: 120 [2021-12-21 18:19:39,729 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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-21 18:19:39,730 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 116 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 115 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-21 18:19:39,730 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 115 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 18:19:39,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-12-21 18:19:39,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2021-12-21 18:19:39,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 69 states have (on average 1.8115942028985508) internal successors, (125), 119 states have internal predecessors, (125), 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-21 18:19:39,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 125 transitions. [2021-12-21 18:19:39,736 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 125 transitions. Word has length 9 [2021-12-21 18:19:39,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:19:39,736 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 125 transitions. [2021-12-21 18:19:39,736 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-21 18:19:39,736 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 125 transitions. [2021-12-21 18:19:39,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-21 18:19:39,737 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:19:39,737 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:19:39,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-12-21 18:19:39,945 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:19:39,945 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 55 more)] === [2021-12-21 18:19:39,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:19:39,946 INFO L85 PathProgramCache]: Analyzing trace with hash -401798830, now seen corresponding path program 1 times [2021-12-21 18:19:39,946 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:19:39,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [926431663] [2021-12-21 18:19:39,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:19:39,947 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:19:39,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:19:39,948 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-21 18:19:39,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-21 18:19:39,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:19:39,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-21 18:19:40,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:19:40,008 INFO L387 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-21 18:19:40,064 INFO L353 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-12-21 18:19:40,065 INFO L387 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 17 [2021-12-21 18:19:40,095 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-21 18:19:40,095 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:19:40,095 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:19:40,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [926431663] [2021-12-21 18:19:40,096 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [926431663] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:19:40,096 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:19:40,097 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 18:19:40,097 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852305928] [2021-12-21 18:19:40,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:19:40,097 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 18:19:40,097 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:19:40,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 18:19:40,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 18:19:40,098 INFO L87 Difference]: Start difference. First operand 120 states and 125 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-21 18:19:40,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:19:40,232 INFO L93 Difference]: Finished difference Result 124 states and 129 transitions. [2021-12-21 18:19:40,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 18:19:40,232 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-21 18:19:40,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:19:40,233 INFO L225 Difference]: With dead ends: 124 [2021-12-21 18:19:40,233 INFO L226 Difference]: Without dead ends: 124 [2021-12-21 18:19:40,233 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-21 18:19:40,234 INFO L933 BasicCegarLoop]: 101 mSDtfsCounter, 76 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 18:19:40,234 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 205 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 18:19:40,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2021-12-21 18:19:40,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2021-12-21 18:19:40,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 72 states have (on average 1.7916666666666667) internal successors, (129), 122 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-21 18:19:40,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 129 transitions. [2021-12-21 18:19:40,240 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 129 transitions. Word has length 10 [2021-12-21 18:19:40,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:19:40,240 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 129 transitions. [2021-12-21 18:19:40,240 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-21 18:19:40,240 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 129 transitions. [2021-12-21 18:19:40,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-21 18:19:40,241 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:19:40,241 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:19:40,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-12-21 18:19:40,449 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:19:40,449 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 55 more)] === [2021-12-21 18:19:40,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:19:40,450 INFO L85 PathProgramCache]: Analyzing trace with hash -401798829, now seen corresponding path program 1 times [2021-12-21 18:19:40,450 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:19:40,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [207610277] [2021-12-21 18:19:40,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:19:40,450 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:19:40,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:19:40,451 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-21 18:19:40,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-21 18:19:40,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:19:40,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-21 18:19:40,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:19:40,532 INFO L387 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-21 18:19:40,537 INFO L387 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-21 18:19:40,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:19:40,625 INFO L387 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-21 18:19:40,634 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-21 18:19:40,635 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-21 18:19:40,661 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-21 18:19:40,661 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:19:40,661 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:19:40,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [207610277] [2021-12-21 18:19:40,662 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [207610277] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:19:40,662 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:19:40,662 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 18:19:40,662 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503516435] [2021-12-21 18:19:40,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:19:40,662 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-21 18:19:40,662 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:19:40,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 18:19:40,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-21 18:19:40,663 INFO L87 Difference]: Start difference. First operand 123 states and 129 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 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-21 18:19:40,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:19:40,801 INFO L93 Difference]: Finished difference Result 124 states and 129 transitions. [2021-12-21 18:19:40,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 18:19:40,802 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 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-21 18:19:40,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:19:40,803 INFO L225 Difference]: With dead ends: 124 [2021-12-21 18:19:40,803 INFO L226 Difference]: Without dead ends: 124 [2021-12-21 18:19:40,803 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-21 18:19:40,804 INFO L933 BasicCegarLoop]: 99 mSDtfsCounter, 49 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 18:19:40,804 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 246 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 18:19:40,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2021-12-21 18:19:40,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2021-12-21 18:19:40,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 72 states have (on average 1.7777777777777777) internal successors, (128), 122 states have internal predecessors, (128), 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-21 18:19:40,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 128 transitions. [2021-12-21 18:19:40,808 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 128 transitions. Word has length 10 [2021-12-21 18:19:40,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:19:40,808 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 128 transitions. [2021-12-21 18:19:40,808 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 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-21 18:19:40,809 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 128 transitions. [2021-12-21 18:19:40,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-21 18:19:40,809 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:19:40,809 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:19:40,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-12-21 18:19:41,017 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:19:41,018 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 55 more)] === [2021-12-21 18:19:41,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:19:41,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1662359483, now seen corresponding path program 1 times [2021-12-21 18:19:41,018 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:19:41,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1180652453] [2021-12-21 18:19:41,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:19:41,019 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:19:41,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:19:41,020 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-21 18:19:41,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-21 18:19:41,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:19:41,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-21 18:19:41,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:19:41,120 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-21 18:19:41,120 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:19:41,175 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-21 18:19:41,175 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:19:41,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1180652453] [2021-12-21 18:19:41,176 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1180652453] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 18:19:41,176 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 18:19:41,176 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-12-21 18:19:41,176 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298788880] [2021-12-21 18:19:41,176 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 18:19:41,176 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 18:19:41,177 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:19:41,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 18:19:41,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-21 18:19:41,177 INFO L87 Difference]: Start difference. First operand 123 states and 128 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:19:41,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:19:41,196 INFO L93 Difference]: Finished difference Result 131 states and 136 transitions. [2021-12-21 18:19:41,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 18:19:41,196 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-12-21 18:19:41,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:19:41,197 INFO L225 Difference]: With dead ends: 131 [2021-12-21 18:19:41,197 INFO L226 Difference]: Without dead ends: 131 [2021-12-21 18:19:41,197 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-12-21 18:19:41,198 INFO L933 BasicCegarLoop]: 125 mSDtfsCounter, 19 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 18:19:41,198 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 472 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 18:19:41,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-12-21 18:19:41,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 125. [2021-12-21 18:19:41,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 74 states have (on average 1.7567567567567568) internal successors, (130), 124 states have internal predecessors, (130), 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-21 18:19:41,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 130 transitions. [2021-12-21 18:19:41,202 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 130 transitions. Word has length 14 [2021-12-21 18:19:41,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:19:41,203 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 130 transitions. [2021-12-21 18:19:41,203 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:19:41,203 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 130 transitions. [2021-12-21 18:19:41,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-21 18:19:41,203 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:19:41,204 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:19:41,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-12-21 18:19:41,412 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:19:41,413 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 55 more)] === [2021-12-21 18:19:41,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:19:41,413 INFO L85 PathProgramCache]: Analyzing trace with hash 6511237, now seen corresponding path program 1 times [2021-12-21 18:19:41,413 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:19:41,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1358481036] [2021-12-21 18:19:41,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:19:41,414 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:19:41,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:19:41,414 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-21 18:19:41,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-12-21 18:19:41,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:19:41,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-21 18:19:41,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:19:41,509 INFO L387 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-21 18:19:41,548 INFO L353 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-12-21 18:19:41,548 INFO L387 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 17 [2021-12-21 18:19:41,562 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-21 18:19:41,562 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:19:41,610 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-21 18:19:41,611 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:19:41,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1358481036] [2021-12-21 18:19:41,611 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1358481036] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 18:19:41,611 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 18:19:41,611 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2021-12-21 18:19:41,611 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286998815] [2021-12-21 18:19:41,611 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 18:19:41,611 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 18:19:41,612 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:19:41,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 18:19:41,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 18:19:41,612 INFO L87 Difference]: Start difference. First operand 125 states and 130 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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-21 18:19:41,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:19:41,717 INFO L93 Difference]: Finished difference Result 123 states and 128 transitions. [2021-12-21 18:19:41,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 18:19:41,718 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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-21 18:19:41,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:19:41,718 INFO L225 Difference]: With dead ends: 123 [2021-12-21 18:19:41,719 INFO L226 Difference]: Without dead ends: 123 [2021-12-21 18:19:41,719 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-21 18:19:41,719 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 68 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 18:19:41,720 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 208 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 18:19:41,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-12-21 18:19:41,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2021-12-21 18:19:41,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 74 states have (on average 1.7297297297297298) internal successors, (128), 122 states have internal predecessors, (128), 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-21 18:19:41,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 128 transitions. [2021-12-21 18:19:41,722 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 128 transitions. Word has length 15 [2021-12-21 18:19:41,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:19:41,723 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 128 transitions. [2021-12-21 18:19:41,723 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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-21 18:19:41,723 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 128 transitions. [2021-12-21 18:19:41,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-21 18:19:41,723 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:19:41,723 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:19:41,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-12-21 18:19:41,932 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:19:41,932 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 55 more)] === [2021-12-21 18:19:41,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:19:41,933 INFO L85 PathProgramCache]: Analyzing trace with hash 6511238, now seen corresponding path program 1 times [2021-12-21 18:19:41,933 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:19:41,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [721919802] [2021-12-21 18:19:41,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:19:41,933 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:19:41,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:19:41,934 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-21 18:19:41,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-12-21 18:19:42,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:19:42,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-21 18:19:42,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:19:42,089 INFO L387 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-21 18:19:42,097 INFO L387 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-21 18:19:42,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:19:42,181 INFO L387 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-21 18:19:42,190 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-21 18:19:42,190 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-21 18:19:42,225 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-21 18:19:42,225 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:19:42,587 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-21 18:19:42,587 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:19:42,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [721919802] [2021-12-21 18:19:42,587 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [721919802] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 18:19:42,587 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 18:19:42,587 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2021-12-21 18:19:42,588 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430916518] [2021-12-21 18:19:42,588 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 18:19:42,588 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-21 18:19:42,588 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:19:42,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-21 18:19:42,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-12-21 18:19:42,589 INFO L87 Difference]: Start difference. First operand 123 states and 128 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:19:42,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:19:42,763 INFO L93 Difference]: Finished difference Result 121 states and 126 transitions. [2021-12-21 18:19:42,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 18:19:42,764 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-21 18:19:42,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:19:42,764 INFO L225 Difference]: With dead ends: 121 [2021-12-21 18:19:42,764 INFO L226 Difference]: Without dead ends: 121 [2021-12-21 18:19:42,765 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-12-21 18:19:42,765 INFO L933 BasicCegarLoop]: 101 mSDtfsCounter, 277 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 69 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 18:19:42,765 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [277 Valid, 261 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 62 Invalid, 0 Unknown, 69 Unchecked, 0.1s Time] [2021-12-21 18:19:42,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-12-21 18:19:42,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2021-12-21 18:19:42,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 74 states have (on average 1.7027027027027026) internal successors, (126), 120 states have internal predecessors, (126), 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-21 18:19:42,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 126 transitions. [2021-12-21 18:19:42,768 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 126 transitions. Word has length 15 [2021-12-21 18:19:42,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:19:42,768 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 126 transitions. [2021-12-21 18:19:42,768 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 18:19:42,769 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 126 transitions. [2021-12-21 18:19:42,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-21 18:19:42,769 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:19:42,769 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:19:42,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-12-21 18:19:42,978 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:19:42,979 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 55 more)] === [2021-12-21 18:19:42,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:19:42,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1580520033, now seen corresponding path program 1 times [2021-12-21 18:19:42,980 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:19:42,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1995392080] [2021-12-21 18:19:42,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:19:42,980 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:19:42,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:19:42,981 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-21 18:19:42,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-12-21 18:19:43,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:19:43,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-21 18:19:43,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:19:43,091 INFO L387 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-21 18:19:43,137 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-21 18:19:43,137 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:19:43,137 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:19:43,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1995392080] [2021-12-21 18:19:43,138 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1995392080] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:19:43,138 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:19:43,138 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-21 18:19:43,138 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891776549] [2021-12-21 18:19:43,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:19:43,138 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 18:19:43,138 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:19:43,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 18:19:43,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-21 18:19:43,139 INFO L87 Difference]: Start difference. First operand 121 states and 126 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-21 18:19:43,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:19:43,348 INFO L93 Difference]: Finished difference Result 118 states and 123 transitions. [2021-12-21 18:19:43,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 18:19:43,349 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-21 18:19:43,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:19:43,350 INFO L225 Difference]: With dead ends: 118 [2021-12-21 18:19:43,350 INFO L226 Difference]: Without dead ends: 118 [2021-12-21 18:19:43,350 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 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-21 18:19:43,351 INFO L933 BasicCegarLoop]: 98 mSDtfsCounter, 106 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 18:19:43,351 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 303 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 18:19:43,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-12-21 18:19:43,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2021-12-21 18:19:43,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 74 states have (on average 1.662162162162162) internal successors, (123), 117 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-21 18:19:43,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 123 transitions. [2021-12-21 18:19:43,353 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 123 transitions. Word has length 22 [2021-12-21 18:19:43,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:19:43,353 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 123 transitions. [2021-12-21 18:19:43,353 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-21 18:19:43,353 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 123 transitions. [2021-12-21 18:19:43,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-21 18:19:43,354 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:19:43,354 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 18:19:43,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-12-21 18:19:43,554 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:19:43,554 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 55 more)] === [2021-12-21 18:19:43,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:19:43,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1580520034, now seen corresponding path program 1 times [2021-12-21 18:19:43,555 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:19:43,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [567512958] [2021-12-21 18:19:43,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:19:43,555 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:19:43,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:19:43,556 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-21 18:19:43,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-12-21 18:19:43,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:19:43,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-21 18:19:43,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:19:43,686 INFO L387 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-21 18:19:43,782 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-21 18:19:43,782 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:19:43,783 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:19:43,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [567512958] [2021-12-21 18:19:43,783 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [567512958] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:19:43,783 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:19:43,783 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-21 18:19:43,783 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160842044] [2021-12-21 18:19:43,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:19:43,783 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 18:19:43,783 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:19:43,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 18:19:43,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-21 18:19:43,784 INFO L87 Difference]: Start difference. First operand 118 states and 123 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-21 18:19:43,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:19:43,958 INFO L93 Difference]: Finished difference Result 111 states and 116 transitions. [2021-12-21 18:19:43,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 18:19:43,959 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-21 18:19:43,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:19:43,960 INFO L225 Difference]: With dead ends: 111 [2021-12-21 18:19:43,960 INFO L226 Difference]: Without dead ends: 111 [2021-12-21 18:19:43,960 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 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-21 18:19:43,963 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 388 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 89 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-21 18:19:43,963 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [388 Valid, 89 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 18:19:43,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-12-21 18:19:43,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2021-12-21 18:19:43,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 74 states have (on average 1.5675675675675675) internal successors, (116), 110 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-21 18:19:43,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 116 transitions. [2021-12-21 18:19:43,965 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 116 transitions. Word has length 22 [2021-12-21 18:19:43,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:19:43,966 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 116 transitions. [2021-12-21 18:19:43,966 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-21 18:19:43,966 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 116 transitions. [2021-12-21 18:19:43,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-21 18:19:43,966 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:19:43,966 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-21 18:19:43,975 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Ended with exit code 0 [2021-12-21 18:19:44,171 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:19:44,171 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 55 more)] === [2021-12-21 18:19:44,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:19:44,172 INFO L85 PathProgramCache]: Analyzing trace with hash 67241285, now seen corresponding path program 1 times [2021-12-21 18:19:44,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:19:44,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1949710512] [2021-12-21 18:19:44,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:19:44,173 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:19:44,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:19:44,174 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-21 18:19:44,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-12-21 18:19:44,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:19:44,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-21 18:19:44,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:19:44,674 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-21 18:19:44,675 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:19:44,675 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:19:44,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1949710512] [2021-12-21 18:19:44,675 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1949710512] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:19:44,675 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:19:44,675 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 18:19:44,675 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873906698] [2021-12-21 18:19:44,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:19:44,676 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-21 18:19:44,676 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:19:44,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-21 18:19:44,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-21 18:19:44,676 INFO L87 Difference]: Start difference. First operand 111 states and 116 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 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-21 18:19:44,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:19:44,703 INFO L93 Difference]: Finished difference Result 110 states and 115 transitions. [2021-12-21 18:19:44,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-21 18:19:44,703 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 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-21 18:19:44,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:19:44,704 INFO L225 Difference]: With dead ends: 110 [2021-12-21 18:19:44,704 INFO L226 Difference]: Without dead ends: 110 [2021-12-21 18:19:44,705 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-21 18:19:44,705 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 67 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 18:19:44,705 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 206 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 17 Invalid, 0 Unknown, 76 Unchecked, 0.0s Time] [2021-12-21 18:19:44,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-12-21 18:19:44,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2021-12-21 18:19:44,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 74 states have (on average 1.554054054054054) internal successors, (115), 109 states have internal predecessors, (115), 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-21 18:19:44,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 115 transitions. [2021-12-21 18:19:44,708 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 115 transitions. Word has length 28 [2021-12-21 18:19:44,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:19:44,708 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 115 transitions. [2021-12-21 18:19:44,708 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 7 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-21 18:19:44,708 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 115 transitions. [2021-12-21 18:19:44,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-21 18:19:44,709 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:19:44,709 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-21 18:19:44,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-12-21 18:19:44,918 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:19:44,918 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 55 more)] === [2021-12-21 18:19:44,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:19:44,919 INFO L85 PathProgramCache]: Analyzing trace with hash 67280267, now seen corresponding path program 1 times [2021-12-21 18:19:44,919 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:19:44,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1632847983] [2021-12-21 18:19:44,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:19:44,919 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:19:44,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:19:44,920 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-21 18:19:44,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-12-21 18:19:45,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:19:45,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-21 18:19:45,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:19:45,103 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-21 18:19:45,155 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-21 18:19:45,183 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-21 18:19:45,183 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 18:19:45,183 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 18:19:45,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1632847983] [2021-12-21 18:19:45,184 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1632847983] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 18:19:45,184 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 18:19:45,184 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-21 18:19:45,184 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141029001] [2021-12-21 18:19:45,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 18:19:45,184 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-21 18:19:45,184 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 18:19:45,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-21 18:19:45,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-12-21 18:19:45,185 INFO L87 Difference]: Start difference. First operand 110 states and 115 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 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-21 18:19:45,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 18:19:45,476 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2021-12-21 18:19:45,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-21 18:19:45,476 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 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-21 18:19:45,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 18:19:45,477 INFO L225 Difference]: With dead ends: 105 [2021-12-21 18:19:45,477 INFO L226 Difference]: Without dead ends: 105 [2021-12-21 18:19:45,477 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2021-12-21 18:19:45,477 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 532 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 18:19:45,477 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [532 Valid, 144 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 18:19:45,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-12-21 18:19:45,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2021-12-21 18:19:45,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 74 states have (on average 1.4864864864864864) internal successors, (110), 104 states have internal predecessors, (110), 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-21 18:19:45,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 110 transitions. [2021-12-21 18:19:45,479 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 110 transitions. Word has length 28 [2021-12-21 18:19:45,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 18:19:45,480 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 110 transitions. [2021-12-21 18:19:45,480 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 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-21 18:19:45,480 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2021-12-21 18:19:45,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-21 18:19:45,480 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 18:19:45,480 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-21 18:19:45,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-12-21 18:19:45,687 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-21 18:19:45,687 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 55 more)] === [2021-12-21 18:19:45,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 18:19:45,688 INFO L85 PathProgramCache]: Analyzing trace with hash 67279051, now seen corresponding path program 1 times [2021-12-21 18:19:45,688 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 18:19:45,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [269845764] [2021-12-21 18:19:45,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 18:19:45,688 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 18:19:45,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 18:19:45,689 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-21 18:19:45,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-12-21 18:19:45,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 18:19:45,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 32 conjunts are in the unsatisfiable core [2021-12-21 18:19:45,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 18:19:45,834 INFO L387 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-21 18:19:45,928 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-12-21 18:19:45,929 INFO L387 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 22 treesize of output 24 [2021-12-21 18:19:45,986 INFO L387 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-21 18:19:46,019 INFO L387 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-21 18:19:46,082 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-21 18:19:46,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 18:19:46,112 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-21 18:19:46,186 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-21 18:19:46,224 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-21 18:19:46,225 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 18:19:46,339 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_370 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_370) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (_ bv0 32))) is different from false [2021-12-21 18:19:46,362 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_370 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_370) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (_ bv0 32))) is different from false [2021-12-21 18:19:46,370 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_368 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_370 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_368) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_370) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (_ bv0 32))) is different from false [2021-12-21 18:19:46,390 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 18:19:46,390 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2021-12-21 18:19:46,394 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2021-12-21 18:19:46,416 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2021-12-21 18:19:46,420 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20