./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/dll2n_update_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version ae007674 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-simple/dll2n_update_all_reverse.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 cab0e4c46b209be0775136f8613c1e239028ef0244464c17ac04057ecb0a0b33 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ae00767 [2021-12-28 06:02:24,508 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-28 06:02:24,510 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-28 06:02:24,540 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-28 06:02:24,540 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-28 06:02:24,543 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-28 06:02:24,544 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-28 06:02:24,548 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-28 06:02:24,550 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-28 06:02:24,553 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-28 06:02:24,554 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-28 06:02:24,555 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-28 06:02:24,556 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-28 06:02:24,557 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-28 06:02:24,558 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-28 06:02:24,562 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-28 06:02:24,563 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-28 06:02:24,564 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-28 06:02:24,566 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-28 06:02:24,570 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-28 06:02:24,571 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-28 06:02:24,572 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-28 06:02:24,573 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-28 06:02:24,574 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-28 06:02:24,579 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-28 06:02:24,579 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-28 06:02:24,579 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-28 06:02:24,580 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-28 06:02:24,581 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-28 06:02:24,597 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-28 06:02:24,597 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-28 06:02:24,598 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-28 06:02:24,599 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-28 06:02:24,600 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-28 06:02:24,601 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-28 06:02:24,601 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-28 06:02:24,601 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-28 06:02:24,602 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-28 06:02:24,602 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-28 06:02:24,602 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-28 06:02:24,603 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-28 06:02:24,605 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-28 06:02:24,627 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-28 06:02:24,628 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-28 06:02:24,628 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-28 06:02:24,629 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-28 06:02:24,629 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-28 06:02:24,629 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-28 06:02:24,630 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-28 06:02:24,631 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-28 06:02:24,631 INFO L138 SettingsManager]: * Use SBE=true [2021-12-28 06:02:24,631 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-28 06:02:24,632 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-28 06:02:24,632 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-28 06:02:24,632 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-28 06:02:24,632 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-28 06:02:24,632 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-28 06:02:24,632 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-28 06:02:24,633 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-28 06:02:24,633 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-28 06:02:24,633 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-28 06:02:24,633 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-28 06:02:24,633 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-28 06:02:24,633 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-28 06:02:24,634 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-28 06:02:24,634 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-28 06:02:24,634 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-28 06:02:24,634 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 06:02:24,634 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-28 06:02:24,635 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-28 06:02:24,635 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-28 06:02:24,635 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-28 06:02:24,635 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 -> cab0e4c46b209be0775136f8613c1e239028ef0244464c17ac04057ecb0a0b33 [2021-12-28 06:02:24,912 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-28 06:02:24,933 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-28 06:02:24,935 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-28 06:02:24,936 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-28 06:02:24,936 INFO L275 PluginConnector]: CDTParser initialized [2021-12-28 06:02:24,938 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_update_all_reverse.i [2021-12-28 06:02:24,988 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ceeaa416c/b432f72a37da4e7c9257424b8058593d/FLAGfd9e07e2b [2021-12-28 06:02:25,423 INFO L306 CDTParser]: Found 1 translation units. [2021-12-28 06:02:25,425 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_update_all_reverse.i [2021-12-28 06:02:25,435 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ceeaa416c/b432f72a37da4e7c9257424b8058593d/FLAGfd9e07e2b [2021-12-28 06:02:25,449 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ceeaa416c/b432f72a37da4e7c9257424b8058593d [2021-12-28 06:02:25,451 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-28 06:02:25,452 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-28 06:02:25,454 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-28 06:02:25,454 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-28 06:02:25,457 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-28 06:02:25,457 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 06:02:25" (1/1) ... [2021-12-28 06:02:25,458 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c0731e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:02:25, skipping insertion in model container [2021-12-28 06:02:25,458 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 06:02:25" (1/1) ... [2021-12-28 06:02:25,463 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-28 06:02:25,497 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-28 06:02:25,739 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_update_all_reverse.i[24473,24486] [2021-12-28 06:02:25,742 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 06:02:25,750 INFO L203 MainTranslator]: Completed pre-run [2021-12-28 06:02:25,804 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_update_all_reverse.i[24473,24486] [2021-12-28 06:02:25,805 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 06:02:25,835 INFO L208 MainTranslator]: Completed translation [2021-12-28 06:02:25,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:02:25 WrapperNode [2021-12-28 06:02:25,836 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-28 06:02:25,837 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-28 06:02:25,838 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-28 06:02:25,838 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-28 06:02:25,842 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:02:25" (1/1) ... [2021-12-28 06:02:25,865 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:02:25" (1/1) ... [2021-12-28 06:02:25,886 INFO L137 Inliner]: procedures = 126, calls = 27, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 114 [2021-12-28 06:02:25,886 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-28 06:02:25,887 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-28 06:02:25,887 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-28 06:02:25,887 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-28 06:02:25,892 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:02:25" (1/1) ... [2021-12-28 06:02:25,893 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:02:25" (1/1) ... [2021-12-28 06:02:25,907 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:02:25" (1/1) ... [2021-12-28 06:02:25,907 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:02:25" (1/1) ... [2021-12-28 06:02:25,912 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:02:25" (1/1) ... [2021-12-28 06:02:25,914 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:02:25" (1/1) ... [2021-12-28 06:02:25,915 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:02:25" (1/1) ... [2021-12-28 06:02:25,917 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-28 06:02:25,918 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-28 06:02:25,918 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-28 06:02:25,918 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-28 06:02:25,919 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:02:25" (1/1) ... [2021-12-28 06:02:25,928 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 06:02:25,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:02:25,948 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-28 06:02:25,963 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-28 06:02:25,974 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2021-12-28 06:02:25,975 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2021-12-28 06:02:25,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-28 06:02:25,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-28 06:02:25,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-28 06:02:25,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-28 06:02:25,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-28 06:02:25,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-28 06:02:25,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-28 06:02:25,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-28 06:02:25,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-28 06:02:25,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-28 06:02:26,051 INFO L234 CfgBuilder]: Building ICFG [2021-12-28 06:02:26,052 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-28 06:02:26,106 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2021-12-28 06:02:26,321 INFO L275 CfgBuilder]: Performing block encoding [2021-12-28 06:02:26,325 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-28 06:02:26,326 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2021-12-28 06:02:26,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 06:02:26 BoogieIcfgContainer [2021-12-28 06:02:26,327 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-28 06:02:26,328 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-28 06:02:26,328 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-28 06:02:26,330 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-28 06:02:26,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 06:02:25" (1/3) ... [2021-12-28 06:02:26,331 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ee0adb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 06:02:26, skipping insertion in model container [2021-12-28 06:02:26,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:02:25" (2/3) ... [2021-12-28 06:02:26,331 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ee0adb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 06:02:26, skipping insertion in model container [2021-12-28 06:02:26,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 06:02:26" (3/3) ... [2021-12-28 06:02:26,332 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2n_update_all_reverse.i [2021-12-28 06:02:26,336 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-28 06:02:26,336 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 23 error locations. [2021-12-28 06:02:26,371 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-28 06:02:26,375 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-28 06:02:26,376 INFO L340 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2021-12-28 06:02:26,385 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 42 states have (on average 1.9047619047619047) internal successors, (80), 65 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:26,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-28 06:02:26,390 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:26,390 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-28 06:02:26,391 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-28 06:02:26,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:26,395 INFO L85 PathProgramCache]: Analyzing trace with hash 33471376, now seen corresponding path program 1 times [2021-12-28 06:02:26,401 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:02:26,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052007140] [2021-12-28 06:02:26,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:26,402 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:02:26,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:26,536 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-28 06:02:26,537 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:02:26,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052007140] [2021-12-28 06:02:26,537 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052007140] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:02:26,538 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 06:02:26,538 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 06:02:26,539 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962755503] [2021-12-28 06:02:26,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:02:26,542 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 06:02:26,542 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:02:26,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 06:02:26,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 06:02:26,564 INFO L87 Difference]: Start difference. First operand has 67 states, 42 states have (on average 1.9047619047619047) internal successors, (80), 65 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 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.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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-28 06:02:26,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:26,647 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2021-12-28 06:02:26,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 06:02:26,650 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2021-12-28 06:02:26,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:26,656 INFO L225 Difference]: With dead ends: 111 [2021-12-28 06:02:26,656 INFO L226 Difference]: Without dead ends: 104 [2021-12-28 06:02:26,658 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-28 06:02:26,661 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 63 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 06:02:26,675 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 136 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 06:02:26,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-12-28 06:02:26,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 59. [2021-12-28 06:02:26,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 39 states have (on average 1.6666666666666667) internal successors, (65), 58 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:26,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2021-12-28 06:02:26,698 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 5 [2021-12-28 06:02:26,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:26,698 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2021-12-28 06:02:26,698 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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-28 06:02:26,698 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2021-12-28 06:02:26,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-28 06:02:26,699 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:26,699 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-28 06:02:26,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-28 06:02:26,699 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-28 06:02:26,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:26,700 INFO L85 PathProgramCache]: Analyzing trace with hash 33471377, now seen corresponding path program 1 times [2021-12-28 06:02:26,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:02:26,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284838373] [2021-12-28 06:02:26,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:26,701 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:02:26,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:26,731 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-28 06:02:26,731 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:02:26,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284838373] [2021-12-28 06:02:26,731 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284838373] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:02:26,732 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 06:02:26,732 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 06:02:26,732 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978130066] [2021-12-28 06:02:26,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:02:26,733 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 06:02:26,733 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:02:26,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 06:02:26,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 06:02:26,734 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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-28 06:02:26,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:26,800 INFO L93 Difference]: Finished difference Result 101 states and 112 transitions. [2021-12-28 06:02:26,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 06:02:26,800 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2021-12-28 06:02:26,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:26,803 INFO L225 Difference]: With dead ends: 101 [2021-12-28 06:02:26,803 INFO L226 Difference]: Without dead ends: 101 [2021-12-28 06:02:26,804 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-28 06:02:26,805 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 58 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 06:02:26,805 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 133 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 06:02:26,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-12-28 06:02:26,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 56. [2021-12-28 06:02:26,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 39 states have (on average 1.5897435897435896) internal successors, (62), 55 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:26,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2021-12-28 06:02:26,809 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 5 [2021-12-28 06:02:26,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:26,810 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2021-12-28 06:02:26,810 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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-28 06:02:26,810 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2021-12-28 06:02:26,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-28 06:02:26,811 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:26,811 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:02:26,811 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-28 06:02:26,811 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-28 06:02:26,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:26,812 INFO L85 PathProgramCache]: Analyzing trace with hash 678997037, now seen corresponding path program 1 times [2021-12-28 06:02:26,812 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:02:26,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85213020] [2021-12-28 06:02:26,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:26,813 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:02:26,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:26,831 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-28 06:02:26,832 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:02:26,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85213020] [2021-12-28 06:02:26,832 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85213020] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:02:26,832 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 06:02:26,832 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 06:02:26,833 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680338124] [2021-12-28 06:02:26,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:02:26,833 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 06:02:26,833 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:02:26,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 06:02:26,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 06:02:26,834 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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-28 06:02:26,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:26,840 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2021-12-28 06:02:26,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 06:02:26,841 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2021-12-28 06:02:26,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:26,842 INFO L225 Difference]: With dead ends: 66 [2021-12-28 06:02:26,842 INFO L226 Difference]: Without dead ends: 66 [2021-12-28 06:02:26,842 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-28 06:02:26,843 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 10 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 118 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-28 06:02:26,844 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 118 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 06:02:26,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2021-12-28 06:02:26,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 57. [2021-12-28 06:02:26,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 40 states have (on average 1.575) internal successors, (63), 56 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-28 06:02:26,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2021-12-28 06:02:26,848 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 8 [2021-12-28 06:02:26,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:26,848 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2021-12-28 06:02:26,848 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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-28 06:02:26,848 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2021-12-28 06:02:26,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-28 06:02:26,849 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:26,849 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:02:26,849 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-28 06:02:26,849 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-28 06:02:26,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:26,850 INFO L85 PathProgramCache]: Analyzing trace with hash 638916372, now seen corresponding path program 1 times [2021-12-28 06:02:26,850 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:02:26,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279254358] [2021-12-28 06:02:26,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:26,851 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:02:26,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:26,903 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-28 06:02:26,904 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:02:26,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279254358] [2021-12-28 06:02:26,904 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279254358] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:02:26,904 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 06:02:26,904 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 06:02:26,904 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027595138] [2021-12-28 06:02:26,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:02:26,905 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 06:02:26,905 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:02:26,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 06:02:26,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 06:02:26,905 INFO L87 Difference]: Start difference. First operand 57 states and 63 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-28 06:02:26,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:26,920 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2021-12-28 06:02:26,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 06:02:26,922 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-28 06:02:26,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:26,923 INFO L225 Difference]: With dead ends: 63 [2021-12-28 06:02:26,923 INFO L226 Difference]: Without dead ends: 63 [2021-12-28 06:02:26,923 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-28 06:02:26,924 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 1 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 06:02:26,924 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 113 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 06:02:26,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-12-28 06:02:26,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2021-12-28 06:02:26,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 45 states have (on average 1.511111111111111) internal successors, (68), 61 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-28 06:02:26,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2021-12-28 06:02:26,927 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 9 [2021-12-28 06:02:26,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:26,927 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2021-12-28 06:02:26,927 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-28 06:02:26,928 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2021-12-28 06:02:26,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-28 06:02:26,928 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:26,928 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:02:26,928 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-28 06:02:26,928 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-28 06:02:26,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:26,929 INFO L85 PathProgramCache]: Analyzing trace with hash 2114731710, now seen corresponding path program 1 times [2021-12-28 06:02:26,929 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:02:26,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211217610] [2021-12-28 06:02:26,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:26,929 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:02:26,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:27,016 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-28 06:02:27,016 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:02:27,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211217610] [2021-12-28 06:02:27,018 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211217610] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:02:27,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464711155] [2021-12-28 06:02:27,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:27,019 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:02:27,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:02:27,021 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-28 06:02:27,056 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-28 06:02:27,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:27,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-28 06:02:27,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:02:27,142 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-28 06:02:27,143 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 06:02:27,174 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-28 06:02:27,175 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [464711155] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 06:02:27,175 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 06:02:27,175 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2021-12-28 06:02:27,175 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599751512] [2021-12-28 06:02:27,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 06:02:27,176 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 06:02:27,176 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:02:27,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 06:02:27,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-12-28 06:02:27,177 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:27,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:27,186 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2021-12-28 06:02:27,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-28 06:02:27,187 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-28 06:02:27,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:27,187 INFO L225 Difference]: With dead ends: 64 [2021-12-28 06:02:27,187 INFO L226 Difference]: Without dead ends: 64 [2021-12-28 06:02:27,188 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 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-28 06:02:27,188 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 16 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 06:02:27,189 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 167 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 06:02:27,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-12-28 06:02:27,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2021-12-28 06:02:27,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 47 states have (on average 1.4893617021276595) internal successors, (70), 63 states have internal predecessors, (70), 0 states have call successors, (0), 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-28 06:02:27,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2021-12-28 06:02:27,192 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 15 [2021-12-28 06:02:27,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:27,192 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2021-12-28 06:02:27,192 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:27,192 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2021-12-28 06:02:27,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-28 06:02:27,193 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:27,193 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2021-12-28 06:02:27,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-28 06:02:27,409 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:02:27,409 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-28 06:02:27,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:27,409 INFO L85 PathProgramCache]: Analyzing trace with hash -2097949021, now seen corresponding path program 1 times [2021-12-28 06:02:27,410 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:02:27,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599750120] [2021-12-28 06:02:27,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:27,410 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:02:27,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:27,505 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:02:27,505 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:02:27,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599750120] [2021-12-28 06:02:27,505 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599750120] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:02:27,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1414015724] [2021-12-28 06:02:27,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:27,505 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:02:27,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:02:27,508 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-28 06:02:27,509 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-28 06:02:27,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:27,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-28 06:02:27,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:02:27,602 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-28 06:02:27,645 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-28 06:02:27,646 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-28 06:02:27,659 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:02:27,660 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 06:02:27,804 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:02:27,805 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1414015724] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 06:02:27,805 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 06:02:27,805 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2021-12-28 06:02:27,805 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885411595] [2021-12-28 06:02:27,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 06:02:27,805 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 06:02:27,806 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:02:27,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 06:02:27,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-28 06:02:27,806 INFO L87 Difference]: Start difference. First operand 64 states and 70 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-28 06:02:27,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:27,849 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2021-12-28 06:02:27,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-28 06:02:27,850 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 16 [2021-12-28 06:02:27,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:27,850 INFO L225 Difference]: With dead ends: 77 [2021-12-28 06:02:27,850 INFO L226 Difference]: Without dead ends: 77 [2021-12-28 06:02:27,850 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-12-28 06:02:27,851 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 266 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 23 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 06:02:27,851 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [266 Valid, 66 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 23 Unchecked, 0.0s Time] [2021-12-28 06:02:27,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-12-28 06:02:27,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 63. [2021-12-28 06:02:27,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 62 states have internal predecessors, (69), 0 states have call successors, (0), 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-28 06:02:27,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2021-12-28 06:02:27,855 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 16 [2021-12-28 06:02:27,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:27,855 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2021-12-28 06:02:27,855 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-28 06:02:27,855 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2021-12-28 06:02:27,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-28 06:02:27,856 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:27,856 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2021-12-28 06:02:27,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-28 06:02:28,076 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,SelfDestructingSolverStorable5 [2021-12-28 06:02:28,076 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-28 06:02:28,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:28,077 INFO L85 PathProgramCache]: Analyzing trace with hash -2097949020, now seen corresponding path program 1 times [2021-12-28 06:02:28,077 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:02:28,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48473381] [2021-12-28 06:02:28,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:28,077 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:02:28,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:28,161 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:02:28,162 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:02:28,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48473381] [2021-12-28 06:02:28,162 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48473381] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:02:28,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821060802] [2021-12-28 06:02:28,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:28,163 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:02:28,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:02:28,164 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-28 06:02:28,165 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-28 06:02:28,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:28,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-28 06:02:28,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:02:28,246 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-28 06:02:28,249 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-28 06:02:28,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 06:02:28,314 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-28 06:02:28,320 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-28 06:02:28,321 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-28 06:02:28,343 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:02:28,343 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 06:02:28,527 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:02:28,527 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1821060802] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 06:02:28,528 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 06:02:28,528 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2021-12-28 06:02:28,528 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626457276] [2021-12-28 06:02:28,528 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 06:02:28,529 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-28 06:02:28,529 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:02:28,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-28 06:02:28,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-12-28 06:02:28,530 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 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-28 06:02:28,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:28,601 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2021-12-28 06:02:28,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 06:02:28,602 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-28 06:02:28,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:28,603 INFO L225 Difference]: With dead ends: 76 [2021-12-28 06:02:28,603 INFO L226 Difference]: Without dead ends: 76 [2021-12-28 06:02:28,603 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2021-12-28 06:02:28,604 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 294 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 06:02:28,604 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [294 Valid, 67 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 70 Invalid, 0 Unknown, 24 Unchecked, 0.0s Time] [2021-12-28 06:02:28,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-12-28 06:02:28,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 62. [2021-12-28 06:02:28,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 47 states have (on average 1.446808510638298) internal successors, (68), 61 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-28 06:02:28,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2021-12-28 06:02:28,607 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 16 [2021-12-28 06:02:28,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:28,607 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2021-12-28 06:02:28,607 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 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-28 06:02:28,607 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2021-12-28 06:02:28,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-28 06:02:28,608 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:28,608 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:02:28,629 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-28 06:02:28,823 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:02:28,823 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-28 06:02:28,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:28,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1891969267, now seen corresponding path program 2 times [2021-12-28 06:02:28,824 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:02:28,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215202686] [2021-12-28 06:02:28,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:28,824 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:02:28,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:28,857 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:02:28,857 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:02:28,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215202686] [2021-12-28 06:02:28,857 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215202686] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:02:28,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584041149] [2021-12-28 06:02:28,858 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-28 06:02:28,858 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:02:28,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:02:28,859 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-28 06:02:28,860 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-28 06:02:28,957 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-28 06:02:28,957 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-28 06:02:28,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-28 06:02:28,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:02:28,988 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:02:28,988 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 06:02:29,024 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:02:29,025 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584041149] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 06:02:29,025 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 06:02:29,025 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2021-12-28 06:02:29,025 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217642971] [2021-12-28 06:02:29,025 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 06:02:29,026 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 06:02:29,026 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:02:29,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 06:02:29,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-28 06:02:29,026 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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-28 06:02:29,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:29,044 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2021-12-28 06:02:29,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-28 06:02:29,045 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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-28 06:02:29,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:29,045 INFO L225 Difference]: With dead ends: 62 [2021-12-28 06:02:29,045 INFO L226 Difference]: Without dead ends: 62 [2021-12-28 06:02:29,046 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-28 06:02:29,046 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 103 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 06:02:29,047 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 56 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 06:02:29,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-12-28 06:02:29,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2021-12-28 06:02:29,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 47 states have (on average 1.425531914893617) internal successors, (67), 61 states have internal predecessors, (67), 0 states have call successors, (0), 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-28 06:02:29,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2021-12-28 06:02:29,052 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 22 [2021-12-28 06:02:29,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:29,052 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2021-12-28 06:02:29,052 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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-28 06:02:29,053 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2021-12-28 06:02:29,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-28 06:02:29,053 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:29,053 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:02:29,079 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-28 06:02:29,267 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:02:29,268 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-28 06:02:29,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:29,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1779022382, now seen corresponding path program 1 times [2021-12-28 06:02:29,268 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:02:29,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951077656] [2021-12-28 06:02:29,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:29,268 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:02:29,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:29,311 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-28 06:02:29,311 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:02:29,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951077656] [2021-12-28 06:02:29,311 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951077656] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:02:29,311 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 06:02:29,312 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 06:02:29,312 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78981324] [2021-12-28 06:02:29,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:02:29,312 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 06:02:29,312 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:02:29,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 06:02:29,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-28 06:02:29,313 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:29,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:29,421 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2021-12-28 06:02:29,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 06:02:29,422 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-28 06:02:29,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:29,422 INFO L225 Difference]: With dead ends: 113 [2021-12-28 06:02:29,422 INFO L226 Difference]: Without dead ends: 113 [2021-12-28 06:02:29,423 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-12-28 06:02:29,423 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 259 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 06:02:29,423 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [259 Valid, 123 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 06:02:29,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-12-28 06:02:29,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 65. [2021-12-28 06:02:29,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 50 states have (on average 1.46) internal successors, (73), 64 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-28 06:02:29,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2021-12-28 06:02:29,426 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 23 [2021-12-28 06:02:29,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:29,426 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2021-12-28 06:02:29,426 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:29,427 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2021-12-28 06:02:29,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-28 06:02:29,427 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:29,427 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:02:29,427 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-28 06:02:29,427 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-28 06:02:29,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:29,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1779022381, now seen corresponding path program 1 times [2021-12-28 06:02:29,428 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:02:29,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033643043] [2021-12-28 06:02:29,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:29,428 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:02:29,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:29,488 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-28 06:02:29,488 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:02:29,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033643043] [2021-12-28 06:02:29,489 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033643043] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:02:29,489 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 06:02:29,489 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 06:02:29,489 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53071062] [2021-12-28 06:02:29,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:02:29,489 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 06:02:29,490 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:02:29,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 06:02:29,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-28 06:02:29,490 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:29,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:29,598 INFO L93 Difference]: Finished difference Result 100 states and 109 transitions. [2021-12-28 06:02:29,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 06:02:29,599 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-28 06:02:29,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:29,599 INFO L225 Difference]: With dead ends: 100 [2021-12-28 06:02:29,599 INFO L226 Difference]: Without dead ends: 100 [2021-12-28 06:02:29,600 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-12-28 06:02:29,600 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 265 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 06:02:29,600 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [265 Valid, 101 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 06:02:29,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-12-28 06:02:29,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 65. [2021-12-28 06:02:29,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 50 states have (on average 1.42) internal successors, (71), 64 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:29,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2021-12-28 06:02:29,603 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 23 [2021-12-28 06:02:29,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:29,603 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2021-12-28 06:02:29,603 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:29,603 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2021-12-28 06:02:29,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-28 06:02:29,604 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:29,604 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:02:29,604 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-28 06:02:29,604 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-28 06:02:29,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:29,604 INFO L85 PathProgramCache]: Analyzing trace with hash -244809887, now seen corresponding path program 1 times [2021-12-28 06:02:29,604 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:02:29,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767329967] [2021-12-28 06:02:29,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:29,605 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:02:29,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:29,654 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-28 06:02:29,654 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:02:29,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767329967] [2021-12-28 06:02:29,655 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767329967] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:02:29,655 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 06:02:29,655 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 06:02:29,655 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755872764] [2021-12-28 06:02:29,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:02:29,655 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 06:02:29,656 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:02:29,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 06:02:29,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-28 06:02:29,656 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:29,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:29,754 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2021-12-28 06:02:29,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 06:02:29,754 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-12-28 06:02:29,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:29,755 INFO L225 Difference]: With dead ends: 100 [2021-12-28 06:02:29,755 INFO L226 Difference]: Without dead ends: 100 [2021-12-28 06:02:29,755 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-12-28 06:02:29,756 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 243 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 06:02:29,756 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [243 Valid, 106 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 06:02:29,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-12-28 06:02:29,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 68. [2021-12-28 06:02:29,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 53 states have (on average 1.4528301886792452) internal successors, (77), 67 states have internal predecessors, (77), 0 states have call successors, (0), 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-28 06:02:29,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2021-12-28 06:02:29,758 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 25 [2021-12-28 06:02:29,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:29,758 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2021-12-28 06:02:29,758 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:29,759 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2021-12-28 06:02:29,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-28 06:02:29,759 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:29,759 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:02:29,759 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-28 06:02:29,759 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-28 06:02:29,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:29,760 INFO L85 PathProgramCache]: Analyzing trace with hash -244809886, now seen corresponding path program 1 times [2021-12-28 06:02:29,760 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:02:29,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033922650] [2021-12-28 06:02:29,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:29,760 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:02:29,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:29,800 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-28 06:02:29,800 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:02:29,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033922650] [2021-12-28 06:02:29,800 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033922650] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:02:29,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358920652] [2021-12-28 06:02:29,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:29,800 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:02:29,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:02:29,801 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-28 06:02:29,803 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-28 06:02:29,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:29,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-28 06:02:29,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:02:29,918 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-28 06:02:29,918 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 06:02:29,919 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1358920652] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:02:29,919 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 06:02:29,919 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2021-12-28 06:02:29,921 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129495141] [2021-12-28 06:02:29,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:02:29,921 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 06:02:29,922 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:02:29,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 06:02:29,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-28 06:02:29,922 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 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-28 06:02:29,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:29,933 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2021-12-28 06:02:29,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-28 06:02:29,934 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-12-28 06:02:29,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:29,934 INFO L225 Difference]: With dead ends: 65 [2021-12-28 06:02:29,934 INFO L226 Difference]: Without dead ends: 65 [2021-12-28 06:02:29,934 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 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-28 06:02:29,935 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 69 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 06:02:29,935 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 62 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 06:02:29,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-12-28 06:02:29,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 52. [2021-12-28 06:02:29,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 51 states have internal predecessors, (56), 0 states have call successors, (0), 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-28 06:02:29,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2021-12-28 06:02:29,937 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 25 [2021-12-28 06:02:29,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:29,937 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2021-12-28 06:02:29,937 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 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-28 06:02:29,938 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2021-12-28 06:02:29,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-28 06:02:29,940 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:29,940 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:02:29,960 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-28 06:02:30,154 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,SelfDestructingSolverStorable11 [2021-12-28 06:02:30,154 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-28 06:02:30,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:30,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1040689078, now seen corresponding path program 1 times [2021-12-28 06:02:30,154 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:02:30,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310660746] [2021-12-28 06:02:30,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:30,154 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:02:30,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:30,198 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-28 06:02:30,199 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:02:30,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310660746] [2021-12-28 06:02:30,199 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310660746] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:02:30,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579351190] [2021-12-28 06:02:30,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:30,199 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:02:30,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:02:30,200 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-28 06:02:30,201 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-28 06:02:30,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:30,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-28 06:02:30,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:02:30,328 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-28 06:02:30,329 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 06:02:30,329 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579351190] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:02:30,329 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 06:02:30,329 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 7 [2021-12-28 06:02:30,329 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076104263] [2021-12-28 06:02:30,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:02:30,330 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 06:02:30,330 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:02:30,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 06:02:30,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-28 06:02:30,330 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) 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-28 06:02:30,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:30,353 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2021-12-28 06:02:30,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 06:02:30,354 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) 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 26 [2021-12-28 06:02:30,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:30,354 INFO L225 Difference]: With dead ends: 49 [2021-12-28 06:02:30,354 INFO L226 Difference]: Without dead ends: 49 [2021-12-28 06:02:30,354 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2021-12-28 06:02:30,355 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 72 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 06:02:30,355 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 73 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 06:02:30,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2021-12-28 06:02:30,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2021-12-28 06:02:30,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 48 states have internal predecessors, (52), 0 states have call successors, (0), 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-28 06:02:30,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2021-12-28 06:02:30,356 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 26 [2021-12-28 06:02:30,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:30,357 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2021-12-28 06:02:30,357 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) 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-28 06:02:30,357 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2021-12-28 06:02:30,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-28 06:02:30,357 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:30,357 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:02:30,376 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-28 06:02:30,574 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:02:30,574 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-28 06:02:30,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:30,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1040689023, now seen corresponding path program 1 times [2021-12-28 06:02:30,574 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:02:30,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552163184] [2021-12-28 06:02:30,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:30,575 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:02:30,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:30,709 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:02:30,709 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:02:30,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552163184] [2021-12-28 06:02:30,709 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552163184] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:02:30,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418254429] [2021-12-28 06:02:30,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:30,710 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:02:30,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:02:30,711 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-28 06:02:30,712 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-28 06:02:30,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:30,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 43 conjunts are in the unsatisfiable core [2021-12-28 06:02:30,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:02:30,807 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-28 06:02:30,831 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-28 06:02:30,832 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-28 06:02:30,850 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 13 treesize of output 9 [2021-12-28 06:02:30,881 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-12-28 06:02:30,882 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 23 treesize of output 22 [2021-12-28 06:02:30,905 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 06:02:30,905 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2021-12-28 06:02:31,019 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 31 treesize of output 13 [2021-12-28 06:02:31,025 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:02:31,026 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 06:02:31,119 INFO L353 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2021-12-28 06:02:31,119 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 21 treesize of output 20 [2021-12-28 06:02:31,122 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_730 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_730) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) is different from false [2021-12-28 06:02:31,155 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_728 Int) (v_ArrVal_730 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_728)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_730) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) is different from false [2021-12-28 06:02:31,166 INFO L353 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2021-12-28 06:02:31,166 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 2 case distinctions, treesize of input 27 treesize of output 33 [2021-12-28 06:02:31,169 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 36 treesize of output 24 [2021-12-28 06:02:31,171 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 7 treesize of output 3 [2021-12-28 06:02:31,220 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-28 06:02:31,220 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418254429] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 06:02:31,220 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 06:02:31,220 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 30 [2021-12-28 06:02:31,220 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934768806] [2021-12-28 06:02:31,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 06:02:31,220 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-12-28 06:02:31,220 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:02:31,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-12-28 06:02:31,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=736, Unknown=2, NotChecked=110, Total=930 [2021-12-28 06:02:31,221 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand has 31 states, 30 states have (on average 2.2) internal successors, (66), 31 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-28 06:02:32,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:32,031 INFO L93 Difference]: Finished difference Result 129 states and 137 transitions. [2021-12-28 06:02:32,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-28 06:02:32,032 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.2) internal successors, (66), 31 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 26 [2021-12-28 06:02:32,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:32,033 INFO L225 Difference]: With dead ends: 129 [2021-12-28 06:02:32,033 INFO L226 Difference]: Without dead ends: 129 [2021-12-28 06:02:32,034 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=317, Invalid=1757, Unknown=4, NotChecked=178, Total=2256 [2021-12-28 06:02:32,034 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 514 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 1015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 194 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 06:02:32,034 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [514 Valid, 721 Invalid, 1015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 766 Invalid, 0 Unknown, 194 Unchecked, 0.3s Time] [2021-12-28 06:02:32,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2021-12-28 06:02:32,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 69. [2021-12-28 06:02:32,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 61 states have (on average 1.2459016393442623) internal successors, (76), 68 states have internal predecessors, (76), 0 states have call successors, (0), 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-28 06:02:32,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 76 transitions. [2021-12-28 06:02:32,036 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 76 transitions. Word has length 26 [2021-12-28 06:02:32,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:32,036 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 76 transitions. [2021-12-28 06:02:32,037 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.2) internal successors, (66), 31 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-28 06:02:32,037 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2021-12-28 06:02:32,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-28 06:02:32,037 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:32,037 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:02:32,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-28 06:02:32,243 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:02:32,243 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-28 06:02:32,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:32,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1040689024, now seen corresponding path program 1 times [2021-12-28 06:02:32,244 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:02:32,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311796981] [2021-12-28 06:02:32,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:32,244 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:02:32,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:32,457 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:02:32,457 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:02:32,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311796981] [2021-12-28 06:02:32,457 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311796981] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:02:32,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529960945] [2021-12-28 06:02:32,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:32,457 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:02:32,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:02:32,458 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-28 06:02:32,460 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-28 06:02:32,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:32,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 55 conjunts are in the unsatisfiable core [2021-12-28 06:02:32,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:02:32,562 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-28 06:02:32,613 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-28 06:02:32,614 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-28 06:02:32,640 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 13 treesize of output 9 [2021-12-28 06:02:32,644 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 13 treesize of output 9 [2021-12-28 06:02:32,681 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-12-28 06:02:32,682 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 23 treesize of output 22 [2021-12-28 06:02:32,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 06:02:32,694 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 23 treesize of output 22 [2021-12-28 06:02:32,721 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 06:02:32,722 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 53 [2021-12-28 06:02:32,726 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 41 treesize of output 41 [2021-12-28 06:02:32,879 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 39 treesize of output 21 [2021-12-28 06:02:32,885 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2021-12-28 06:02:32,931 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:02:32,931 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 06:02:33,141 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 06:02:33,141 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 46 treesize of output 50 [2021-12-28 06:02:33,178 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_832 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_832) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_ArrVal_834 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (forall ((v_prenex_1 (Array Int Int))) (<= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8)))) is different from false [2021-12-28 06:02:33,196 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_1 (Array Int Int)) (v_ArrVal_831 Int)) (<= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_831)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8))) (forall ((v_ArrVal_830 Int) (v_ArrVal_832 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_830)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_832) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_ArrVal_834 (Array Int Int)) (v_ArrVal_831 Int)) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_831)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_834) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))))) is different from false [2021-12-28 06:02:33,211 INFO L353 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2021-12-28 06:02:33,212 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 2 case distinctions, treesize of input 27 treesize of output 33 [2021-12-28 06:02:33,214 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 36 treesize of output 24 [2021-12-28 06:02:33,216 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 11 treesize of output 7 [2021-12-28 06:02:33,226 INFO L353 Elim1Store]: treesize reduction 47, result has 2.1 percent of original size [2021-12-28 06:02:33,226 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 1 [2021-12-28 06:02:33,232 INFO L353 Elim1Store]: treesize reduction 47, result has 2.1 percent of original size [2021-12-28 06:02:33,232 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 1 [2021-12-28 06:02:33,412 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-28 06:02:33,412 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [529960945] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 06:02:33,413 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 06:02:33,413 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 35 [2021-12-28 06:02:33,413 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438103499] [2021-12-28 06:02:33,413 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 06:02:33,414 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-12-28 06:02:33,414 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:02:33,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-12-28 06:02:33,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1031, Unknown=2, NotChecked=130, Total=1260 [2021-12-28 06:02:33,415 INFO L87 Difference]: Start difference. First operand 69 states and 76 transitions. Second operand has 36 states, 35 states have (on average 2.057142857142857) internal successors, (72), 36 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:34,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:34,791 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2021-12-28 06:02:34,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-28 06:02:34,791 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.057142857142857) internal successors, (72), 36 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-28 06:02:34,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:34,792 INFO L225 Difference]: With dead ends: 130 [2021-12-28 06:02:34,792 INFO L226 Difference]: Without dead ends: 130 [2021-12-28 06:02:34,793 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=311, Invalid=2145, Unknown=2, NotChecked=194, Total=2652 [2021-12-28 06:02:34,793 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 809 mSDsluCounter, 779 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 809 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 1149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 306 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-28 06:02:34,794 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [809 Valid, 842 Invalid, 1149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 786 Invalid, 0 Unknown, 306 Unchecked, 0.4s Time] [2021-12-28 06:02:34,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-12-28 06:02:34,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 77. [2021-12-28 06:02:34,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 69 states have (on average 1.2463768115942029) internal successors, (86), 76 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-28 06:02:34,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2021-12-28 06:02:34,796 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 26 [2021-12-28 06:02:34,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:34,796 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2021-12-28 06:02:34,796 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.057142857142857) internal successors, (72), 36 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:34,796 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2021-12-28 06:02:34,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-28 06:02:34,797 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:34,797 INFO L514 BasicCegarLoop]: trace histogram [2, 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-28 06:02:34,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-28 06:02:35,011 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,SelfDestructingSolverStorable14 [2021-12-28 06:02:35,012 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-28 06:02:35,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:35,012 INFO L85 PathProgramCache]: Analyzing trace with hash -709592258, now seen corresponding path program 1 times [2021-12-28 06:02:35,012 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:02:35,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604468818] [2021-12-28 06:02:35,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:35,012 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:02:35,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:35,050 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-28 06:02:35,051 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:02:35,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604468818] [2021-12-28 06:02:35,051 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604468818] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:02:35,051 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 06:02:35,051 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 06:02:35,051 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254645827] [2021-12-28 06:02:35,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:02:35,052 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 06:02:35,052 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:02:35,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 06:02:35,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-28 06:02:35,052 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 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-28 06:02:35,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:35,133 INFO L93 Difference]: Finished difference Result 88 states and 97 transitions. [2021-12-28 06:02:35,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-28 06:02:35,134 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 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 31 [2021-12-28 06:02:35,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:35,134 INFO L225 Difference]: With dead ends: 88 [2021-12-28 06:02:35,134 INFO L226 Difference]: Without dead ends: 88 [2021-12-28 06:02:35,135 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-12-28 06:02:35,135 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 122 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 06:02:35,135 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 63 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 06:02:35,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-12-28 06:02:35,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 78. [2021-12-28 06:02:35,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 71 states have (on average 1.2535211267605635) internal successors, (89), 77 states have internal predecessors, (89), 0 states have call successors, (0), 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-28 06:02:35,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2021-12-28 06:02:35,137 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 31 [2021-12-28 06:02:35,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:35,137 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 89 transitions. [2021-12-28 06:02:35,137 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 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-28 06:02:35,137 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2021-12-28 06:02:35,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-28 06:02:35,138 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:35,138 INFO L514 BasicCegarLoop]: trace histogram [2, 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-28 06:02:35,138 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-28 06:02:35,138 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-28 06:02:35,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:35,139 INFO L85 PathProgramCache]: Analyzing trace with hash -709592257, now seen corresponding path program 1 times [2021-12-28 06:02:35,139 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:02:35,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7418107] [2021-12-28 06:02:35,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:35,139 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:02:35,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:35,177 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-28 06:02:35,178 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:02:35,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7418107] [2021-12-28 06:02:35,178 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7418107] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:02:35,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908438590] [2021-12-28 06:02:35,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:35,178 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:02:35,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:02:35,179 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-28 06:02:35,180 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-28 06:02:35,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:35,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-28 06:02:35,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:02:35,326 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-28 06:02:35,326 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 06:02:35,326 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [908438590] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:02:35,326 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 06:02:35,327 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2021-12-28 06:02:35,327 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073731580] [2021-12-28 06:02:35,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:02:35,327 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 06:02:35,327 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:02:35,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 06:02:35,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-28 06:02:35,328 INFO L87 Difference]: Start difference. First operand 78 states and 89 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 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-28 06:02:35,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:35,351 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2021-12-28 06:02:35,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 06:02:35,351 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 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 31 [2021-12-28 06:02:35,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:35,352 INFO L225 Difference]: With dead ends: 86 [2021-12-28 06:02:35,352 INFO L226 Difference]: Without dead ends: 86 [2021-12-28 06:02:35,352 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-12-28 06:02:35,352 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 61 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 06:02:35,353 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 86 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 06:02:35,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2021-12-28 06:02:35,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 75. [2021-12-28 06:02:35,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 68 states have (on average 1.2352941176470589) internal successors, (84), 74 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:35,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2021-12-28 06:02:35,355 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 31 [2021-12-28 06:02:35,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:35,355 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2021-12-28 06:02:35,355 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 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-28 06:02:35,355 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2021-12-28 06:02:35,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-28 06:02:35,356 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:35,356 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:02:35,375 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-28 06:02:35,573 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-12-28 06:02:35,573 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-28 06:02:35,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:35,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1698966507, now seen corresponding path program 2 times [2021-12-28 06:02:35,574 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:02:35,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483070033] [2021-12-28 06:02:35,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:35,574 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:02:35,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:35,607 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-28 06:02:35,607 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:02:35,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483070033] [2021-12-28 06:02:35,608 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483070033] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:02:35,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [970393115] [2021-12-28 06:02:35,608 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-28 06:02:35,608 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:02:35,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:02:35,609 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-28 06:02:35,639 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-28 06:02:35,720 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-28 06:02:35,720 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-28 06:02:35,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-28 06:02:35,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:02:35,770 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-28 06:02:35,771 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 06:02:35,771 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [970393115] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:02:35,771 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 06:02:35,771 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2021-12-28 06:02:35,771 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001048156] [2021-12-28 06:02:35,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:02:35,771 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 06:02:35,771 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:02:35,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 06:02:35,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-28 06:02:35,772 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:35,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:35,779 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2021-12-28 06:02:35,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 06:02:35,787 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-12-28 06:02:35,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:35,787 INFO L225 Difference]: With dead ends: 53 [2021-12-28 06:02:35,787 INFO L226 Difference]: Without dead ends: 53 [2021-12-28 06:02:35,787 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 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-28 06:02:35,788 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 31 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 60 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-28 06:02:35,788 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 60 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 06:02:35,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-12-28 06:02:35,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2021-12-28 06:02:35,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 47 states have (on average 1.2127659574468086) internal successors, (57), 52 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:35,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2021-12-28 06:02:35,789 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 34 [2021-12-28 06:02:35,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:35,790 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2021-12-28 06:02:35,790 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:35,790 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2021-12-28 06:02:35,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-28 06:02:35,790 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:35,790 INFO L514 BasicCegarLoop]: trace histogram [2, 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] [2021-12-28 06:02:35,807 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-28 06:02:35,999 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,SelfDestructingSolverStorable17 [2021-12-28 06:02:35,999 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-28 06:02:36,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:36,000 INFO L85 PathProgramCache]: Analyzing trace with hash -674776797, now seen corresponding path program 1 times [2021-12-28 06:02:36,000 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:02:36,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188253231] [2021-12-28 06:02:36,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:36,000 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:02:36,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:36,057 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-28 06:02:36,057 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:02:36,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188253231] [2021-12-28 06:02:36,058 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188253231] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:02:36,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665385623] [2021-12-28 06:02:36,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:36,058 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:02:36,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:02:36,059 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-28 06:02:36,087 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-28 06:02:36,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:36,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-28 06:02:36,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:02:36,239 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-28 06:02:36,239 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 06:02:36,297 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-28 06:02:36,298 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1665385623] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 06:02:36,298 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 06:02:36,298 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 6 [2021-12-28 06:02:36,298 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548282508] [2021-12-28 06:02:36,298 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 06:02:36,299 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 06:02:36,299 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:02:36,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 06:02:36,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-28 06:02:36,299 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 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-28 06:02:36,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:36,325 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2021-12-28 06:02:36,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 06:02:36,325 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 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 34 [2021-12-28 06:02:36,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:36,326 INFO L225 Difference]: With dead ends: 57 [2021-12-28 06:02:36,326 INFO L226 Difference]: Without dead ends: 57 [2021-12-28 06:02:36,326 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 68 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-28 06:02:36,326 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 79 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 06:02:36,326 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 81 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 06:02:36,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-12-28 06:02:36,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2021-12-28 06:02:36,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 51 states have (on average 1.196078431372549) internal successors, (61), 56 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:36,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2021-12-28 06:02:36,328 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 34 [2021-12-28 06:02:36,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:36,328 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2021-12-28 06:02:36,328 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 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-28 06:02:36,328 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2021-12-28 06:02:36,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-28 06:02:36,329 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:36,329 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:02:36,346 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-28 06:02:36,529 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:02:36,529 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-28 06:02:36,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:36,530 INFO L85 PathProgramCache]: Analyzing trace with hash -634882153, now seen corresponding path program 1 times [2021-12-28 06:02:36,530 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:02:36,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994514395] [2021-12-28 06:02:36,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:36,530 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:02:36,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:36,569 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-28 06:02:36,570 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:02:36,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994514395] [2021-12-28 06:02:36,570 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994514395] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:02:36,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565011048] [2021-12-28 06:02:36,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:36,570 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:02:36,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:02:36,571 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-28 06:02:36,572 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-28 06:02:36,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:36,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-28 06:02:36,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:02:36,736 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-28 06:02:36,736 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 06:02:36,777 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-28 06:02:36,777 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [565011048] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 06:02:36,777 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 06:02:36,777 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2021-12-28 06:02:36,777 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752995793] [2021-12-28 06:02:36,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 06:02:36,778 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 06:02:36,778 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:02:36,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 06:02:36,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-28 06:02:36,778 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 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-28 06:02:36,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:36,808 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2021-12-28 06:02:36,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 06:02:36,808 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 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 34 [2021-12-28 06:02:36,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:36,809 INFO L225 Difference]: With dead ends: 52 [2021-12-28 06:02:36,809 INFO L226 Difference]: Without dead ends: 52 [2021-12-28 06:02:36,809 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2021-12-28 06:02:36,810 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 61 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 06:02:36,811 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 115 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 06:02:36,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2021-12-28 06:02:36,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2021-12-28 06:02:36,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 51 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-28 06:02:36,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2021-12-28 06:02:36,816 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 34 [2021-12-28 06:02:36,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:36,816 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2021-12-28 06:02:36,816 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 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-28 06:02:36,816 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2021-12-28 06:02:36,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-28 06:02:36,817 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:36,817 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:02:36,837 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-28 06:02:37,037 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:02:37,038 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-28 06:02:37,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:37,038 INFO L85 PathProgramCache]: Analyzing trace with hash -427165145, now seen corresponding path program 2 times [2021-12-28 06:02:37,038 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:02:37,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58424248] [2021-12-28 06:02:37,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:37,038 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:02:37,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:37,101 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-28 06:02:37,101 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:02:37,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58424248] [2021-12-28 06:02:37,101 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58424248] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:02:37,101 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 06:02:37,102 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 06:02:37,102 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742718230] [2021-12-28 06:02:37,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:02:37,102 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 06:02:37,102 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:02:37,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 06:02:37,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-28 06:02:37,102 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:37,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:37,197 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2021-12-28 06:02:37,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 06:02:37,198 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-12-28 06:02:37,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:37,198 INFO L225 Difference]: With dead ends: 60 [2021-12-28 06:02:37,198 INFO L226 Difference]: Without dead ends: 60 [2021-12-28 06:02:37,198 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-12-28 06:02:37,199 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 147 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 06:02:37,199 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 36 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 06:02:37,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-12-28 06:02:37,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2021-12-28 06:02:37,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 53 states have internal predecessors, (56), 0 states have call successors, (0), 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-28 06:02:37,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2021-12-28 06:02:37,200 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 39 [2021-12-28 06:02:37,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:37,200 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2021-12-28 06:02:37,201 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:37,201 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2021-12-28 06:02:37,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-28 06:02:37,201 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:37,201 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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-28 06:02:37,201 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-28 06:02:37,201 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-28 06:02:37,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:37,202 INFO L85 PathProgramCache]: Analyzing trace with hash -357219036, now seen corresponding path program 1 times [2021-12-28 06:02:37,202 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:02:37,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22181929] [2021-12-28 06:02:37,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:37,202 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:02:37,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:37,246 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-28 06:02:37,246 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:02:37,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22181929] [2021-12-28 06:02:37,246 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22181929] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:02:37,246 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 06:02:37,246 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 06:02:37,246 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683023012] [2021-12-28 06:02:37,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:02:37,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 06:02:37,247 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:02:37,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 06:02:37,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-28 06:02:37,248 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 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-28 06:02:37,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:37,305 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2021-12-28 06:02:37,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 06:02:37,307 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 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 40 [2021-12-28 06:02:37,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:37,308 INFO L225 Difference]: With dead ends: 57 [2021-12-28 06:02:37,308 INFO L226 Difference]: Without dead ends: 57 [2021-12-28 06:02:37,308 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-12-28 06:02:37,308 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 134 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 06:02:37,308 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 58 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 06:02:37,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-12-28 06:02:37,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2021-12-28 06:02:37,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 53 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-28 06:02:37,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2021-12-28 06:02:37,310 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 40 [2021-12-28 06:02:37,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:37,310 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2021-12-28 06:02:37,310 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 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-28 06:02:37,310 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2021-12-28 06:02:37,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-28 06:02:37,311 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:37,311 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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-28 06:02:37,311 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-28 06:02:37,311 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-28 06:02:37,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:37,311 INFO L85 PathProgramCache]: Analyzing trace with hash 311339877, now seen corresponding path program 1 times [2021-12-28 06:02:37,311 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:02:37,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385970062] [2021-12-28 06:02:37,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:37,312 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:02:37,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:37,352 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-28 06:02:37,352 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:02:37,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385970062] [2021-12-28 06:02:37,352 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385970062] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:02:37,352 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 06:02:37,353 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 06:02:37,353 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237302228] [2021-12-28 06:02:37,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:02:37,353 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 06:02:37,353 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:02:37,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 06:02:37,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-28 06:02:37,354 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 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-28 06:02:37,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:02:37,432 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2021-12-28 06:02:37,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 06:02:37,433 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 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 42 [2021-12-28 06:02:37,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:02:37,433 INFO L225 Difference]: With dead ends: 55 [2021-12-28 06:02:37,433 INFO L226 Difference]: Without dead ends: 55 [2021-12-28 06:02:37,433 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-12-28 06:02:37,434 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 120 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 06:02:37,434 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 45 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 06:02:37,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2021-12-28 06:02:37,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2021-12-28 06:02:37,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.12) internal successors, (56), 54 states have internal predecessors, (56), 0 states have call successors, (0), 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-28 06:02:37,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2021-12-28 06:02:37,435 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 42 [2021-12-28 06:02:37,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:02:37,436 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2021-12-28 06:02:37,436 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 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-28 06:02:37,436 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2021-12-28 06:02:37,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-28 06:02:37,436 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:02:37,436 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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] [2021-12-28 06:02:37,436 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-28 06:02:37,436 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-28 06:02:37,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:02:37,437 INFO L85 PathProgramCache]: Analyzing trace with hash -2002912181, now seen corresponding path program 1 times [2021-12-28 06:02:37,437 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:02:37,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215635681] [2021-12-28 06:02:37,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:37,437 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:02:37,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:37,709 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-28 06:02:37,709 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:02:37,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215635681] [2021-12-28 06:02:37,709 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215635681] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:02:37,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264888367] [2021-12-28 06:02:37,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:02:37,709 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:02:37,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:02:37,711 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-28 06:02:37,712 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-28 06:02:37,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:02:37,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 67 conjunts are in the unsatisfiable core [2021-12-28 06:02:37,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:02:37,847 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-28 06:02:37,871 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-28 06:02:37,872 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-28 06:02:37,883 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 13 treesize of output 9 [2021-12-28 06:02:37,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 06:02:37,892 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 23 treesize of output 22 [2021-12-28 06:02:37,908 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 06:02:37,908 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2021-12-28 06:02:38,040 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 06:02:38,040 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2021-12-28 06:02:38,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 06:02:38,101 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 29 treesize of output 24 [2021-12-28 06:02:38,160 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 06:02:38,161 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-28 06:02:38,256 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-28 06:02:38,261 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-28 06:02:38,261 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 06:02:40,453 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (and (forall ((v_ArrVal_1644 Int)) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_ArrVal_1644 Int)) (= (select |c_#valid| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)) 1))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|))) is different from false [2021-12-28 06:02:40,514 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|) (and (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1642) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)) 1)) (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1642) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4) |c_ULTIMATE.start_main_~s~0#1.base|)))))) is different from false [2021-12-28 06:02:40,554 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|) (and (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1642) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)))) (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1642) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)) 1))))) is different from false [2021-12-28 06:02:40,574 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (and (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)) v_ArrVal_1642) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)))) (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)) v_ArrVal_1642) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)) 1))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|))) is different from false [2021-12-28 06:02:40,613 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (and (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_1642) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)) 1)) (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_1642) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4) |c_ULTIMATE.start_main_~s~0#1.base|)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|))) is different from false [2021-12-28 06:02:40,646 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|) (and (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) v_ArrVal_1642) |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4) |c_ULTIMATE.start_dll_create_#res#1.base|))) (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) v_ArrVal_1642) |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)) 1))))) is different from false [2021-12-28 06:02:40,668 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (and (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) v_ArrVal_1642) |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)) 1)) (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) v_ArrVal_1642) |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|))) is different from false [2021-12-28 06:02:40,709 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|) (and (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1642) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)) 1)) (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1642) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) is different from false [2021-12-28 06:02:40,728 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 06:02:40,728 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 61 treesize of output 65 [2021-12-28 06:02:40,784 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (and (forall ((v_prenex_6 Int) (v_ArrVal_1641 (Array Int Int)) (v_prenex_5 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1641))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_prenex_5)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_prenex_6) 4)))) (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1641 (Array Int Int)) (v_ArrVal_1644 Int)) (= (select (store (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1641))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1642)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|))) is different from false [2021-12-28 06:02:40,833 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (and (forall ((v_ArrVal_1639 Int) (v_prenex_6 Int) (v_ArrVal_1641 (Array Int Int)) (v_prenex_5 (Array Int Int))) (not (= (select (store (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1639)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1641))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_prenex_5)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_prenex_6) 4) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (forall ((v_ArrVal_1639 Int) (v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1641 (Array Int Int)) (v_ArrVal_1644 Int)) (= (select (store (select (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1639)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1641))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1642)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|))) is different from false [2021-12-28 06:02:40,862 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 06:02:40,867 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 06:02:40,868 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 112 treesize of output 93 [2021-12-28 06:02:40,871 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 226 treesize of output 212 [2021-12-28 06:02:40,876 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 06:02:40,884 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 06:02:40,884 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 223 treesize of output 217 [2021-12-28 06:02:40,889 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 348 treesize of output 334 [2021-12-28 06:02:40,894 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 06:02:40,902 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 06:02:40,903 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 344 treesize of output 338 [2021-12-28 06:02:40,922 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 06:02:40,923 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 219 treesize of output 212 [2021-12-28 06:02:40,934 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 06:02:40,934 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 212 treesize of output 205 [2021-12-28 06:02:40,941 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 214 treesize of output 210 [2021-12-28 06:02:40,953 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 232 treesize of output 228 [2021-12-28 06:02:41,207 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2021-12-28 06:02:41,207 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1264888367] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 06:02:41,207 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 06:02:41,207 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 21] total 42 [2021-12-28 06:02:41,208 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127474784] [2021-12-28 06:02:41,208 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 06:02:41,208 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2021-12-28 06:02:41,208 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:02:41,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-12-28 06:02:41,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=960, Unknown=10, NotChecked=710, Total=1806 [2021-12-28 06:02:41,209 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand has 43 states, 42 states have (on average 2.3095238095238093) internal successors, (97), 43 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:02:43,448 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|) (and (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1642) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)) 1)) (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1642) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |c_#valid| .cse0) 1))) is different from false [2021-12-28 06:02:45,451 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (not (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select |c_#valid| .cse0) 1) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (and (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) v_ArrVal_1642) |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)) 1)) (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) v_ArrVal_1642) |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|))))) is different from false [2021-12-28 06:02:49,466 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (and (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse0)) (= (select |c_#valid| .cse0) 1) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (and (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_1642) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)) 1)) (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_1642) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4) |c_ULTIMATE.start_main_~s~0#1.base|)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|))) (not (= .cse1 |c_ULTIMATE.start_dll_create_#res#1.base|)) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0) (= (select |c_#valid| .cse1) 1))) is different from false [2021-12-28 06:03:28,109 WARN L228 SmtUtils]: Spent 24.04s on a formula simplification. DAG size of input: 45 DAG size of output: 34 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-28 06:03:30,112 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (and (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse0)) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|) (and (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1642) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)) 1)) (forall ((v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1644 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1642) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4) |c_ULTIMATE.start_main_~s~0#1.base|)))))) (= .cse0 |c_ULTIMATE.start_dll_update_at_~head#1.base|))) is different from false [2021-12-28 06:03:30,384 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (and (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse0)) (= (select |c_#valid| .cse0) 1) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_20| Int)) (or (and (forall ((v_ArrVal_1644 Int)) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_ArrVal_1644 Int)) (= (select |c_#valid| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_20| v_ArrVal_1644) 4)) 1))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_20|))) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0))) is different from false [2021-12-28 06:03:32,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:03:32,586 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2021-12-28 06:03:32,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-28 06:03:32,586 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.3095238095238093) internal successors, (97), 43 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-12-28 06:03:32,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:03:32,586 INFO L225 Difference]: With dead ends: 62 [2021-12-28 06:03:32,586 INFO L226 Difference]: Without dead ends: 62 [2021-12-28 06:03:32,587 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 66 SyntacticMatches, 7 SemanticMatches, 55 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 423 ImplicationChecksByTransitivity, 53.6s TimeCoverageRelationStatistics Valid=220, Invalid=1525, Unknown=37, NotChecked=1410, Total=3192 [2021-12-28 06:03:32,588 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 57 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 1030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 531 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 06:03:32,588 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 192 Invalid, 1030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 483 Invalid, 0 Unknown, 531 Unchecked, 0.2s Time] [2021-12-28 06:03:32,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-12-28 06:03:32,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 58. [2021-12-28 06:03:32,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 53 states have (on average 1.150943396226415) internal successors, (61), 57 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:03:32,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2021-12-28 06:03:32,589 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 45 [2021-12-28 06:03:32,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:03:32,589 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2021-12-28 06:03:32,589 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 2.3095238095238093) internal successors, (97), 43 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:03:32,589 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2021-12-28 06:03:32,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-28 06:03:32,589 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:03:32,589 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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] [2021-12-28 06:03:32,634 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-28 06:03:32,790 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,SelfDestructingSolverStorable23 [2021-12-28 06:03:32,790 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-28 06:03:32,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:03:32,790 INFO L85 PathProgramCache]: Analyzing trace with hash -2002912180, now seen corresponding path program 1 times [2021-12-28 06:03:32,790 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:03:32,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040471243] [2021-12-28 06:03:32,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:03:32,790 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:03:32,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:03:33,189 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-28 06:03:33,190 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:03:33,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040471243] [2021-12-28 06:03:33,190 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040471243] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:03:33,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559779249] [2021-12-28 06:03:33,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:03:33,190 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:03:33,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:03:33,191 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 06:03:33,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-28 06:03:33,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:03:33,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 85 conjunts are in the unsatisfiable core [2021-12-28 06:03:33,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:03:33,345 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-28 06:03:33,407 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-28 06:03:33,407 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-28 06:03:33,440 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 13 treesize of output 9 [2021-12-28 06:03:33,457 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 13 treesize of output 9 [2021-12-28 06:03:33,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 06:03:33,493 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 23 treesize of output 22 [2021-12-28 06:03:33,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 06:03:33,499 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 23 treesize of output 22 [2021-12-28 06:03:33,529 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 06:03:33,529 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-12-28 06:03:33,535 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 22 treesize of output 24 [2021-12-28 06:03:33,711 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 06:03:33,711 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2021-12-28 06:03:33,714 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 18 treesize of output 20 [2021-12-28 06:03:33,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 06:03:33,787 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 19 treesize of output 18 [2021-12-28 06:03:33,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 06:03:33,791 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 29 treesize of output 24 [2021-12-28 06:03:33,885 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 06:03:33,886 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 17 treesize of output 17 [2021-12-28 06:03:33,894 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 06:03:33,894 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-28 06:03:34,004 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-28 06:03:34,004 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 06:03:36,345 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (and (forall ((v_ArrVal_1779 Int)) (<= 0 (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1779) 4) 4))) (forall ((v_ArrVal_1778 Int) (v_ArrVal_1779 Int)) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1779) 4) 8) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1778) 4))))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|))) is different from false [2021-12-28 06:03:36,431 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (and (forall ((v_ArrVal_1777 (Array Int Int)) (v_ArrVal_1776 (Array Int Int)) (v_ArrVal_1778 Int) (v_ArrVal_1779 Int)) (<= (+ (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1776) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1779) 4) 8) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1777) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1778) 4)))) (forall ((v_ArrVal_1776 (Array Int Int)) (v_ArrVal_1779 Int)) (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1776) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1779) 4) 4)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|))) is different from false [2021-12-28 06:03:36,476 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|) (and (forall ((v_ArrVal_1776 (Array Int Int)) (v_ArrVal_1779 Int)) (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1776) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1779) 4) 4))) (forall ((v_ArrVal_1777 (Array Int Int)) (v_ArrVal_1776 (Array Int Int)) (v_ArrVal_1778 Int) (v_ArrVal_1779 Int)) (<= (+ (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1776) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1779) 4) 8) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_1777) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1778) 4))))))) is different from false [2021-12-28 06:03:36,503 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (and (forall ((v_ArrVal_1776 (Array Int Int)) (v_ArrVal_1779 Int)) (<= 0 (+ 4 (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)) v_ArrVal_1776) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1779) 4)))) (forall ((v_ArrVal_1777 (Array Int Int)) (v_ArrVal_1776 (Array Int Int)) (v_ArrVal_1778 Int) (v_ArrVal_1779 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)))) (<= (+ 8 (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1776) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1779) 4)) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1777) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1778) 4)))))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|))) is different from false [2021-12-28 06:03:36,552 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (and (forall ((v_ArrVal_1776 (Array Int Int)) (v_ArrVal_1779 Int)) (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_1776) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1779) 4) 4))) (forall ((v_ArrVal_1777 (Array Int Int)) (v_ArrVal_1776 (Array Int Int)) (v_ArrVal_1778 Int) (v_ArrVal_1779 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (<= (+ (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1776) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1779) 4) 8) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1777) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1778) 4)))))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|))) is different from false [2021-12-28 06:03:36,578 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (and (forall ((v_ArrVal_1777 (Array Int Int)) (v_ArrVal_1776 (Array Int Int)) (v_ArrVal_1778 Int) (v_ArrVal_1779 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)))) (<= (+ (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1776) |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1779) 4) 8) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1777) |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1778) 4))))) (forall ((v_ArrVal_1776 (Array Int Int)) (v_ArrVal_1779 Int)) (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) v_ArrVal_1776) |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1779) 4) 4)))) (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|))) is different from false [2021-12-28 06:03:36,602 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|) (and (forall ((v_ArrVal_1776 (Array Int Int)) (v_ArrVal_1779 Int)) (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) v_ArrVal_1776) |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1779) 4) 4))) (forall ((v_ArrVal_1777 (Array Int Int)) (v_ArrVal_1776 (Array Int Int)) (v_ArrVal_1778 Int) (v_ArrVal_1779 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)))) (<= (+ (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1776) |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1779) 4) 8) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1777) |c_ULTIMATE.start_dll_create_~head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1778) 4)))))))) is different from false [2021-12-28 06:03:36,658 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (and (forall ((v_ArrVal_1776 (Array Int Int)) (v_ArrVal_1779 Int)) (<= 0 (+ 4 (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1776) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1779) 4)))) (forall ((v_ArrVal_1777 (Array Int Int)) (v_ArrVal_1776 (Array Int Int)) (v_ArrVal_1778 Int) (v_ArrVal_1779 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (<= (+ 8 (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1776) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1779) 4)) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1777) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1778) 4)))))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|))) is different from false [2021-12-28 06:03:36,676 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 06:03:36,676 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 87 treesize of output 91 [2021-12-28 06:03:36,759 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|) (and (forall ((v_prenex_16 Int) (v_ArrVal_1775 (Array Int Int)) (v_ArrVal_1773 (Array Int Int)) (v_prenex_15 (Array Int Int))) (<= 0 (+ 4 (select (store (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1773) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1775) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_prenex_15) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_prenex_16) 4)))) (forall ((v_ArrVal_1776 (Array Int Int)) (v_ArrVal_1775 (Array Int Int)) (v_ArrVal_1773 (Array Int Int)) (v_ArrVal_1779 Int)) (<= (select (store (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1773) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1775) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1776) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1779) 4) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (forall ((v_ArrVal_1777 (Array Int Int)) (v_ArrVal_1775 (Array Int Int)) (v_ArrVal_1778 Int)) (= (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1775))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1777)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1778) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|))))) is different from false [2021-12-28 06:03:36,851 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|) (and (forall ((v_ArrVal_1777 (Array Int Int)) (v_ArrVal_1775 (Array Int Int)) (v_ArrVal_1772 Int) (v_ArrVal_1778 Int)) (= (select (store (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1772)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1775))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1777)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1778) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_prenex_16 Int) (v_ArrVal_1775 (Array Int Int)) (v_ArrVal_1772 Int) (v_ArrVal_1773 (Array Int Int)) (v_ArrVal_1769 Int) (v_prenex_15 (Array Int Int))) (<= 0 (+ (select (store (select (let ((.cse1 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1 v_ArrVal_1769)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1773) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1 v_ArrVal_1772)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1775) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_prenex_15)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_prenex_16) 4) 4))) (forall ((v_ArrVal_1776 (Array Int Int)) (v_ArrVal_1775 (Array Int Int)) (v_ArrVal_1772 Int) (v_ArrVal_1773 (Array Int Int)) (v_ArrVal_1769 Int) (v_ArrVal_1779 Int)) (<= (select (store (select (let ((.cse2 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2 v_ArrVal_1769)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1773) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2 v_ArrVal_1772)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1775) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_1776)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1779) 4) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)))))) is different from false [2021-12-28 06:03:36,862 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 06:03:36,869 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 06:03:36,869 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 170 treesize of output 181 [2021-12-28 06:03:36,872 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 06:03:36,882 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 06:03:36,882 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 181 treesize of output 181 [2021-12-28 06:03:36,885 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 06:03:36,888 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 06:03:36,889 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 210 treesize of output 192 [2021-12-28 06:03:36,892 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 312 treesize of output 304 [2021-12-28 06:03:36,897 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 06:03:36,907 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 06:03:36,908 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 328 treesize of output 336 [2021-12-28 06:03:36,912 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 06:03:36,916 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 06:03:36,917 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 365 treesize of output 347 [2021-12-28 06:03:36,923 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 549 treesize of output 539 [2021-12-28 06:03:36,930 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 670 treesize of output 656 [2021-12-28 06:03:36,938 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 06:03:36,949 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 06:03:36,950 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 666 treesize of output 660 [2021-12-28 06:03:36,959 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 06:03:36,970 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 06:03:36,971 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 696 treesize of output 702 [2021-12-28 06:03:36,998 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 613 treesize of output 605 [2021-12-28 06:03:37,005 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 605 treesize of output 589 [2021-12-28 06:03:37,013 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 613 treesize of output 609 [2021-12-28 06:03:37,022 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 629 treesize of output 625 [2021-12-28 06:03:37,036 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 06:03:37,037 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 635 treesize of output 628 [2021-12-28 06:03:37,045 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 617 treesize of output 601 [2021-12-28 06:03:37,055 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 673 treesize of output 661 [2021-12-28 06:03:37,064 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 697 treesize of output 691 [2021-12-28 06:03:37,515 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2021-12-28 06:03:37,515 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1559779249] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 06:03:37,516 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 06:03:37,516 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 21] total 51 [2021-12-28 06:03:37,516 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505023128] [2021-12-28 06:03:37,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 06:03:37,516 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2021-12-28 06:03:37,516 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:03:37,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2021-12-28 06:03:37,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1588, Unknown=10, NotChecked=890, Total=2652 [2021-12-28 06:03:37,517 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand has 52 states, 51 states have (on average 2.3333333333333335) internal successors, (119), 52 states have internal predecessors, (119), 0 states have call successors, (0), 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-28 06:03:38,909 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (and (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse0)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (<= 12 (select |c_#length| .cse0)) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_23| Int)) (or (and (forall ((v_ArrVal_1779 Int)) (<= 0 (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1779) 4) 4))) (forall ((v_ArrVal_1778 Int) (v_ArrVal_1779 Int)) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1779) 4) 8) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_23| v_ArrVal_1778) 4))))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_23|))))) is different from false [2021-12-28 06:03:39,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:03:39,324 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2021-12-28 06:03:39,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-28 06:03:39,325 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 2.3333333333333335) internal successors, (119), 52 states have internal predecessors, (119), 0 states have call successors, (0), 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 45 [2021-12-28 06:03:39,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:03:39,325 INFO L225 Difference]: With dead ends: 66 [2021-12-28 06:03:39,325 INFO L226 Difference]: Without dead ends: 66 [2021-12-28 06:03:39,326 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 59 SyntacticMatches, 7 SemanticMatches, 66 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 625 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=360, Invalid=2864, Unknown=12, NotChecked=1320, Total=4556 [2021-12-28 06:03:39,327 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 198 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 1301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 596 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 06:03:39,327 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [198 Valid, 324 Invalid, 1301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 668 Invalid, 0 Unknown, 596 Unchecked, 0.3s Time] [2021-12-28 06:03:39,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2021-12-28 06:03:39,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 60. [2021-12-28 06:03:39,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 55 states have (on average 1.1272727272727272) internal successors, (62), 59 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:03:39,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2021-12-28 06:03:39,328 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 45 [2021-12-28 06:03:39,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:03:39,329 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2021-12-28 06:03:39,329 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 2.3333333333333335) internal successors, (119), 52 states have internal predecessors, (119), 0 states have call successors, (0), 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-28 06:03:39,329 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2021-12-28 06:03:39,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-28 06:03:39,329 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:03:39,329 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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-28 06:03:39,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-12-28 06:03:39,543 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:03:39,543 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 19 more)] === [2021-12-28 06:03:39,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:03:39,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1960736865, now seen corresponding path program 1 times [2021-12-28 06:03:39,544 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:03:39,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258227589] [2021-12-28 06:03:39,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:03:39,544 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:03:39,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:03:39,815 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-28 06:03:39,815 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:03:39,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258227589] [2021-12-28 06:03:39,815 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258227589] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:03:39,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911360605] [2021-12-28 06:03:39,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:03:39,815 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:03:39,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:03:39,817 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 06:03:39,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-12-28 06:03:39,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:03:39,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 66 conjunts are in the unsatisfiable core [2021-12-28 06:03:39,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:03:39,965 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2021-12-28 06:03:40,002 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-28 06:03:40,003 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 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-28 06:03:40,019 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 13 treesize of output 9 [2021-12-28 06:03:40,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 06:03:40,032 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 33 treesize of output 26 [2021-12-28 06:03:40,055 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 06:03:40,055 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2021-12-28 06:03:40,166 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 06:03:40,167 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2021-12-28 06:03:40,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 06:03:40,220 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 28 treesize of output 23