./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.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/sll2n_update_all_reverse.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 60a477b5dcc7be77af17ce3cc379f1876781ed95f896fb2ca2dbb7ba91ecb849 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-15 23:58:58,151 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 23:58:58,155 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 23:58:58,188 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 23:58:58,191 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 23:58:58,193 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 23:58:58,195 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 23:58:58,196 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 23:58:58,197 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 23:58:58,197 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 23:58:58,198 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 23:58:58,198 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 23:58:58,199 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 23:58:58,199 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 23:58:58,200 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 23:58:58,201 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 23:58:58,201 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 23:58:58,202 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 23:58:58,203 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 23:58:58,204 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 23:58:58,205 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 23:58:58,216 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 23:58:58,217 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 23:58:58,218 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 23:58:58,221 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 23:58:58,225 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 23:58:58,225 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 23:58:58,226 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 23:58:58,226 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 23:58:58,227 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 23:58:58,227 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 23:58:58,228 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 23:58:58,230 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 23:58:58,230 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 23:58:58,231 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 23:58:58,232 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 23:58:58,232 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 23:58:58,232 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 23:58:58,233 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 23:58:58,233 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 23:58:58,234 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 23:58:58,234 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:58:58,263 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 23:58:58,263 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 23:58:58,264 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 23:58:58,264 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 23:58:58,264 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-15 23:58:58,265 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-15 23:58:58,265 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 23:58:58,265 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 23:58:58,265 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 23:58:58,266 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 23:58:58,266 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 23:58:58,266 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 23:58:58,266 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 23:58:58,267 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 23:58:58,267 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-15 23:58:58,267 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-15 23:58:58,267 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-15 23:58:58,267 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 23:58:58,267 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 23:58:58,267 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 23:58:58,268 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-15 23:58:58,268 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 23:58:58,268 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 23:58:58,268 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-15 23:58:58,268 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 23:58:58,268 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 23:58:58,269 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-15 23:58:58,269 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-15 23:58:58,269 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 23:58:58,269 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-15 23:58:58,269 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-15 23:58:58,269 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-15 23:58:58,270 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-15 23:58:58,270 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 23:58:58,270 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 -> 60a477b5dcc7be77af17ce3cc379f1876781ed95f896fb2ca2dbb7ba91ecb849 [2021-12-15 23:58:58,455 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 23:58:58,479 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 23:58:58,481 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 23:58:58,482 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 23:58:58,482 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 23:58:58,483 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2021-12-15 23:58:58,525 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfeffdc89/6b38d11e27f743349f1b94a1a569601d/FLAG17f0d63fc [2021-12-15 23:58:58,905 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 23:58:58,906 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2021-12-15 23:58:58,913 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfeffdc89/6b38d11e27f743349f1b94a1a569601d/FLAG17f0d63fc [2021-12-15 23:58:58,923 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfeffdc89/6b38d11e27f743349f1b94a1a569601d [2021-12-15 23:58:58,924 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 23:58:58,925 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 23:58:58,926 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 23:58:58,926 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 23:58:58,928 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 23:58:58,929 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 11:58:58" (1/1) ... [2021-12-15 23:58:58,930 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b912070 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:58:58, skipping insertion in model container [2021-12-15 23:58:58,930 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 11:58:58" (1/1) ... [2021-12-15 23:58:58,934 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 23:58:58,962 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 23:58:59,160 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/sll2n_update_all_reverse.i[24236,24249] [2021-12-15 23:58:59,162 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 23:58:59,175 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 23:58:59,207 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/sll2n_update_all_reverse.i[24236,24249] [2021-12-15 23:58:59,209 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 23:58:59,229 INFO L208 MainTranslator]: Completed translation [2021-12-15 23:58:59,230 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:58:59 WrapperNode [2021-12-15 23:58:59,230 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 23:58:59,231 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 23:58:59,231 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 23:58:59,231 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 23:58:59,237 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:58:59" (1/1) ... [2021-12-15 23:58:59,249 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:58:59" (1/1) ... [2021-12-15 23:58:59,265 INFO L137 Inliner]: procedures = 126, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 118 [2021-12-15 23:58:59,265 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 23:58:59,266 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 23:58:59,266 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 23:58:59,266 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 23:58:59,273 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:58:59" (1/1) ... [2021-12-15 23:58:59,273 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:58:59" (1/1) ... [2021-12-15 23:58:59,276 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:58:59" (1/1) ... [2021-12-15 23:58:59,276 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:58:59" (1/1) ... [2021-12-15 23:58:59,281 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:58:59" (1/1) ... [2021-12-15 23:58:59,285 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:58:59" (1/1) ... [2021-12-15 23:58:59,286 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:58:59" (1/1) ... [2021-12-15 23:58:59,288 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 23:58:59,288 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 23:58:59,288 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 23:58:59,288 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 23:58:59,295 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:58:59" (1/1) ... [2021-12-15 23:58:59,305 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 23:58:59,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 23:58:59,323 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:58:59,324 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:58:59,348 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-15 23:58:59,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-15 23:58:59,349 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-15 23:58:59,349 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 23:58:59,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-15 23:58:59,349 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-15 23:58:59,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-15 23:58:59,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 23:58:59,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 23:58:59,350 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 23:58:59,425 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 23:58:59,426 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 23:58:59,546 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 23:58:59,551 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 23:58:59,551 INFO L301 CfgBuilder]: Removed 6 assume(true) statements. [2021-12-15 23:58:59,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 11:58:59 BoogieIcfgContainer [2021-12-15 23:58:59,552 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 23:58:59,554 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-15 23:58:59,554 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-15 23:58:59,556 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-15 23:58:59,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 11:58:58" (1/3) ... [2021-12-15 23:58:59,557 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7abb5cdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 11:58:59, skipping insertion in model container [2021-12-15 23:58:59,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:58:59" (2/3) ... [2021-12-15 23:58:59,557 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7abb5cdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 11:58:59, skipping insertion in model container [2021-12-15 23:58:59,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 11:58:59" (3/3) ... [2021-12-15 23:58:59,558 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2n_update_all_reverse.i [2021-12-15 23:58:59,561 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-15 23:58:59,562 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-15 23:58:59,591 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-15 23:58:59,595 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:58:59,596 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-15 23:58:59,605 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 29 states have internal predecessors, (43), 0 states have call successors, (0), 0 states 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:59,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-15 23:58:59,609 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:58:59,610 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:58:59,610 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:58:59,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:58:59,614 INFO L85 PathProgramCache]: Analyzing trace with hash -204150994, now seen corresponding path program 1 times [2021-12-15 23:58:59,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:58:59,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999827191] [2021-12-15 23:58:59,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:58:59,621 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:58:59,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:58: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:58:59,753 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:58:59,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999827191] [2021-12-15 23:58:59,754 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999827191] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 23:58:59,754 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 23:58:59,754 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 23:58:59,755 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906567892] [2021-12-15 23:58:59,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 23:58:59,759 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-15 23:58:59,759 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:58:59,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-15 23:58:59,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-15 23:58:59,788 INFO L87 Difference]: Start difference. First operand has 30 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 29 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states 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:59,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:58:59,804 INFO L93 Difference]: Finished difference Result 52 states and 75 transitions. [2021-12-15 23:58:59,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-15 23:58:59,806 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-12-15 23:58:59,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:58:59,811 INFO L225 Difference]: With dead ends: 52 [2021-12-15 23:58:59,812 INFO L226 Difference]: Without dead ends: 23 [2021-12-15 23:58:59,814 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-15 23:58:59,817 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 23:58:59,818 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 23:58:59,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2021-12-15 23:58:59,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2021-12-15 23:58:59,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 23:58:59,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2021-12-15 23:58:59,844 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 13 [2021-12-15 23:58:59,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:58:59,844 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2021-12-15 23:58:59,844 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states 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:59,845 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2021-12-15 23:58:59,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-15 23:58:59,845 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:58:59,845 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:58:59,846 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-15 23:58:59,846 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:58:59,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:58:59,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1517700322, now seen corresponding path program 1 times [2021-12-15 23:58:59,849 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:58:59,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993650433] [2021-12-15 23:58:59,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:58:59,850 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:58:59,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:58:59,927 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:58:59,927 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:58:59,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993650433] [2021-12-15 23:58:59,928 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993650433] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 23:58:59,929 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 23:58:59,929 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 23:58:59,929 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588672868] [2021-12-15 23:58:59,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 23:58:59,930 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 23:58:59,931 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:58:59,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 23:58:59,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 23:58:59,932 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states 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:59,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:58:59,952 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2021-12-15 23:58:59,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 23:58:59,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-12-15 23:58:59,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:58:59,954 INFO L225 Difference]: With dead ends: 44 [2021-12-15 23:58:59,954 INFO L226 Difference]: Without dead ends: 28 [2021-12-15 23:58:59,957 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 23:58:59,958 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 4 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 23:58:59,960 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 48 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 23:58:59,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2021-12-15 23:58:59,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2021-12-15 23:58:59,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 23:58:59,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2021-12-15 23:58:59,967 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 13 [2021-12-15 23:58:59,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:58:59,968 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2021-12-15 23:58:59,968 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states 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:59,968 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2021-12-15 23:58:59,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-15 23:58:59,969 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:58:59,969 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:58:59,969 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-15 23:58:59,970 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:58:59,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:58:59,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1110902602, now seen corresponding path program 1 times [2021-12-15 23:58:59,971 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:58:59,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915836428] [2021-12-15 23:58:59,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:58:59,971 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:59:00,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:59:00,041 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 23:59:00,042 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:59:00,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915836428] [2021-12-15 23:59:00,042 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915836428] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 23:59:00,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468015971] [2021-12-15 23:59:00,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:59:00,044 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 23:59:00,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 23:59:00,045 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:59:00,046 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:59:00,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:59:00,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-15 23:59:00,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:59:00,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 23:59:00,198 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 23:59:00,252 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 23:59:00,253 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468015971] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 23:59:00,253 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 23:59:00,253 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2021-12-15 23:59:00,253 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122311407] [2021-12-15 23:59:00,253 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 23:59:00,254 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 23:59:00,254 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:59:00,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 23:59:00,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-12-15 23:59:00,255 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 23:59:00,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:59:00,267 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2021-12-15 23:59:00,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 23:59:00,268 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-12-15 23:59:00,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:59:00,268 INFO L225 Difference]: With dead ends: 45 [2021-12-15 23:59:00,269 INFO L226 Difference]: Without dead ends: 29 [2021-12-15 23:59:00,269 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-12-15 23:59:00,270 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 8 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 23:59:00,270 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 71 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 23:59:00,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-12-15 23:59:00,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2021-12-15 23:59:00,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 23:59:00,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2021-12-15 23:59:00,273 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 18 [2021-12-15 23:59:00,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:59:00,273 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2021-12-15 23:59:00,273 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 23:59:00,274 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2021-12-15 23:59:00,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-15 23:59:00,274 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:59:00,274 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:59:00,295 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:59:00,487 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:59:00,488 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:59:00,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:59:00,488 INFO L85 PathProgramCache]: Analyzing trace with hash 266893854, now seen corresponding path program 2 times [2021-12-15 23:59:00,488 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:59:00,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067299144] [2021-12-15 23:59:00,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:59:00,488 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:59:00,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:59:00,579 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-15 23:59:00,579 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:59:00,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067299144] [2021-12-15 23:59:00,580 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067299144] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 23:59:00,580 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 23:59:00,580 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 23:59:00,580 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786096145] [2021-12-15 23:59:00,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 23:59:00,581 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 23:59:00,581 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:59:00,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 23:59:00,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-15 23:59:00,581 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states 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:59:00,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:59:00,607 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2021-12-15 23:59:00,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 23:59:00,608 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-15 23:59:00,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:59:00,610 INFO L225 Difference]: With dead ends: 51 [2021-12-15 23:59:00,611 INFO L226 Difference]: Without dead ends: 42 [2021-12-15 23:59:00,611 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-15 23:59:00,612 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 30 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 23:59:00,612 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 41 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 23:59:00,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2021-12-15 23:59:00,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2021-12-15 23:59:00,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 23:59:00,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2021-12-15 23:59:00,616 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 23 [2021-12-15 23:59:00,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:59:00,616 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2021-12-15 23:59:00,616 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states 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:59:00,616 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2021-12-15 23:59:00,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-15 23:59:00,617 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:59:00,617 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:59:00,617 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-15 23:59:00,617 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:59:00,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:59:00,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1444962716, now seen corresponding path program 1 times [2021-12-15 23:59:00,618 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:59:00,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857298596] [2021-12-15 23:59:00,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:59:00,618 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:59:00,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:59:00,679 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-15 23:59:00,679 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:59:00,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857298596] [2021-12-15 23:59:00,680 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857298596] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 23:59:00,681 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 23:59:00,681 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 23:59:00,681 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202539180] [2021-12-15 23:59:00,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 23:59:00,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 23:59:00,681 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:59:00,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 23:59:00,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-15 23:59:00,683 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 23:59:00,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:59:00,726 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2021-12-15 23:59:00,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 23:59:00,727 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-12-15 23:59:00,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:59:00,727 INFO L225 Difference]: With dead ends: 57 [2021-12-15 23:59:00,728 INFO L226 Difference]: Without dead ends: 43 [2021-12-15 23:59:00,728 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-12-15 23:59:00,729 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 30 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 23:59:00,729 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 58 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 23:59:00,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2021-12-15 23:59:00,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2021-12-15 23:59:00,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 23:59:00,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2021-12-15 23:59:00,735 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 28 [2021-12-15 23:59:00,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:59:00,735 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2021-12-15 23:59:00,735 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 23:59:00,735 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2021-12-15 23:59:00,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-15 23:59:00,736 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:59:00,736 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:59:00,736 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-15 23:59:00,736 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:59:00,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:59:00,737 INFO L85 PathProgramCache]: Analyzing trace with hash 46899759, now seen corresponding path program 1 times [2021-12-15 23:59:00,737 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:59:00,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122127090] [2021-12-15 23:59:00,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:59:00,737 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:59:00,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:59:00,789 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-15 23:59:00,789 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:59:00,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122127090] [2021-12-15 23:59:00,790 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122127090] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 23:59:00,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806720893] [2021-12-15 23:59:00,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:59:00,790 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 23:59:00,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 23:59:00,791 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:59:00,792 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:59:00,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:59:00,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-15 23:59:00,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:59:00,948 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-15 23:59:00,948 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 23:59:01,009 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-15 23:59:01,009 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1806720893] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 23:59:01,009 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 23:59:01,009 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2021-12-15 23:59:01,010 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039644654] [2021-12-15 23:59:01,010 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 23:59:01,010 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-15 23:59:01,011 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:59:01,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-15 23:59:01,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-12-15 23:59:01,011 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 0 states have call successors, (0), 0 states 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:59:01,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:59:01,044 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2021-12-15 23:59:01,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 23:59:01,046 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-15 23:59:01,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:59:01,047 INFO L225 Difference]: With dead ends: 54 [2021-12-15 23:59:01,048 INFO L226 Difference]: Without dead ends: 45 [2021-12-15 23:59:01,049 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-12-15 23:59:01,050 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 35 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 23:59:01,050 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 61 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 23:59:01,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2021-12-15 23:59:01,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 36. [2021-12-15 23:59:01,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 0 states have call successors, (0), 0 states 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:59:01,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2021-12-15 23:59:01,055 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 29 [2021-12-15 23:59:01,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:59:01,055 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2021-12-15 23:59:01,056 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 0 states have call successors, (0), 0 states 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:59:01,056 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2021-12-15 23:59:01,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-15 23:59:01,056 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:59:01,056 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] [2021-12-15 23:59:01,074 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:59:01,262 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-12-15 23:59:01,263 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:59:01,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:59:01,264 INFO L85 PathProgramCache]: Analyzing trace with hash 402168875, now seen corresponding path program 2 times [2021-12-15 23:59:01,264 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:59:01,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801193046] [2021-12-15 23:59:01,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:59:01,264 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:59:01,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:59:01,337 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-15 23:59:01,337 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:59:01,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801193046] [2021-12-15 23:59:01,337 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801193046] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 23:59:01,337 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 23:59:01,337 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 23:59:01,338 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325433420] [2021-12-15 23:59:01,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 23:59:01,338 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 23:59:01,338 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:59:01,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 23:59:01,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-15 23:59:01,340 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 23:59:01,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:59:01,368 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2021-12-15 23:59:01,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 23:59:01,368 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-12-15 23:59:01,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:59:01,371 INFO L225 Difference]: With dead ends: 53 [2021-12-15 23:59:01,371 INFO L226 Difference]: Without dead ends: 45 [2021-12-15 23:59:01,371 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-15 23:59:01,373 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 23 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 23:59:01,373 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 59 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 23:59:01,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2021-12-15 23:59:01,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 38. [2021-12-15 23:59:01,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 0 states have call successors, (0), 0 states 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:59:01,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2021-12-15 23:59:01,384 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 34 [2021-12-15 23:59:01,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:59:01,385 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2021-12-15 23:59:01,385 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 23:59:01,385 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2021-12-15 23:59:01,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-15 23:59:01,386 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:59:01,386 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] [2021-12-15 23:59:01,386 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-15 23:59:01,386 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:59:01,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:59:01,386 INFO L85 PathProgramCache]: Analyzing trace with hash -366012659, now seen corresponding path program 1 times [2021-12-15 23:59:01,387 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:59:01,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535782408] [2021-12-15 23:59:01,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:59:01,387 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:59:01,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:59:01,950 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 23:59:01,951 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:59:01,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535782408] [2021-12-15 23:59:01,951 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535782408] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 23:59:01,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710851085] [2021-12-15 23:59:01,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:59:01,951 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 23:59:01,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 23:59:01,953 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:59:01,954 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:59:02,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:59:02,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 96 conjunts are in the unsatisfiable core [2021-12-15 23:59:02,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:59:02,063 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:59:02,097 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-15 23:59:02,097 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:59:02,133 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 13 treesize of output 9 [2021-12-15 23:59:02,138 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:59:02,318 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-15 23:59:02,321 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 64 treesize of output 61 [2021-12-15 23:59:02,330 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 29 treesize of output 19 [2021-12-15 23:59:02,333 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 59 treesize of output 59 [2021-12-15 23:59:02,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:59:02,453 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 58 treesize of output 49 [2021-12-15 23:59:02,463 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 45 treesize of output 41 [2021-12-15 23:59:02,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:59:02,470 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 50 treesize of output 45 [2021-12-15 23:59:02,575 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 68 treesize of output 48 [2021-12-15 23:59:02,579 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 48 treesize of output 32 [2021-12-15 23:59:02,630 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 36 treesize of output 20 [2021-12-15 23:59:02,693 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-15 23:59:02,694 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 23:59:02,837 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_355 Int) (v_ArrVal_354 Int) (v_ArrVal_353 (Array Int Int))) (<= (+ (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_353) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_355)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_354)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) 1) (* 2 |c_ULTIMATE.start_main_~len~0#1|))) (forall ((v_ArrVal_355 Int) (v_ArrVal_354 Int) (v_ArrVal_353 (Array Int Int))) (<= (* 2 |c_ULTIMATE.start_main_~len~0#1|) (+ (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_353) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_355)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_354)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) 1)))) is different from false [2021-12-15 23:59:02,902 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_9| Int)) (or (and (forall ((v_ArrVal_355 Int) (v_ArrVal_354 Int) (v_ArrVal_353 (Array Int Int))) (<= (+ (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_353) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_355) .cse0)) (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_354) .cse0))) 1) (* 2 |c_ULTIMATE.start_main_~len~0#1|))) (forall ((v_ArrVal_355 Int) (v_ArrVal_354 Int) (v_ArrVal_353 (Array Int Int))) (<= (* 2 |c_ULTIMATE.start_main_~len~0#1|) (+ (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_353) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_355) .cse1)) (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_354) .cse1))) 1)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_9|))) is different from false [2021-12-15 23:59:02,985 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 23:59:02,986 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 93 treesize of output 86 [2021-12-15 23:59:03,009 INFO L354 Elim1Store]: treesize reduction 90, result has 30.8 percent of original size [2021-12-15 23:59:03,009 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 190 treesize of output 169 [2021-12-15 23:59:03,020 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 125 treesize of output 111 [2021-12-15 23:59:03,025 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 111 treesize of output 97 [2021-12-15 23:59:03,122 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_9| Int)) (or (let ((.cse1 (+ |c_ULTIMATE.start_sll_update_at_~data#1| 1)) (.cse0 (* 2 |c_ULTIMATE.start_main_~len~0#1|))) (and (<= .cse0 .cse1) (forall ((v_ArrVal_355 Int) (v_ArrVal_349 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_349) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_355) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_ArrVal_354 Int) (v_ArrVal_350 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_350) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_354) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) (<= .cse1 .cse0) (forall ((v_ArrVal_355 Int) (v_ArrVal_349 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_349) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_355) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_sll_update_at_~head#1.base|)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_9|))) is different from false [2021-12-15 23:59:03,217 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_9| Int)) (or (let ((.cse1 (+ |c_ULTIMATE.start_sll_update_at_~data#1| 1)) (.cse0 (* 2 |c_ULTIMATE.start_main_~len~0#1|))) (and (forall ((v_ArrVal_355 Int) (v_ArrVal_349 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)) v_ArrVal_349) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_355) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~s~0#1.base|))) (<= .cse0 .cse1) (forall ((v_ArrVal_354 Int) (v_ArrVal_350 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4))) (= (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse2) v_ArrVal_350) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_354) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse2)))) (<= .cse1 .cse0) (forall ((v_ArrVal_355 Int) (v_ArrVal_349 (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_349) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_355) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) .cse3))))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_9|))) is different from false [2021-12-15 23:59:03,259 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_9| Int)) (or (let ((.cse1 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (forall ((v_ArrVal_355 Int) (v_ArrVal_349 (Array Int Int))) (not (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) v_ArrVal_349) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_355) .cse0)) |c_ULTIMATE.start_main_~s~0#1.base|))) (<= |c_ULTIMATE.start_main_~len~0#1| .cse1) (forall ((v_ArrVal_355 Int) (v_ArrVal_349 (Array Int Int))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse3))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_349) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_355) .cse3) .cse2)))) (forall ((v_ArrVal_354 Int) (v_ArrVal_350 (Array Int Int))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (= (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse4) v_ArrVal_350) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_354) .cse4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse4)))) (<= .cse1 |c_ULTIMATE.start_main_~len~0#1|))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_9|))) is different from false [2021-12-15 23:59:03,301 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_9| Int)) (or (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_9|) (and (forall ((v_ArrVal_354 Int) (v_ArrVal_350 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (= (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse0) v_ArrVal_350) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_354) .cse0) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse0)))) (forall ((v_ArrVal_355 Int) (v_ArrVal_349 (Array Int Int))) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1) v_ArrVal_349) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_355) .cse1)) |c_ULTIMATE.start_sll_create_#res#1.base|))) (forall ((v_ArrVal_355 Int) (v_ArrVal_349 (Array Int Int))) (let ((.cse3 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse3))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_349) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_355) .cse3) .cse2))))))) is different from false [2021-12-15 23:59:03,335 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_9| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_9|) (and (forall ((v_ArrVal_355 Int) (v_ArrVal_349 (Array Int Int))) (not (= (let ((.cse0 (+ |c_ULTIMATE.start_sll_create_~head~0#1.offset| 4))) (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse0) v_ArrVal_349) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_355) .cse0)) |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (forall ((v_ArrVal_354 Int) (v_ArrVal_350 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_~head~0#1.offset| 4))) (= (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1) v_ArrVal_350) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_354) .cse1) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1)))) (forall ((v_ArrVal_355 Int) (v_ArrVal_349 (Array Int Int))) (let ((.cse3 (+ |c_ULTIMATE.start_sll_create_~head~0#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse3))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_349) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_355) .cse3) .cse2))))))) is different from false [2021-12-15 23:59:03,398 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 23:59:03,398 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 90 treesize of output 81 [2021-12-15 23:59:03,400 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 23:59:03,401 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 66 treesize of output 62 [2021-12-15 23:59:03,403 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 92 treesize of output 86 [2021-12-15 23:59:03,405 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 23:59:03,406 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 80 treesize of output 68 [2021-12-15 23:59:03,409 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 23:59:03,410 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 44 treesize of output 40 [2021-12-15 23:59:03,411 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 23:59:03,412 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 37 treesize of output 33 [2021-12-15 23:59:03,414 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 23:59:03,415 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 30 treesize of output 26 [2021-12-15 23:59:03,530 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2021-12-15 23:59:03,531 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1710851085] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 23:59:03,531 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 23:59:03,531 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 20] total 43 [2021-12-15 23:59:03,531 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290407881] [2021-12-15 23:59:03,531 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 23:59:03,533 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2021-12-15 23:59:03,533 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:59:03,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-12-15 23:59:03,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1167, Unknown=7, NotChecked=518, Total=1806 [2021-12-15 23:59:03,536 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 43 states, 43 states have (on average 1.9069767441860466) internal successors, (82), 43 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 23:59:05,712 WARN L838 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (= 1 (select |c_#valid| |c_ULTIMATE.start_node_create_#res#1.base|)) (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_sll_create_~head~0#1.offset| 4)) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_9| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_9|) (and (forall ((v_ArrVal_355 Int) (v_ArrVal_349 (Array Int Int))) (not (= (let ((.cse0 (+ |c_ULTIMATE.start_sll_create_~head~0#1.offset| 4))) (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse0) v_ArrVal_349) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_355) .cse0)) |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (forall ((v_ArrVal_354 Int) (v_ArrVal_350 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_~head~0#1.offset| 4))) (= (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1) v_ArrVal_350) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_354) .cse1) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1)))) (forall ((v_ArrVal_355 Int) (v_ArrVal_349 (Array Int Int))) (let ((.cse3 (+ |c_ULTIMATE.start_sll_create_~head~0#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse3))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_349) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_355) .cse3) .cse2))))))) (= 1 (select |c_#valid| |c_ULTIMATE.start_node_create_~temp~0#1.base|)) (= 1 (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (<= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)) is different from false [2021-12-15 23:59:07,717 WARN L838 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_sll_create_~head~0#1.offset| 4)) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_9| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_9|) (and (forall ((v_ArrVal_355 Int) (v_ArrVal_349 (Array Int Int))) (not (= (let ((.cse0 (+ |c_ULTIMATE.start_sll_create_~head~0#1.offset| 4))) (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse0) v_ArrVal_349) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_355) .cse0)) |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (forall ((v_ArrVal_354 Int) (v_ArrVal_350 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_~head~0#1.offset| 4))) (= (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1) v_ArrVal_350) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_354) .cse1) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1)))) (forall ((v_ArrVal_355 Int) (v_ArrVal_349 (Array Int Int))) (let ((.cse3 (+ |c_ULTIMATE.start_sll_create_~head~0#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse3))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_349) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_355) .cse3) .cse2))))))) (= 1 (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (<= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)) is different from false [2021-12-15 23:59:09,720 WARN L838 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) (+ |c_ULTIMATE.start_sll_create_~head~0#1.offset| 4)) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_9| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_9|) (and (forall ((v_ArrVal_355 Int) (v_ArrVal_349 (Array Int Int))) (not (= (let ((.cse0 (+ |c_ULTIMATE.start_sll_create_~head~0#1.offset| 4))) (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse0) v_ArrVal_349) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_355) .cse0)) |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (forall ((v_ArrVal_354 Int) (v_ArrVal_350 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_~head~0#1.offset| 4))) (= (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1) v_ArrVal_350) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_354) .cse1) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1)))) (forall ((v_ArrVal_355 Int) (v_ArrVal_349 (Array Int Int))) (let ((.cse3 (+ |c_ULTIMATE.start_sll_create_~head~0#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse3))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_349) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_355) .cse3) .cse2))))))) (<= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)) is different from false [2021-12-15 23:59:11,736 WARN L838 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_sll_create_#res#1.offset|) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_9| Int)) (or (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_9|) (and (forall ((v_ArrVal_354 Int) (v_ArrVal_350 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (= (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse0) v_ArrVal_350) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_354) .cse0) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse0)))) (forall ((v_ArrVal_355 Int) (v_ArrVal_349 (Array Int Int))) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1) v_ArrVal_349) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_355) .cse1)) |c_ULTIMATE.start_sll_create_#res#1.base|))) (forall ((v_ArrVal_355 Int) (v_ArrVal_349 (Array Int Int))) (let ((.cse3 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) .cse3))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_349) |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_355) .cse3) .cse2))))))) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4)) |c_ULTIMATE.start_sll_create_#res#1.base|)) (<= |c_ULTIMATE.start_sll_create_#res#1.offset| 0)) is different from false [2021-12-15 23:59:13,741 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (<= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (<= |c_ULTIMATE.start_main_~len~0#1| .cse0) (< 0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 1)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_9| Int)) (or (let ((.cse2 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (forall ((v_ArrVal_355 Int) (v_ArrVal_349 (Array Int Int))) (not (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) v_ArrVal_349) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_355) .cse1)) |c_ULTIMATE.start_main_~s~0#1.base|))) (<= |c_ULTIMATE.start_main_~len~0#1| .cse2) (forall ((v_ArrVal_355 Int) (v_ArrVal_349 (Array Int Int))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse4))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_349) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_355) .cse4) .cse3)))) (forall ((v_ArrVal_354 Int) (v_ArrVal_350 (Array Int Int))) (let ((.cse5 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (= (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse5) v_ArrVal_350) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_354) .cse5) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse5)))) (<= .cse2 |c_ULTIMATE.start_main_~len~0#1|))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_9|))) (<= .cse0 |c_ULTIMATE.start_main_~len~0#1|) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~s~0#1.base|)))) is different from false [2021-12-15 23:59:15,761 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4))) (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse0)) (.cse1 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse5 (+ |c_ULTIMATE.start_sll_update_at_~data#1| 1)) (.cse4 (* 2 |c_ULTIMATE.start_main_~len~0#1|))) (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse0)) (= |c_ULTIMATE.start_main_~s~0#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.offset|) (= |c_ULTIMATE.start_sll_update_at_~data#1| (+ |c_ULTIMATE.start_main_~i~0#1| |c_ULTIMATE.start_main_~len~0#1|)) (<= .cse1 |c_ULTIMATE.start_main_~len~0#1|) (not (= (select .cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~s~0#1.base|)) (= .cse3 (select .cse2 4)) (not (= .cse3 |c_ULTIMATE.start_main_~s~0#1.base|)) (<= .cse4 .cse5) (<= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_update_at_~head#1.offset| |c_ULTIMATE.start_main_~s~0#1.offset|) (<= |c_ULTIMATE.start_main_~len~0#1| .cse1) (< 0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 1)) (= |c_ULTIMATE.start_sll_update_at_~head#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) (<= .cse5 .cse4) (= 0 |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_9| Int)) (or (let ((.cse7 (+ |c_ULTIMATE.start_sll_update_at_~data#1| 1)) (.cse6 (* 2 |c_ULTIMATE.start_main_~len~0#1|))) (and (forall ((v_ArrVal_355 Int) (v_ArrVal_349 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)) v_ArrVal_349) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_355) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~s~0#1.base|))) (<= .cse6 .cse7) (forall ((v_ArrVal_354 Int) (v_ArrVal_350 (Array Int Int))) (let ((.cse8 (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4))) (= (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse8) v_ArrVal_350) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_354) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse8)))) (<= .cse7 .cse6) (forall ((v_ArrVal_355 Int) (v_ArrVal_349 (Array Int Int))) (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse9 v_ArrVal_349) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_355) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) .cse9))))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_9|)))))) is different from false [2021-12-15 23:59:17,764 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_ULTIMATE.start_sll_update_at_~head#1.offset|) (<= |c_ULTIMATE.start_main_~len~0#1| .cse0) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_9| Int)) (or (let ((.cse2 (+ |c_ULTIMATE.start_sll_update_at_~data#1| 1)) (.cse1 (* 2 |c_ULTIMATE.start_main_~len~0#1|))) (and (<= .cse1 .cse2) (forall ((v_ArrVal_355 Int) (v_ArrVal_349 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_349) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_355) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_ArrVal_354 Int) (v_ArrVal_350 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_350) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_354) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) (<= .cse2 .cse1) (forall ((v_ArrVal_355 Int) (v_ArrVal_349 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_349) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_355) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_sll_update_at_~head#1.base|)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_9|))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_ULTIMATE.start_sll_update_at_~head#1.base|) (= |c_ULTIMATE.start_sll_update_at_~data#1| (+ |c_ULTIMATE.start_main_~i~0#1| |c_ULTIMATE.start_main_~len~0#1|)) (= 0 |c_ULTIMATE.start_main_~s~0#1.offset|) (<= .cse0 |c_ULTIMATE.start_main_~len~0#1|) (not (= |c_ULTIMATE.start_sll_update_at_~head#1.base| |c_ULTIMATE.start_main_~s~0#1.base|)))) is different from false [2021-12-15 23:59:17,770 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (<= |c_ULTIMATE.start_main_~len~0#1| .cse0) (not (= .cse1 |c_ULTIMATE.start_main_~s~0#1.base|)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_9| Int)) (or (and (forall ((v_ArrVal_355 Int) (v_ArrVal_354 Int) (v_ArrVal_353 (Array Int Int))) (<= (+ (let ((.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_353) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_355) .cse2)) (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_354) .cse2))) 1) (* 2 |c_ULTIMATE.start_main_~len~0#1|))) (forall ((v_ArrVal_355 Int) (v_ArrVal_354 Int) (v_ArrVal_353 (Array Int Int))) (<= (* 2 |c_ULTIMATE.start_main_~len~0#1|) (+ (let ((.cse3 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_353) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_355) .cse3)) (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_354) .cse3))) 1)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_9|))) (= 0 |c_ULTIMATE.start_main_~s~0#1.offset|) (= (select (select |c_#memory_int| .cse1) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (+ |c_ULTIMATE.start_main_~i~0#1| |c_ULTIMATE.start_main_~len~0#1|)) (<= .cse0 |c_ULTIMATE.start_main_~len~0#1|))) is different from false [2021-12-15 23:59:17,776 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (let ((.cse1 (+ (select (select |c_#memory_int| .cse2) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4)) 1)) (.cse0 (* 2 |c_ULTIMATE.start_main_~len~0#1|))) (and (<= .cse0 .cse1) (not (= .cse2 |c_ULTIMATE.start_main_~s~0#1.base|)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_9| Int)) (or (and (forall ((v_ArrVal_355 Int) (v_ArrVal_354 Int) (v_ArrVal_353 (Array Int Int))) (<= (+ (let ((.cse3 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_353) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_355) .cse3)) (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_354) .cse3))) 1) (* 2 |c_ULTIMATE.start_main_~len~0#1|))) (forall ((v_ArrVal_355 Int) (v_ArrVal_354 Int) (v_ArrVal_353 (Array Int Int))) (<= (* 2 |c_ULTIMATE.start_main_~len~0#1|) (+ (let ((.cse4 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_353) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_355) .cse4)) (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_9| v_ArrVal_354) .cse4))) 1)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_9|))) (= 0 |c_ULTIMATE.start_main_~s~0#1.offset|) (<= .cse1 .cse0)))) is different from false [2021-12-15 23:59:18,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:59:18,072 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2021-12-15 23:59:18,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-15 23:59:18,072 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.9069767441860466) internal successors, (82), 43 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-12-15 23:59:18,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:59:18,074 INFO L225 Difference]: With dead ends: 77 [2021-12-15 23:59:18,074 INFO L226 Difference]: Without dead ends: 75 [2021-12-15 23:59:18,075 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 39 SyntacticMatches, 10 SemanticMatches, 61 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=261, Invalid=1949, Unknown=16, NotChecked=1680, Total=3906 [2021-12-15 23:59:18,076 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 69 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 245 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 23:59:18,076 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 183 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 367 Invalid, 0 Unknown, 245 Unchecked, 0.2s Time] [2021-12-15 23:59:18,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-12-15 23:59:18,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 55. [2021-12-15 23:59:18,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.1851851851851851) internal successors, (64), 54 states have internal predecessors, (64), 0 states have call successors, (0), 0 states 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:59:18,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2021-12-15 23:59:18,082 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 35 [2021-12-15 23:59:18,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:59:18,082 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2021-12-15 23:59:18,082 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 1.9069767441860466) internal successors, (82), 43 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 23:59:18,082 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2021-12-15 23:59:18,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-15 23:59:18,083 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:59:18,083 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:59:18,103 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:59:18,295 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 23:59:18,296 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:59:18,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:59:18,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1590163563, now seen corresponding path program 2 times [2021-12-15 23:59:18,296 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:59:18,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501951801] [2021-12-15 23:59:18,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:59:18,296 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:59:18,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:59:18,357 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-15 23:59:18,357 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:59:18,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501951801] [2021-12-15 23:59:18,357 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501951801] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 23:59:18,358 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 23:59:18,358 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-15 23:59:18,358 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085817065] [2021-12-15 23:59:18,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 23:59:18,358 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-15 23:59:18,359 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:59:18,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-15 23:59:18,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-15 23:59:18,359 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 23:59:18,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:59:18,384 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2021-12-15 23:59:18,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-15 23:59:18,384 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-12-15 23:59:18,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:59:18,385 INFO L225 Difference]: With dead ends: 64 [2021-12-15 23:59:18,385 INFO L226 Difference]: Without dead ends: 56 [2021-12-15 23:59:18,387 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-12-15 23:59:18,388 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 27 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 23:59:18,388 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 40 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 23:59:18,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2021-12-15 23:59:18,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2021-12-15 23:59:18,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.1636363636363636) internal successors, (64), 55 states have internal predecessors, (64), 0 states have call successors, (0), 0 states 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:59:18,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2021-12-15 23:59:18,394 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 36 [2021-12-15 23:59:18,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:59:18,394 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2021-12-15 23:59:18,394 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 23:59:18,394 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2021-12-15 23:59:18,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-15 23:59:18,395 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:59:18,395 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:59:18,395 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-15 23:59:18,395 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:59:18,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:59:18,396 INFO L85 PathProgramCache]: Analyzing trace with hash 108045400, now seen corresponding path program 3 times [2021-12-15 23:59:18,396 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:59:18,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550605600] [2021-12-15 23:59:18,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:59:18,396 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:59:18,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:59:18,442 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-15 23:59:18,443 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:59:18,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550605600] [2021-12-15 23:59:18,443 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550605600] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 23:59:18,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041671700] [2021-12-15 23:59:18,443 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-15 23:59:18,443 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 23:59:18,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 23:59:18,444 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:59:18,445 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:59:18,561 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-12-15 23:59:18,561 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 23:59:18,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-15 23:59:18,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:59:18,644 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-15 23:59:18,645 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 23:59:18,693 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-15 23:59:18,694 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041671700] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-15 23:59:18,694 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-12-15 23:59:18,694 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 10 [2021-12-15 23:59:18,694 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81092176] [2021-12-15 23:59:18,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 23:59:18,694 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-15 23:59:18,695 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:59:18,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 23:59:18,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-12-15 23:59:18,695 INFO L87 Difference]: Start difference. First operand 56 states and 64 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states 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:59:18,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:59:18,718 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2021-12-15 23:59:18,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 23:59:18,718 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-12-15 23:59:18,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:59:18,719 INFO L225 Difference]: With dead ends: 73 [2021-12-15 23:59:18,719 INFO L226 Difference]: Without dead ends: 61 [2021-12-15 23:59:18,719 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-12-15 23:59:18,720 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 19 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 23:59:18,720 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 50 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 23:59:18,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-12-15 23:59:18,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 56. [2021-12-15 23:59:18,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.1636363636363636) internal successors, (64), 55 states have internal predecessors, (64), 0 states have call successors, (0), 0 states 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:59:18,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2021-12-15 23:59:18,725 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 36 [2021-12-15 23:59:18,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:59:18,725 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2021-12-15 23:59:18,726 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states 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:59:18,726 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2021-12-15 23:59:18,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-15 23:59:18,726 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:59:18,726 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:59:18,746 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:59:18,939 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 23:59:18,939 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:59:18,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:59:18,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1465345254, now seen corresponding path program 4 times [2021-12-15 23:59:18,940 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:59:18,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914995222] [2021-12-15 23:59:18,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:59:18,940 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:59:18,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:59:19,011 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-15 23:59:19,011 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:59:19,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914995222] [2021-12-15 23:59:19,012 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914995222] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 23:59:19,012 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 23:59:19,012 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-15 23:59:19,012 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42519888] [2021-12-15 23:59:19,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 23:59:19,012 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-15 23:59:19,012 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:59:19,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-15 23:59:19,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-15 23:59:19,013 INFO L87 Difference]: Start difference. First operand 56 states and 64 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 23:59:19,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:59:19,037 INFO L93 Difference]: Finished difference Result 78 states and 90 transitions. [2021-12-15 23:59:19,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-15 23:59:19,037 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-12-15 23:59:19,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:59:19,038 INFO L225 Difference]: With dead ends: 78 [2021-12-15 23:59:19,038 INFO L226 Difference]: Without dead ends: 56 [2021-12-15 23:59:19,039 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2021-12-15 23:59:19,039 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 41 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 23:59:19,039 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 34 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 23:59:19,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2021-12-15 23:59:19,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2021-12-15 23:59:19,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.1272727272727272) internal successors, (62), 55 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 23:59:19,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2021-12-15 23:59:19,049 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 36 [2021-12-15 23:59:19,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:59:19,049 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2021-12-15 23:59:19,050 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 23:59:19,050 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2021-12-15 23:59:19,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-15 23:59:19,050 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:59:19,051 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] [2021-12-15 23:59:19,051 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-15 23:59:19,051 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:59:19,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:59:19,051 INFO L85 PathProgramCache]: Analyzing trace with hash -5958248, now seen corresponding path program 1 times [2021-12-15 23:59:19,051 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:59:19,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694907567] [2021-12-15 23:59:19,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:59:19,052 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:59:19,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:59:19,232 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-15 23:59:19,233 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:59:19,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694907567] [2021-12-15 23:59:19,233 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694907567] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 23:59:19,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028195399] [2021-12-15 23:59:19,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:59:19,233 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 23:59:19,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 23:59:19,234 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:59:19,235 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:59:19,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:59:19,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 53 conjunts are in the unsatisfiable core [2021-12-15 23:59:19,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:59:19,422 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 15 treesize of output 11 [2021-12-15 23:59:19,571 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 29 treesize of output 13 [2021-12-15 23:59:19,607 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-15 23:59:19,607 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 23:59:19,730 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 36 treesize of output 32 [2021-12-15 23:59:19,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:59:19,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 23:59:19,816 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-15 23:59:19,816 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2028195399] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 23:59:19,816 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 23:59:19,816 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 11] total 26 [2021-12-15 23:59:19,817 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208614122] [2021-12-15 23:59:19,817 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 23:59:19,817 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-12-15 23:59:19,817 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:59:19,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-15 23:59:19,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=556, Unknown=0, NotChecked=0, Total=650 [2021-12-15 23:59:19,818 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand has 26 states, 26 states have (on average 3.5) internal successors, (91), 26 states have internal predecessors, (91), 0 states have call successors, (0), 0 states 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:59:20,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:59:20,198 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2021-12-15 23:59:20,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-15 23:59:20,199 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.5) internal successors, (91), 26 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2021-12-15 23:59:20,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:59:20,199 INFO L225 Difference]: With dead ends: 77 [2021-12-15 23:59:20,199 INFO L226 Difference]: Without dead ends: 75 [2021-12-15 23:59:20,200 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 64 SyntacticMatches, 5 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=214, Invalid=842, Unknown=0, NotChecked=0, Total=1056 [2021-12-15 23:59:20,200 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 161 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 23:59:20,200 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 247 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 23:59:20,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-12-15 23:59:20,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 56. [2021-12-15 23:59:20,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.1272727272727272) internal successors, (62), 55 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 23:59:20,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2021-12-15 23:59:20,205 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 41 [2021-12-15 23:59:20,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:59:20,206 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2021-12-15 23:59:20,206 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.5) internal successors, (91), 26 states have internal predecessors, (91), 0 states have call successors, (0), 0 states 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:59:20,206 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2021-12-15 23:59:20,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-15 23:59:20,206 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:59:20,206 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 23:59:20,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-15 23:59:20,425 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-12-15 23:59:20,426 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:59:20,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:59:20,426 INFO L85 PathProgramCache]: Analyzing trace with hash -263606882, now seen corresponding path program 5 times [2021-12-15 23:59:20,426 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:59:20,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282736217] [2021-12-15 23:59:20,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:59:20,426 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:59:20,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:59:20,481 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-15 23:59:20,482 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:59:20,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282736217] [2021-12-15 23:59:20,482 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282736217] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 23:59:20,482 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 23:59:20,482 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-15 23:59:20,482 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17770708] [2021-12-15 23:59:20,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 23:59:20,483 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-15 23:59:20,483 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:59:20,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-15 23:59:20,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-12-15 23:59:20,484 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 23:59:20,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:59:20,500 INFO L93 Difference]: Finished difference Result 87 states and 96 transitions. [2021-12-15 23:59:20,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-15 23:59:20,500 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2021-12-15 23:59:20,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:59:20,501 INFO L225 Difference]: With dead ends: 87 [2021-12-15 23:59:20,501 INFO L226 Difference]: Without dead ends: 43 [2021-12-15 23:59:20,501 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-12-15 23:59:20,502 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 28 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 23:59:20,502 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 65 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 23:59:20,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2021-12-15 23:59:20,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2021-12-15 23:59:20,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 0 states have call successors, (0), 0 states 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:59:20,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2021-12-15 23:59:20,509 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2021-12-15 23:59:20,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:59:20,509 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2021-12-15 23:59:20,510 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 23:59:20,510 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2021-12-15 23:59:20,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-15 23:59:20,512 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 23:59:20,519 INFO L514 BasicCegarLoop]: trace histogram [2, 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] [2021-12-15 23:59:20,519 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-15 23:59:20,520 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 23:59:20,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 23:59:20,520 INFO L85 PathProgramCache]: Analyzing trace with hash -133051584, now seen corresponding path program 2 times [2021-12-15 23:59:20,520 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 23:59:20,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936181221] [2021-12-15 23:59:20,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 23:59:20,520 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 23:59:20,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 23:59:20,558 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-12-15 23:59:20,558 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 23:59:20,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936181221] [2021-12-15 23:59:20,558 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936181221] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 23:59:20,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647019497] [2021-12-15 23:59:20,559 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 23:59:20,559 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 23:59:20,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 23:59:20,560 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:59:20,561 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:59:20,656 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-15 23:59:20,656 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 23:59:20,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-15 23:59:20,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 23:59:20,723 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-12-15 23:59:20,723 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 23:59:20,806 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-12-15 23:59:20,806 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1647019497] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 23:59:20,806 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 23:59:20,806 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2021-12-15 23:59:20,806 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764651715] [2021-12-15 23:59:20,806 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 23:59:20,807 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-15 23:59:20,807 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 23:59:20,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-15 23:59:20,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-12-15 23:59:20,807 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 23:59:20,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 23:59:20,842 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2021-12-15 23:59:20,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-15 23:59:20,842 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-12-15 23:59:20,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 23:59:20,843 INFO L225 Difference]: With dead ends: 43 [2021-12-15 23:59:20,843 INFO L226 Difference]: Without dead ends: 0 [2021-12-15 23:59:20,848 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2021-12-15 23:59:20,848 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 19 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 23:59:20,849 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 87 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 23:59:20,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-15 23:59:20,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-15 23:59:20,849 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:59:20,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-15 23:59:20,850 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2021-12-15 23:59:20,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 23:59:20,850 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-15 23:59:20,850 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 23:59:20,850 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-15 23:59:20,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-15 23:59:20,852 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-15 23:59:20,879 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:59:21,067 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 23:59:21,069 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-15 23:59:31,238 WARN L227 SmtUtils]: Spent 10.01s on a formula simplification. DAG size of input: 43 DAG size of output: 16 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2021-12-16 00:00:13,427 WARN L227 SmtUtils]: Spent 42.06s on a formula simplification. DAG size of input: 61 DAG size of output: 59 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter)