./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/sll2c_update_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/sll2c_update_all.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e86102617f1813255879beda7bab492587801800e6506c4c5cd56fb9179f8713 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-15 23:57:57,028 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 23:57:57,031 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 23:57:57,055 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 23:57:57,055 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 23:57:57,056 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 23:57:57,057 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 23:57:57,059 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 23:57:57,060 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 23:57:57,061 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 23:57:57,062 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 23:57:57,063 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 23:57:57,063 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 23:57:57,064 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 23:57:57,065 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 23:57:57,066 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 23:57:57,067 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 23:57:57,068 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 23:57:57,069 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 23:57:57,071 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 23:57:57,072 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 23:57:57,074 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 23:57:57,075 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 23:57:57,075 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 23:57:57,078 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 23:57:57,078 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 23:57:57,078 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 23:57:57,079 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 23:57:57,079 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 23:57:57,080 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 23:57:57,080 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 23:57:57,081 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 23:57:57,082 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 23:57:57,082 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 23:57:57,083 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 23:57:57,083 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 23:57:57,084 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 23:57:57,084 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 23:57:57,085 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 23:57:57,085 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 23:57:57,086 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 23:57:57,087 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-15 23:57:57,105 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 23:57:57,105 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 23:57:57,105 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 23:57:57,106 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 23:57:57,106 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-15 23:57:57,107 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-15 23:57:57,107 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 23:57:57,107 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 23:57:57,107 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 23:57:57,108 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 23:57:57,108 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 23:57:57,108 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 23:57:57,108 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 23:57:57,108 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 23:57:57,109 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-15 23:57:57,109 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-15 23:57:57,109 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-15 23:57:57,109 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 23:57:57,109 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 23:57:57,110 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 23:57:57,110 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-15 23:57:57,110 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 23:57:57,110 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 23:57:57,110 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-15 23:57:57,110 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 23:57:57,111 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 23:57:57,111 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-15 23:57:57,112 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-15 23:57:57,112 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 23:57:57,112 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-15 23:57:57,112 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-15 23:57:57,112 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-15 23:57:57,113 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-15 23:57:57,113 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 23:57:57,113 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e86102617f1813255879beda7bab492587801800e6506c4c5cd56fb9179f8713 [2021-12-15 23:57:57,326 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 23:57:57,356 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 23:57:57,359 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 23:57:57,360 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 23:57:57,360 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 23:57:57,361 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_update_all.i [2021-12-15 23:57:57,430 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/066446936/4a654b70266f42a2b66d5a0827448293/FLAGbf6a1d45e [2021-12-15 23:57:57,893 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 23:57:57,895 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_update_all.i [2021-12-15 23:57:57,907 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/066446936/4a654b70266f42a2b66d5a0827448293/FLAGbf6a1d45e [2021-12-15 23:57:58,246 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/066446936/4a654b70266f42a2b66d5a0827448293 [2021-12-15 23:57:58,248 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 23:57:58,249 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 23:57:58,250 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 23:57:58,254 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 23:57:58,256 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 23:57:58,256 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 11:57:58" (1/1) ... [2021-12-15 23:57:58,257 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@677c65ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:57:58, skipping insertion in model container [2021-12-15 23:57:58,257 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 11:57:58" (1/1) ... [2021-12-15 23:57:58,262 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 23:57:58,292 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 23:57:58,547 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/sll2c_update_all.i[24418,24431] [2021-12-15 23:57:58,552 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 23:57:58,562 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 23:57:58,599 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/sll2c_update_all.i[24418,24431] [2021-12-15 23:57:58,600 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 23:57:58,622 INFO L208 MainTranslator]: Completed translation [2021-12-15 23:57:58,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:57:58 WrapperNode [2021-12-15 23:57:58,623 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 23:57:58,624 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 23:57:58,624 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 23:57:58,624 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 23:57:58,630 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:57:58" (1/1) ... [2021-12-15 23:57:58,647 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:57:58" (1/1) ... [2021-12-15 23:57:58,668 INFO L137 Inliner]: procedures = 126, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 127 [2021-12-15 23:57:58,671 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 23:57:58,672 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 23:57:58,673 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 23:57:58,673 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 23:57:58,681 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:57:58" (1/1) ... [2021-12-15 23:57:58,681 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:57:58" (1/1) ... [2021-12-15 23:57:58,687 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:57:58" (1/1) ... [2021-12-15 23:57:58,688 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:57:58" (1/1) ... [2021-12-15 23:57:58,693 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:57:58" (1/1) ... [2021-12-15 23:57:58,698 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:57:58" (1/1) ... [2021-12-15 23:57:58,708 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:57:58" (1/1) ... [2021-12-15 23:57:58,715 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 23:57:58,716 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 23:57:58,716 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 23:57:58,716 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 23:57:58,717 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:57:58" (1/1) ... [2021-12-15 23:57:58,724 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 23:57:58,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 23:57:58,744 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-15 23:57:58,749 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-15 23:57:58,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-15 23:57:58,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-15 23:57:58,778 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2021-12-15 23:57:58,778 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2021-12-15 23:57:58,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-15 23:57:58,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 23:57:58,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-15 23:57:58,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-15 23:57:58,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-15 23:57:58,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 23:57:58,780 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 23:57:58,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 23:57:58,924 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 23:57:58,925 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 23:57:59,127 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 23:57:59,136 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 23:57:59,136 INFO L301 CfgBuilder]: Removed 6 assume(true) statements. [2021-12-15 23:57:59,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 11:57:59 BoogieIcfgContainer [2021-12-15 23:57:59,139 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 23:57:59,140 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-15 23:57:59,140 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-15 23:57:59,144 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-15 23:57:59,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 11:57:58" (1/3) ... [2021-12-15 23:57:59,145 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b7e5961 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 11:57:59, skipping insertion in model container [2021-12-15 23:57:59,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:57:58" (2/3) ... [2021-12-15 23:57:59,145 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b7e5961 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 11:57:59, skipping insertion in model container [2021-12-15 23:57:59,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 11:57:59" (3/3) ... [2021-12-15 23:57:59,147 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_update_all.i [2021-12-15 23:57:59,151 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-15 23:57:59,151 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-15 23:57:59,201 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-15 23:57:59,207 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-15 23:57:59,208 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-15 23:57:59,232 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 32 states have (on average 1.5) internal successors, (48), 33 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-15 23:57:59,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-15 23:57:59,237 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:57:59,237 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:57:59,238 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:57:59,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:57:59,242 INFO L85 PathProgramCache]: Analyzing trace with hash 663980757, now seen corresponding path program 1 times [2021-12-15 23:57:59,249 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:57:59,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475437345] [2021-12-15 23:57:59,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:57:59,251 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:57:59,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:57:59,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-15 23:57:59,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:57:59,477 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-15 23:57:59,477 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:57:59,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475437345] [2021-12-15 23:57:59,478 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475437345] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 23:57:59,478 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 23:57:59,478 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 23:57:59,480 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475816518] [2021-12-15 23:57:59,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 23:57:59,484 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 23:57:59,485 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:57:59,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 23:57:59,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 23:57:59,514 INFO L87 Difference]: Start difference. First operand has 37 states, 32 states have (on average 1.5) internal successors, (48), 33 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-15 23:57:59,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:57:59,564 INFO L93 Difference]: Finished difference Result 61 states and 87 transitions. [2021-12-15 23:57:59,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 23:57:59,566 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2021-12-15 23:57:59,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:57:59,572 INFO L225 Difference]: With dead ends: 61 [2021-12-15 23:57:59,572 INFO L226 Difference]: Without dead ends: 28 [2021-12-15 23:57:59,575 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-15 23:57:59,578 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 23:57:59,580 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 23:57:59,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2021-12-15 23:57:59,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2021-12-15 23:57:59,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-15 23:57:59,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2021-12-15 23:57:59,617 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 20 [2021-12-15 23:57:59,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:57:59,618 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2021-12-15 23:57:59,618 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-15 23:57:59,618 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2021-12-15 23:57:59,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-15 23:57:59,620 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:57:59,620 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:57:59,620 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-15 23:57:59,621 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:57:59,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:57:59,623 INFO L85 PathProgramCache]: Analyzing trace with hash 616475652, now seen corresponding path program 1 times [2021-12-15 23:57:59,623 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:57:59,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445111506] [2021-12-15 23:57:59,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:57:59,624 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:57:59,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:57:59,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-15 23:57:59,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:57:59,752 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-15 23:57:59,753 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:57:59,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445111506] [2021-12-15 23:57:59,753 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445111506] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 23:57:59,753 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 23:57:59,753 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 23:57:59,754 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522998140] [2021-12-15 23:57:59,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 23:57:59,755 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 23:57:59,755 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:57:59,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 23:57:59,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 23:57:59,756 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-15 23:57:59,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:57:59,792 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2021-12-15 23:57:59,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 23:57:59,793 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2021-12-15 23:57:59,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:57:59,794 INFO L225 Difference]: With dead ends: 47 [2021-12-15 23:57:59,794 INFO L226 Difference]: Without dead ends: 31 [2021-12-15 23:57:59,798 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 23:57:59,799 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 23:57:59,800 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 79 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 23:57:59,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-12-15 23:57:59,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2021-12-15 23:57:59,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-15 23:57:59,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2021-12-15 23:57:59,813 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 20 [2021-12-15 23:57:59,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:57:59,814 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2021-12-15 23:57:59,814 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-15 23:57:59,814 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2021-12-15 23:57:59,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-15 23:57:59,816 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:57:59,816 INFO L514 BasicCegarLoop]: trace histogram [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-15 23:57:59,817 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-15 23:57:59,817 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:57:59,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:57:59,824 INFO L85 PathProgramCache]: Analyzing trace with hash -600691076, now seen corresponding path program 1 times [2021-12-15 23:57:59,825 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:57:59,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183834270] [2021-12-15 23:57:59,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:57:59,826 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:57:59,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:57:59,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-15 23:57:59,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:57:59,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-15 23:57:59,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:57:59,949 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-15 23:57:59,949 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:57:59,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183834270] [2021-12-15 23:57:59,950 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183834270] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 23:57:59,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2008400467] [2021-12-15 23:57:59,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:57:59,950 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 23:57:59,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 23:57:59,959 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-15 23:57:59,966 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-15 23:58:00,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:58:00,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-15 23:58:00,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:58:00,234 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-15 23:58:00,234 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 23:58:00,235 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2008400467] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 23:58:00,235 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-15 23:58:00,235 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2021-12-15 23:58:00,235 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250649785] [2021-12-15 23:58:00,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 23:58:00,236 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 23:58:00,236 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:58:00,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 23:58:00,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-15 23:58:00,237 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-15 23:58:00,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:58:00,259 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2021-12-15 23:58:00,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 23:58:00,259 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2021-12-15 23:58:00,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:58:00,260 INFO L225 Difference]: With dead ends: 51 [2021-12-15 23:58:00,260 INFO L226 Difference]: Without dead ends: 42 [2021-12-15 23:58:00,261 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-15 23:58:00,262 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 44 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 23:58:00,262 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 51 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 23:58:00,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2021-12-15 23:58:00,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2021-12-15 23:58:00,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-15 23:58:00,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2021-12-15 23:58:00,267 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 28 [2021-12-15 23:58:00,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:58:00,267 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2021-12-15 23:58:00,267 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-15 23:58:00,268 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2021-12-15 23:58:00,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-15 23:58:00,268 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:58:00,268 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:58:00,296 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-15 23:58:00,491 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 23:58:00,492 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:58:00,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:58:00,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1948852891, now seen corresponding path program 1 times [2021-12-15 23:58:00,493 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:58:00,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464424217] [2021-12-15 23:58:00,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:58:00,493 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:58:00,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:58:00,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-15 23:58:00,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:58:00,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-15 23:58:00,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:58:00,599 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-15 23:58:00,599 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:58:00,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464424217] [2021-12-15 23:58:00,600 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464424217] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 23:58:00,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398173928] [2021-12-15 23:58:00,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:58:00,600 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 23:58:00,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 23:58:00,602 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-15 23:58:00,611 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-15 23:58:00,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:58:00,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-15 23:58:00,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:58:00,800 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-15 23:58:00,800 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 23:58:00,881 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-15 23:58:00,881 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1398173928] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 23:58:00,883 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 23:58:00,884 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2021-12-15 23:58:00,884 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481790171] [2021-12-15 23:58:00,884 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 23:58:00,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-15 23:58:00,889 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:58:00,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-15 23:58:00,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-12-15 23:58:00,894 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-15 23:58:01,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:58:01,013 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2021-12-15 23:58:01,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-15 23:58:01,013 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2021-12-15 23:58:01,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:58:01,017 INFO L225 Difference]: With dead ends: 66 [2021-12-15 23:58:01,017 INFO L226 Difference]: Without dead ends: 57 [2021-12-15 23:58:01,018 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2021-12-15 23:58:01,020 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 69 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 23:58:01,021 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 152 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 23:58:01,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2021-12-15 23:58:01,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 35. [2021-12-15 23:58:01,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-15 23:58:01,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2021-12-15 23:58:01,033 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 33 [2021-12-15 23:58:01,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:58:01,033 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2021-12-15 23:58:01,034 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-15 23:58:01,034 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2021-12-15 23:58:01,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-15 23:58:01,035 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:58:01,035 INFO L514 BasicCegarLoop]: trace histogram [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-15 23:58:01,053 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-15 23:58:01,243 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2021-12-15 23:58:01,244 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:58:01,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:58:01,244 INFO L85 PathProgramCache]: Analyzing trace with hash 2072516636, now seen corresponding path program 2 times [2021-12-15 23:58:01,244 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:58:01,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977445956] [2021-12-15 23:58:01,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:58:01,245 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:58:01,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:58:01,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-15 23:58:01,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:58:01,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-15 23:58:01,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:58:01,352 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-15 23:58:01,352 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:58:01,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977445956] [2021-12-15 23:58:01,352 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977445956] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 23:58:01,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111249515] [2021-12-15 23:58:01,353 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 23:58:01,353 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 23:58:01,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 23:58:01,354 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-15 23:58:01,372 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-15 23:58:01,481 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-15 23:58:01,482 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 23:58:01,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-15 23:58:01,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:58:01,581 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-15 23:58:01,582 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 23:58:01,666 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-15 23:58:01,666 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [111249515] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 23:58:01,667 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 23:58:01,667 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 11 [2021-12-15 23:58:01,667 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553956544] [2021-12-15 23:58:01,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 23:58:01,668 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-15 23:58:01,669 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:58:01,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-15 23:58:01,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-12-15 23:58:01,670 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 10 states have internal predecessors, (49), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-15 23:58:01,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:58:01,836 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2021-12-15 23:58:01,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-15 23:58:01,837 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 10 states have internal predecessors, (49), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 38 [2021-12-15 23:58:01,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:58:01,838 INFO L225 Difference]: With dead ends: 61 [2021-12-15 23:58:01,838 INFO L226 Difference]: Without dead ends: 47 [2021-12-15 23:58:01,838 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2021-12-15 23:58:01,839 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 76 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 23:58:01,841 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 210 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 23:58:01,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-12-15 23:58:01,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 36. [2021-12-15 23:58:01,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-15 23:58:01,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2021-12-15 23:58:01,847 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 38 [2021-12-15 23:58:01,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:58:01,848 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2021-12-15 23:58:01,848 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 10 states have internal predecessors, (49), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-15 23:58:01,848 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2021-12-15 23:58:01,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-15 23:58:01,849 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:58:01,849 INFO L514 BasicCegarLoop]: trace histogram [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-15 23:58:01,870 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-15 23:58:02,063 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 23:58:02,064 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:58:02,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:58:02,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1973765418, now seen corresponding path program 1 times [2021-12-15 23:58:02,065 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:58:02,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540998359] [2021-12-15 23:58:02,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:58:02,065 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:58:02,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:58:02,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-15 23:58:02,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:58:02,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-15 23:58:02,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:58:02,658 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 23:58:02,658 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:58:02,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540998359] [2021-12-15 23:58:02,658 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540998359] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 23:58:02,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540388223] [2021-12-15 23:58:02,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:58:02,659 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 23:58:02,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 23:58:02,660 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-15 23:58:02,661 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-15 23:58:02,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:58:02,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 98 conjunts are in the unsatisfiable core [2021-12-15 23:58:02,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:58:02,815 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-15 23:58:03,009 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-15 23:58:03,009 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-15 23:58:03,059 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 23:58:03,126 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 23:58:03,127 INFO L388 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 19 treesize of output 22 [2021-12-15 23:58:03,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:58:03,301 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2021-12-15 23:58:03,306 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-15 23:58:03,435 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2021-12-15 23:58:03,522 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-15 23:58:03,709 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-15 23:58:03,774 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 23:58:03,774 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 23:58:03,930 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_513 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (forall ((v_ArrVal_513 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~len~0#1|))) is different from false [2021-12-15 23:58:03,971 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_513 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_513) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (forall ((v_ArrVal_513 (Array Int Int))) (<= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_513) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~len~0#1|))) is different from false [2021-12-15 23:58:03,993 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_513 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_513) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (forall ((v_ArrVal_513 (Array Int Int))) (<= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_513) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~len~0#1|))) is different from false [2021-12-15 23:58:04,032 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 23:58:04,033 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2021-12-15 23:58:04,042 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 23:58:04,043 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 67 [2021-12-15 23:58:04,048 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2021-12-15 23:58:04,124 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 23:58:04,125 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2021-12-15 23:58:04,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:58:04,130 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 52 [2021-12-15 23:58:04,134 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2021-12-15 23:58:04,297 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_508 (Array Int Int)) (v_ArrVal_509 Int)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_508) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4) v_ArrVal_509) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) is different from false [2021-12-15 23:58:04,307 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 23:58:04,308 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2021-12-15 23:58:04,311 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2021-12-15 23:58:04,313 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2021-12-15 23:58:04,326 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2021-12-15 23:58:04,814 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2021-12-15 23:58:04,814 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [540388223] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 23:58:04,815 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 23:58:04,815 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 22] total 57 [2021-12-15 23:58:04,815 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978308981] [2021-12-15 23:58:04,815 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 23:58:04,816 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2021-12-15 23:58:04,816 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:58:04,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2021-12-15 23:58:04,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=2577, Unknown=4, NotChecked=420, Total=3192 [2021-12-15 23:58:04,818 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 57 states, 56 states have (on average 1.6071428571428572) internal successors, (90), 48 states have internal predecessors, (90), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2021-12-15 23:58:05,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:58:05,863 INFO L93 Difference]: Finished difference Result 91 states and 107 transitions. [2021-12-15 23:58:05,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-15 23:58:05,864 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 1.6071428571428572) internal successors, (90), 48 states have internal predecessors, (90), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 39 [2021-12-15 23:58:05,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:58:05,866 INFO L225 Difference]: With dead ends: 91 [2021-12-15 23:58:05,866 INFO L226 Difference]: Without dead ends: 89 [2021-12-15 23:58:05,868 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 43 SyntacticMatches, 6 SemanticMatches, 67 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 991 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=340, Invalid=3832, Unknown=4, NotChecked=516, Total=4692 [2021-12-15 23:58:05,868 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 102 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 333 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-15 23:58:05,869 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 558 Invalid, 931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 566 Invalid, 0 Unknown, 333 Unchecked, 0.3s Time] [2021-12-15 23:58:05,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-12-15 23:58:05,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 64. [2021-12-15 23:58:05,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 58 states have internal predecessors, (69), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-15 23:58:05,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2021-12-15 23:58:05,882 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 39 [2021-12-15 23:58:05,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:58:05,882 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2021-12-15 23:58:05,883 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 1.6071428571428572) internal successors, (90), 48 states have internal predecessors, (90), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2021-12-15 23:58:05,883 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2021-12-15 23:58:05,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-15 23:58:05,884 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:58:05,884 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-15 23:58:05,910 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-15 23:58:06,104 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 23:58:06,105 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:58:06,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:58:06,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1005531927, now seen corresponding path program 1 times [2021-12-15 23:58:06,106 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:58:06,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622233886] [2021-12-15 23:58:06,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:58:06,106 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:58:06,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:58:06,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-15 23:58:06,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:58:06,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-15 23:58:06,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:58:06,215 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-15 23:58:06,215 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:58:06,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622233886] [2021-12-15 23:58:06,215 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622233886] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 23:58:06,215 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 23:58:06,216 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 23:58:06,216 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703019976] [2021-12-15 23:58:06,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 23:58:06,216 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 23:58:06,216 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:58:06,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 23:58:06,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 23:58:06,217 INFO L87 Difference]: Start difference. First operand 64 states and 75 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-15 23:58:06,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:58:06,250 INFO L93 Difference]: Finished difference Result 81 states and 94 transitions. [2021-12-15 23:58:06,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-15 23:58:06,250 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 40 [2021-12-15 23:58:06,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:58:06,251 INFO L225 Difference]: With dead ends: 81 [2021-12-15 23:58:06,252 INFO L226 Difference]: Without dead ends: 73 [2021-12-15 23:58:06,252 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-15 23:58:06,253 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 18 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 23:58:06,253 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 97 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 23:58:06,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-12-15 23:58:06,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 66. [2021-12-15 23:58:06,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 60 states have (on average 1.1666666666666667) internal successors, (70), 60 states have internal predecessors, (70), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-15 23:58:06,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 76 transitions. [2021-12-15 23:58:06,261 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 76 transitions. Word has length 40 [2021-12-15 23:58:06,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:58:06,261 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 76 transitions. [2021-12-15 23:58:06,262 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-15 23:58:06,262 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 76 transitions. [2021-12-15 23:58:06,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-15 23:58:06,263 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:58:06,263 INFO L514 BasicCegarLoop]: trace histogram [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-15 23:58:06,263 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-15 23:58:06,263 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:58:06,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:58:06,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1440509788, now seen corresponding path program 2 times [2021-12-15 23:58:06,264 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:58:06,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634478154] [2021-12-15 23:58:06,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:58:06,265 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:58:06,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:58:06,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-15 23:58:06,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:58:06,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-15 23:58:06,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:58:06,334 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-15 23:58:06,335 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:58:06,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634478154] [2021-12-15 23:58:06,335 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634478154] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 23:58:06,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245816435] [2021-12-15 23:58:06,335 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 23:58:06,336 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 23:58:06,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 23:58:06,337 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-15 23:58:06,349 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-15 23:58:06,468 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-15 23:58:06,468 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 23:58:06,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-15 23:58:06,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:58:06,542 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-15 23:58:06,542 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 23:58:06,598 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-15 23:58:06,599 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1245816435] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 23:58:06,599 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 23:58:06,599 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 8 [2021-12-15 23:58:06,599 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772221767] [2021-12-15 23:58:06,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 23:58:06,600 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-15 23:58:06,600 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:58:06,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-15 23:58:06,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-15 23:58:06,601 INFO L87 Difference]: Start difference. First operand 66 states and 76 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-15 23:58:06,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:58:06,660 INFO L93 Difference]: Finished difference Result 107 states and 123 transitions. [2021-12-15 23:58:06,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-15 23:58:06,661 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 40 [2021-12-15 23:58:06,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:58:06,662 INFO L225 Difference]: With dead ends: 107 [2021-12-15 23:58:06,662 INFO L226 Difference]: Without dead ends: 85 [2021-12-15 23:58:06,663 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-12-15 23:58:06,663 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 67 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 23:58:06,664 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 110 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 23:58:06,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-12-15 23:58:06,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 68. [2021-12-15 23:58:06,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 62 states have (on average 1.1129032258064515) internal successors, (69), 62 states have internal predecessors, (69), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-15 23:58:06,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2021-12-15 23:58:06,672 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 40 [2021-12-15 23:58:06,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:58:06,672 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2021-12-15 23:58:06,673 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-15 23:58:06,673 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2021-12-15 23:58:06,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-15 23:58:06,674 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:58:06,674 INFO L514 BasicCegarLoop]: trace histogram [2, 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] [2021-12-15 23:58:06,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-12-15 23:58:06,899 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 23:58:06,899 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:58:06,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:58:06,900 INFO L85 PathProgramCache]: Analyzing trace with hash 896238913, now seen corresponding path program 1 times [2021-12-15 23:58:06,900 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:58:06,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363137934] [2021-12-15 23:58:06,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:58:06,900 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:58:06,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:58:06,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-15 23:58:06,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:58:06,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-15 23:58:06,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:58:06,991 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-15 23:58:06,991 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:58:06,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363137934] [2021-12-15 23:58:06,991 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363137934] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 23:58:06,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244679201] [2021-12-15 23:58:06,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:58:06,992 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 23:58:06,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 23:58:06,993 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-15 23:58:06,994 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-15 23:58:07,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:58:07,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-15 23:58:07,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:58:07,211 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-15 23:58:07,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 23:58:07,286 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-15 23:58:07,286 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [244679201] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 23:58:07,286 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 23:58:07,287 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2021-12-15 23:58:07,287 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285515646] [2021-12-15 23:58:07,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 23:58:07,287 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-15 23:58:07,288 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:58:07,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-15 23:58:07,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-15 23:58:07,288 INFO L87 Difference]: Start difference. First operand 68 states and 75 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-15 23:58:07,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:58:07,349 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2021-12-15 23:58:07,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-15 23:58:07,350 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2021-12-15 23:58:07,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:58:07,351 INFO L225 Difference]: With dead ends: 83 [2021-12-15 23:58:07,351 INFO L226 Difference]: Without dead ends: 75 [2021-12-15 23:58:07,351 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-12-15 23:58:07,352 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 35 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 23:58:07,352 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 124 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 23:58:07,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-12-15 23:58:07,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 69. [2021-12-15 23:58:07,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 63 states have internal predecessors, (70), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-15 23:58:07,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 76 transitions. [2021-12-15 23:58:07,360 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 76 transitions. Word has length 45 [2021-12-15 23:58:07,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:58:07,360 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 76 transitions. [2021-12-15 23:58:07,360 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-15 23:58:07,361 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2021-12-15 23:58:07,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-15 23:58:07,361 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:58:07,362 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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-15 23:58:07,390 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-15 23:58:07,587 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 23:58:07,587 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:58:07,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:58:07,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1969553287, now seen corresponding path program 3 times [2021-12-15 23:58:07,588 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:58:07,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928056608] [2021-12-15 23:58:07,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:58:07,588 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:58:07,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:58:07,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-15 23:58:07,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:58:07,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-15 23:58:07,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:58:07,703 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-15 23:58:07,703 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:58:07,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928056608] [2021-12-15 23:58:07,704 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928056608] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 23:58:07,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631272343] [2021-12-15 23:58:07,704 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-15 23:58:07,704 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 23:58:07,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 23:58:07,705 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-15 23:58:07,707 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-15 23:58:07,995 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-12-15 23:58:07,995 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 23:58:07,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-15 23:58:08,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:58:08,120 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-15 23:58:08,120 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 23:58:08,120 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631272343] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 23:58:08,121 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-15 23:58:08,121 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 11 [2021-12-15 23:58:08,121 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874386313] [2021-12-15 23:58:08,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 23:58:08,122 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-15 23:58:08,122 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:58:08,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-15 23:58:08,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-12-15 23:58:08,123 INFO L87 Difference]: Start difference. First operand 69 states and 76 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-15 23:58:08,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:58:08,158 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2021-12-15 23:58:08,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-15 23:58:08,158 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2021-12-15 23:58:08,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:58:08,159 INFO L225 Difference]: With dead ends: 92 [2021-12-15 23:58:08,159 INFO L226 Difference]: Without dead ends: 72 [2021-12-15 23:58:08,160 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-12-15 23:58:08,160 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 26 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 23:58:08,161 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 81 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 23:58:08,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-12-15 23:58:08,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2021-12-15 23:58:08,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 64 states have (on average 1.0625) internal successors, (68), 64 states have internal predecessors, (68), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-15 23:58:08,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2021-12-15 23:58:08,168 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 45 [2021-12-15 23:58:08,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:58:08,168 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2021-12-15 23:58:08,169 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-15 23:58:08,169 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2021-12-15 23:58:08,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-12-15 23:58:08,170 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:58:08,170 INFO L514 BasicCegarLoop]: trace histogram [2, 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] [2021-12-15 23:58:08,197 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-15 23:58:08,397 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 23:58:08,398 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:58:08,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:58:08,398 INFO L85 PathProgramCache]: Analyzing trace with hash 2065256414, now seen corresponding path program 1 times [2021-12-15 23:58:08,398 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:58:08,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915736991] [2021-12-15 23:58:08,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:58:08,399 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:58:08,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:58:08,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-15 23:58:08,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:58:08,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-15 23:58:09,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:58:09,074 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 23:58:09,074 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:58:09,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915736991] [2021-12-15 23:58:09,074 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915736991] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 23:58:09,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104343177] [2021-12-15 23:58:09,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:58:09,075 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 23:58:09,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 23:58:09,076 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-15 23:58:09,077 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-15 23:58:09,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:58:09,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 106 conjunts are in the unsatisfiable core [2021-12-15 23:58:09,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:58:09,230 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-15 23:58:09,426 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-15 23:58:09,427 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-15 23:58:09,473 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 23:58:09,525 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 23:58:09,525 INFO L388 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 19 treesize of output 22 [2021-12-15 23:58:09,665 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-15 23:58:09,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:58:09,690 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2021-12-15 23:58:09,884 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 23:58:09,884 INFO L388 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 56 treesize of output 53 [2021-12-15 23:58:09,888 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2021-12-15 23:58:09,890 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-12-15 23:58:10,217 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2021-12-15 23:58:10,223 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-12-15 23:58:10,266 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-15 23:58:10,314 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 23:58:10,315 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 23:58:10,607 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 64 [2021-12-15 23:58:10,627 WARN L838 $PredicateComparison]: unable to prove that (and (= (+ |c_ULTIMATE.start_main_~len~0#1| 1) |c_ULTIMATE.start_sll_circular_update_at_~data#1|) (forall ((v_ArrVal_1087 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1087) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|)) (forall ((v_ArrVal_1088 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1088) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|))) is different from false [2021-12-15 23:58:10,647 WARN L838 $PredicateComparison]: unable to prove that (and (= (+ |c_ULTIMATE.start_main_~len~0#1| 1) |c_ULTIMATE.start_sll_circular_update_at_~data#1|) (forall ((v_ArrVal_1088 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1088) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse0))) (forall ((v_ArrVal_1087 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_1087) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|)))) is different from false [2021-12-15 23:58:10,660 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1087 (Array Int Int))) (= (select (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|) v_ArrVal_1087) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (= 1 |c_ULTIMATE.start_main_~i~0#1|) (forall ((v_ArrVal_1088 (Array Int 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|))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1088) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse0)))) is different from false [2021-12-15 23:58:10,671 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1087 (Array Int Int))) (= (select (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|) v_ArrVal_1087) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (= 0 |c_ULTIMATE.start_main_~i~0#1|) (forall ((v_ArrVal_1088 (Array Int 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|))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1088) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse0)))) is different from false [2021-12-15 23:58:10,688 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 230 treesize of output 214 [2021-12-15 23:58:10,692 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 170 [2021-12-15 23:58:10,699 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 162 [2021-12-15 23:58:10,802 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_1084 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4) v_ArrVal_1084)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) (and (or .cse0 (= |c_ULTIMATE.start_main_~s~0#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|)) (forall ((v_ArrVal_1084 Int) (v_ArrVal_1088 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4) v_ArrVal_1084)))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (= (select (select (store .cse1 .cse2 v_ArrVal_1088) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse2)))) .cse0 (= 0 |c_ULTIMATE.start_main_~i~0#1|))) is different from false [2021-12-15 23:58:10,812 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1084 Int) (v_ArrVal_1088 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4) v_ArrVal_1084)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (= (select (select (store .cse0 .cse1 v_ArrVal_1088) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse1)))) (forall ((v_ArrVal_1084 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4) v_ArrVal_1084)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (= 0 |c_ULTIMATE.start_main_~i~0#1|)) is different from false [2021-12-15 23:58:12,857 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20| Int)) (or (and (forall ((v_ArrVal_1084 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20| 4) v_ArrVal_1084) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (= 0 |c_ULTIMATE.start_main_~i~0#1|) (forall ((v_ArrVal_1084 Int) (v_ArrVal_1088 (Array Int Int))) (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20| 4) v_ArrVal_1084))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~s~0#1.offset|))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse0) .cse1 v_ArrVal_1088) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse1))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20| |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2021-12-15 23:58:14,893 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20| Int)) (or (and (forall ((v_ArrVal_1084 Int)) (not (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20| 4) v_ArrVal_1084) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)))) (forall ((v_ArrVal_1084 Int) (v_ArrVal_1088 (Array Int Int))) (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20| 4) v_ArrVal_1084))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base| .cse0) .cse1 v_ArrVal_1088) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) .cse1))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20| |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) is different from false [2021-12-15 23:58:14,945 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20| Int)) (or (and (forall ((v_ArrVal_1082 (Array Int Int)) (v_ArrVal_1084 Int)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1082) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20| 4) v_ArrVal_1084) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (forall ((v_ArrVal_1082 (Array Int Int)) (v_ArrVal_1084 Int) (v_ArrVal_1088 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1082))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20| 4) v_ArrVal_1084))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse1) .cse2 v_ArrVal_1088) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) .cse2)))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) is different from false [2021-12-15 23:58:14,979 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 23:58:14,979 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 76 [2021-12-15 23:58:14,983 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 119 [2021-12-15 23:58:14,986 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 23:58:14,987 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 74 [2021-12-15 23:58:14,990 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 23:58:14,992 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 55 [2021-12-15 23:58:14,995 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 51 [2021-12-15 23:58:14,998 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 23:58:15,000 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2021-12-15 23:58:15,411 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2021-12-15 23:58:15,411 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1104343177] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 23:58:15,411 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 23:58:15,411 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24, 26] total 65 [2021-12-15 23:58:15,411 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208652074] [2021-12-15 23:58:15,412 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 23:58:15,412 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2021-12-15 23:58:15,412 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:58:15,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2021-12-15 23:58:15,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=2935, Unknown=9, NotChecked=1044, Total=4160 [2021-12-15 23:58:15,414 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand has 65 states, 64 states have (on average 1.75) internal successors, (112), 56 states have internal predecessors, (112), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2021-12-15 23:58:17,675 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (and (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (<= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (<= 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= .cse0 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 0) (<= |c_ULTIMATE.start_main_~len~0#1| 2) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse0)) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20| Int)) (or (and (forall ((v_ArrVal_1082 (Array Int Int)) (v_ArrVal_1084 Int)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1082) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20| 4) v_ArrVal_1084) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (forall ((v_ArrVal_1082 (Array Int Int)) (v_ArrVal_1084 Int) (v_ArrVal_1088 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1082))) (let ((.cse2 (store (select .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20| 4) v_ArrVal_1084))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (= (select (select (store (store .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse2) .cse3 v_ArrVal_1088) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) .cse3)))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))) is different from false [2021-12-15 23:58:19,678 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20| Int)) (or (and (forall ((v_ArrVal_1084 Int)) (not (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20| 4) v_ArrVal_1084) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)))) (forall ((v_ArrVal_1084 Int) (v_ArrVal_1088 (Array Int Int))) (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20| 4) v_ArrVal_1084))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base| .cse0) .cse1 v_ArrVal_1088) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) .cse1))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20| |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (<= |c_ULTIMATE.start_main_~len~0#1| 2) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) 0) (not (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)))) is different from false [2021-12-15 23:58:21,682 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_main_~len~0#1| 2) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20| Int)) (or (and (forall ((v_ArrVal_1084 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20| 4) v_ArrVal_1084) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (= 0 |c_ULTIMATE.start_main_~i~0#1|) (forall ((v_ArrVal_1084 Int) (v_ArrVal_1088 (Array Int Int))) (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20| 4) v_ArrVal_1084))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~s~0#1.offset|))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse0) .cse1 v_ArrVal_1088) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse1))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_20| |c_ULTIMATE.start_main_~s~0#1.offset|))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) is different from false [2021-12-15 23:58:22,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:58:22,731 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2021-12-15 23:58:22,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-15 23:58:22,731 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 64 states have (on average 1.75) internal successors, (112), 56 states have internal predecessors, (112), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 46 [2021-12-15 23:58:22,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:58:22,732 INFO L225 Difference]: With dead ends: 85 [2021-12-15 23:58:22,732 INFO L226 Difference]: Without dead ends: 80 [2021-12-15 23:58:22,734 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 48 SyntacticMatches, 9 SemanticMatches, 79 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 783 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=307, Invalid=4421, Unknown=12, NotChecked=1740, Total=6480 [2021-12-15 23:58:22,734 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 70 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 1178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 339 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-15 23:58:22,735 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 664 Invalid, 1178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 822 Invalid, 0 Unknown, 339 Unchecked, 0.4s Time] [2021-12-15 23:58:22,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-12-15 23:58:22,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 73. [2021-12-15 23:58:22,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 67 states have (on average 1.0597014925373134) internal successors, (71), 67 states have internal predecessors, (71), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-15 23:58:22,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2021-12-15 23:58:22,742 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 46 [2021-12-15 23:58:22,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:58:22,742 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2021-12-15 23:58:22,743 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 64 states have (on average 1.75) internal successors, (112), 56 states have internal predecessors, (112), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2021-12-15 23:58:22,743 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2021-12-15 23:58:22,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-12-15 23:58:22,743 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:58:22,744 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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-15 23:58:22,766 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-15 23:58:22,963 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,SelfDestructingSolverStorable10 [2021-12-15 23:58:22,964 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:58:22,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:58:22,964 INFO L85 PathProgramCache]: Analyzing trace with hash -2101316258, now seen corresponding path program 4 times [2021-12-15 23:58:22,964 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:58:22,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798014459] [2021-12-15 23:58:22,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:58:22,965 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:58:22,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:58:23,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-15 23:58:23,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:58:23,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-15 23:58:23,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:58:23,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-15 23:58:23,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:58:23,049 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-15 23:58:23,049 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:58:23,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798014459] [2021-12-15 23:58:23,049 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798014459] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 23:58:23,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185268661] [2021-12-15 23:58:23,050 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-15 23:58:23,050 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 23:58:23,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 23:58:23,051 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-15 23:58:23,079 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-15 23:58:23,206 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-15 23:58:23,206 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 23:58:23,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-15 23:58:23,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:58:23,272 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-15 23:58:23,273 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-15 23:58:23,273 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1185268661] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 23:58:23,273 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-15 23:58:23,273 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2021-12-15 23:58:23,273 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135820754] [2021-12-15 23:58:23,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 23:58:23,274 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 23:58:23,274 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:58:23,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 23:58:23,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-15 23:58:23,275 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-15 23:58:23,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:58:23,289 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2021-12-15 23:58:23,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 23:58:23,290 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 47 [2021-12-15 23:58:23,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:58:23,290 INFO L225 Difference]: With dead ends: 80 [2021-12-15 23:58:23,290 INFO L226 Difference]: Without dead ends: 43 [2021-12-15 23:58:23,291 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-15 23:58:23,291 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 40 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 23:58:23,292 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 38 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 23:58:23,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2021-12-15 23:58:23,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2021-12-15 23:58:23,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-15 23:58:23,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2021-12-15 23:58:23,298 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 47 [2021-12-15 23:58:23,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:58:23,298 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2021-12-15 23:58:23,298 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-15 23:58:23,298 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2021-12-15 23:58:23,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-12-15 23:58:23,299 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:58:23,300 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 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] [2021-12-15 23:58:23,331 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-15 23:58:23,527 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 23:58:23,527 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:58:23,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:58:23,528 INFO L85 PathProgramCache]: Analyzing trace with hash -349906719, now seen corresponding path program 2 times [2021-12-15 23:58:23,528 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:58:23,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667285048] [2021-12-15 23:58:23,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:58:23,528 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:58:23,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:58:23,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-15 23:58:23,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:58:23,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-15 23:58:23,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:58:23,600 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-15 23:58:23,601 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:58:23,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667285048] [2021-12-15 23:58:23,601 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667285048] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 23:58:23,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876812334] [2021-12-15 23:58:23,601 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 23:58:23,602 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 23:58:23,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 23:58:23,603 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-15 23:58:23,630 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-15 23:58:23,770 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-15 23:58:23,771 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 23:58:23,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-15 23:58:23,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:58:23,865 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-15 23:58:23,865 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 23:58:23,946 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-15 23:58:23,946 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [876812334] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 23:58:23,947 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 23:58:23,947 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 8 [2021-12-15 23:58:23,947 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410768126] [2021-12-15 23:58:23,947 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 23:58:23,948 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-15 23:58:23,948 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:58:23,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-15 23:58:23,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-15 23:58:23,949 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-15 23:58:24,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:58:24,014 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2021-12-15 23:58:24,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-15 23:58:24,014 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 47 [2021-12-15 23:58:24,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:58:24,015 INFO L225 Difference]: With dead ends: 43 [2021-12-15 23:58:24,015 INFO L226 Difference]: Without dead ends: 0 [2021-12-15 23:58:24,015 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2021-12-15 23:58:24,015 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 26 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 23:58:24,016 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 80 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 23:58:24,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-15 23:58:24,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-15 23:58:24,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 23:58:24,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-15 23:58:24,016 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 47 [2021-12-15 23:58:24,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:58:24,017 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-15 23:58:24,017 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 7 states have internal predecessors, (57), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-15 23:58:24,017 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-15 23:58:24,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-15 23:58:24,019 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-15 23:58:24,042 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-15 23:58:24,231 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,SelfDestructingSolverStorable12 [2021-12-15 23:58:24,233 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-15 23:58:39,200 WARN L227 SmtUtils]: Spent 14.02s on a formula simplification. DAG size of input: 50 DAG size of output: 30 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter)