./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/s5if.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3a877d22 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/array-fpi/s5if.c -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 b618695aa08df106816e7defd71220f009a5c8c09539ff7c8c29235c85f2ce8d --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 08:53:10,396 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 08:53:10,398 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 08:53:10,443 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 08:53:10,444 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 08:53:10,444 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 08:53:10,445 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 08:53:10,446 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 08:53:10,447 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 08:53:10,449 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 08:53:10,449 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 08:53:10,450 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 08:53:10,450 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 08:53:10,451 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 08:53:10,452 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 08:53:10,454 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 08:53:10,454 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 08:53:10,457 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 08:53:10,459 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 08:53:10,460 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 08:53:10,461 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 08:53:10,461 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 08:53:10,462 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 08:53:10,463 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 08:53:10,464 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 08:53:10,464 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 08:53:10,465 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 08:53:10,465 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 08:53:10,465 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 08:53:10,466 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 08:53:10,466 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 08:53:10,467 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 08:53:10,467 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 08:53:10,468 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 08:53:10,468 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 08:53:10,468 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 08:53:10,469 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 08:53:10,469 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 08:53:10,469 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 08:53:10,470 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 08:53:10,470 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 08:53:10,471 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-15 08:53:10,485 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 08:53:10,489 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 08:53:10,489 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 08:53:10,489 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 08:53:10,490 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-15 08:53:10,490 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-15 08:53:10,491 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 08:53:10,491 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 08:53:10,491 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 08:53:10,491 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 08:53:10,492 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 08:53:10,492 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 08:53:10,492 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 08:53:10,492 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 08:53:10,492 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-15 08:53:10,493 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-15 08:53:10,493 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-15 08:53:10,493 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 08:53:10,493 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 08:53:10,493 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 08:53:10,493 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-15 08:53:10,493 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 08:53:10,494 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 08:53:10,494 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-15 08:53:10,494 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 08:53:10,494 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 08:53:10,494 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-15 08:53:10,494 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-15 08:53:10,495 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 08:53:10,495 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-15 08:53:10,495 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-15 08:53:10,495 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-15 08:53:10,495 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-15 08:53:10,496 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 08:53:10,496 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 -> b618695aa08df106816e7defd71220f009a5c8c09539ff7c8c29235c85f2ce8d [2021-12-15 08:53:10,678 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 08:53:10,704 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 08:53:10,706 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 08:53:10,706 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 08:53:10,707 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 08:53:10,709 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/s5if.c [2021-12-15 08:53:10,763 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95cdea3b9/6be431a5b0d84c87851cbde14644ec36/FLAG4131c2688 [2021-12-15 08:53:11,107 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 08:53:11,108 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s5if.c [2021-12-15 08:53:11,120 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95cdea3b9/6be431a5b0d84c87851cbde14644ec36/FLAG4131c2688 [2021-12-15 08:53:11,131 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95cdea3b9/6be431a5b0d84c87851cbde14644ec36 [2021-12-15 08:53:11,133 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 08:53:11,135 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 08:53:11,137 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 08:53:11,137 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 08:53:11,139 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 08:53:11,140 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 08:53:11" (1/1) ... [2021-12-15 08:53:11,140 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@537aadfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:53:11, skipping insertion in model container [2021-12-15 08:53:11,141 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 08:53:11" (1/1) ... [2021-12-15 08:53:11,146 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 08:53:11,158 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 08:53:11,289 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/array-fpi/s5if.c[587,600] [2021-12-15 08:53:11,310 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 08:53:11,316 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 08:53:11,327 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/array-fpi/s5if.c[587,600] [2021-12-15 08:53:11,333 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 08:53:11,344 INFO L208 MainTranslator]: Completed translation [2021-12-15 08:53:11,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:53:11 WrapperNode [2021-12-15 08:53:11,345 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 08:53:11,346 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 08:53:11,346 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 08:53:11,346 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 08:53:11,351 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:53:11" (1/1) ... [2021-12-15 08:53:11,355 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:53:11" (1/1) ... [2021-12-15 08:53:11,367 INFO L137 Inliner]: procedures = 17, calls = 30, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 79 [2021-12-15 08:53:11,367 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 08:53:11,368 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 08:53:11,368 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 08:53:11,368 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 08:53:11,373 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:53:11" (1/1) ... [2021-12-15 08:53:11,373 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:53:11" (1/1) ... [2021-12-15 08:53:11,388 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:53:11" (1/1) ... [2021-12-15 08:53:11,388 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:53:11" (1/1) ... [2021-12-15 08:53:11,402 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:53:11" (1/1) ... [2021-12-15 08:53:11,407 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:53:11" (1/1) ... [2021-12-15 08:53:11,411 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:53:11" (1/1) ... [2021-12-15 08:53:11,415 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 08:53:11,417 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 08:53:11,418 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 08:53:11,418 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 08:53:11,418 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:53:11" (1/1) ... [2021-12-15 08:53:11,423 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 08:53:11,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 08:53:11,440 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 08:53:11,455 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 08:53:11,467 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 08:53:11,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 08:53:11,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-15 08:53:11,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-15 08:53:11,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-15 08:53:11,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 08:53:11,469 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 08:53:11,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-15 08:53:11,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-15 08:53:11,519 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 08:53:11,521 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 08:53:11,676 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 08:53:11,680 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 08:53:11,680 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-15 08:53:11,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 08:53:11 BoogieIcfgContainer [2021-12-15 08:53:11,681 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 08:53:11,682 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-15 08:53:11,682 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-15 08:53:11,688 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-15 08:53:11,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 08:53:11" (1/3) ... [2021-12-15 08:53:11,704 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79b7eeb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 08:53:11, skipping insertion in model container [2021-12-15 08:53:11,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 08:53:11" (2/3) ... [2021-12-15 08:53:11,704 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79b7eeb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 08:53:11, skipping insertion in model container [2021-12-15 08:53:11,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 08:53:11" (3/3) ... [2021-12-15 08:53:11,705 INFO L111 eAbstractionObserver]: Analyzing ICFG s5if.c [2021-12-15 08:53:11,709 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-15 08:53:11,709 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-15 08:53:11,745 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-15 08:53:11,761 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 08:53:11,761 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-15 08:53:11,770 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 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 08:53:11,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-15 08:53:11,774 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:53:11,775 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:53:11,776 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:53:11,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:53:11,781 INFO L85 PathProgramCache]: Analyzing trace with hash 356661439, now seen corresponding path program 1 times [2021-12-15 08:53:11,787 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:53:11,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38574158] [2021-12-15 08:53:11,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:53:11,789 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:53:11,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:53:11,917 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 08:53:11,917 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:53:11,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38574158] [2021-12-15 08:53:11,918 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38574158] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 08:53:11,918 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 08:53:11,918 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 08:53:11,919 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278541776] [2021-12-15 08:53:11,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 08:53:11,922 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-15 08:53:11,922 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:53:11,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-15 08:53:11,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-15 08:53:11,947 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 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) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states 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 08:53:11,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:53:11,957 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2021-12-15 08:53:11,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-15 08:53:11,960 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2021-12-15 08:53:11,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:53:11,964 INFO L225 Difference]: With dead ends: 34 [2021-12-15 08:53:11,964 INFO L226 Difference]: Without dead ends: 15 [2021-12-15 08:53:11,966 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 08:53:11,969 INFO L933 BasicCegarLoop]: 22 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, 22 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 08:53:11,970 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 08:53:11,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2021-12-15 08:53:11,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2021-12-15 08:53:11,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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 08:53:11,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2021-12-15 08:53:11,996 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 11 [2021-12-15 08:53:11,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:53:11,996 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2021-12-15 08:53:11,997 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states 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 08:53:11,997 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2021-12-15 08:53:11,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-15 08:53:11,997 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:53:11,997 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:53:11,998 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-15 08:53:11,998 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:53:12,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:53:12,001 INFO L85 PathProgramCache]: Analyzing trace with hash -452685187, now seen corresponding path program 1 times [2021-12-15 08:53:12,001 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:53:12,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942018465] [2021-12-15 08:53:12,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:53:12,002 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:53:12,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:53:12,072 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 08:53:12,072 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:53:12,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942018465] [2021-12-15 08:53:12,072 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942018465] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 08:53:12,072 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 08:53:12,073 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 08:53:12,073 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533170923] [2021-12-15 08:53:12,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 08:53:12,074 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 08:53:12,074 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:53:12,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 08:53:12,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-15 08:53:12,075 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states 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 08:53:12,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:53:12,132 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2021-12-15 08:53:12,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 08:53:12,133 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2021-12-15 08:53:12,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:53:12,133 INFO L225 Difference]: With dead ends: 28 [2021-12-15 08:53:12,133 INFO L226 Difference]: Without dead ends: 20 [2021-12-15 08:53:12,133 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 08:53:12,134 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 21 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 10 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 08:53:12,135 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 10 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 08:53:12,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-12-15 08:53:12,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2021-12-15 08:53:12,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:53:12,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2021-12-15 08:53:12,137 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2021-12-15 08:53:12,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:53:12,138 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2021-12-15 08:53:12,138 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states 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 08:53:12,138 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2021-12-15 08:53:12,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-15 08:53:12,138 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:53:12,138 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:53:12,138 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-15 08:53:12,139 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:53:12,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:53:12,139 INFO L85 PathProgramCache]: Analyzing trace with hash 623611495, now seen corresponding path program 1 times [2021-12-15 08:53:12,139 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:53:12,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355242224] [2021-12-15 08:53:12,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:53:12,139 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:53:12,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:53:12,461 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:53:12,462 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:53:12,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355242224] [2021-12-15 08:53:12,462 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355242224] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 08:53:12,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [914829178] [2021-12-15 08:53:12,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:53:12,464 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:53:12,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 08:53:12,465 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 08:53:12,473 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 08:53:12,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:53:12,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 28 conjunts are in the unsatisfiable core [2021-12-15 08:53:12,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:53:12,623 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 10 treesize of output 8 [2021-12-15 08:53:12,634 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 08:53:12,693 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-15 08:53:12,798 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2021-12-15 08:53:12,931 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:53:12,931 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 08:53:13,160 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 08:53:13,160 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 28 treesize of output 29 [2021-12-15 08:53:13,165 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 08:53:13,167 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 26 treesize of output 18 [2021-12-15 08:53:13,171 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-12-15 08:53:13,186 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:53:13,187 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [914829178] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 08:53:13,187 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 08:53:13,187 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 21 [2021-12-15 08:53:13,187 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495423466] [2021-12-15 08:53:13,188 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 08:53:13,189 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-15 08:53:13,189 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:53:13,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-15 08:53:13,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=333, Unknown=2, NotChecked=0, Total=420 [2021-12-15 08:53:13,192 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 21 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 21 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:53:13,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:53:13,397 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2021-12-15 08:53:13,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-15 08:53:13,398 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 21 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-15 08:53:13,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:53:13,412 INFO L225 Difference]: With dead ends: 46 [2021-12-15 08:53:13,412 INFO L226 Difference]: Without dead ends: 41 [2021-12-15 08:53:13,413 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 20 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=144, Invalid=504, Unknown=2, NotChecked=0, Total=650 [2021-12-15 08:53:13,414 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 24 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 50 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 08:53:13,414 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 47 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 98 Invalid, 0 Unknown, 50 Unchecked, 0.1s Time] [2021-12-15 08:53:13,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2021-12-15 08:53:13,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 26. [2021-12-15 08:53:13,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 0 states have call successors, (0), 0 states 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 08:53:13,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2021-12-15 08:53:13,418 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 16 [2021-12-15 08:53:13,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:53:13,418 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2021-12-15 08:53:13,419 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 21 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:53:13,419 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2021-12-15 08:53:13,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-15 08:53:13,419 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:53:13,419 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:53:13,441 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 08:53:13,636 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 08:53:13,636 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:53:13,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:53:13,636 INFO L85 PathProgramCache]: Analyzing trace with hash 680869797, now seen corresponding path program 1 times [2021-12-15 08:53:13,636 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:53:13,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102603892] [2021-12-15 08:53:13,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:53:13,637 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:53:13,650 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-15 08:53:13,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [777148778] [2021-12-15 08:53:13,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:53:13,656 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:53:13,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 08:53:13,659 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 08:53:13,661 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 08:53:13,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:53:13,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-15 08:53:13,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:53:13,731 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 11 treesize of output 7 [2021-12-15 08:53:13,767 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 15 treesize of output 7 [2021-12-15 08:53:13,779 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:53:13,780 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 08:53:13,834 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2021-12-15 08:53:13,836 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2021-12-15 08:53:13,853 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:53:13,853 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:53:13,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102603892] [2021-12-15 08:53:13,854 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-15 08:53:13,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777148778] [2021-12-15 08:53:13,854 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [777148778] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 08:53:13,854 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-15 08:53:13,855 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2021-12-15 08:53:13,855 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971146293] [2021-12-15 08:53:13,855 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-15 08:53:13,855 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-15 08:53:13,855 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:53:13,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-15 08:53:13,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-12-15 08:53:13,856 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:53:13,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:53:13,907 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2021-12-15 08:53:13,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-15 08:53:13,908 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-15 08:53:13,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:53:13,909 INFO L225 Difference]: With dead ends: 38 [2021-12-15 08:53:13,909 INFO L226 Difference]: Without dead ends: 26 [2021-12-15 08:53:13,909 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-12-15 08:53:13,910 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 4 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 08:53:13,910 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 42 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 08:53:13,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-12-15 08:53:13,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2021-12-15 08:53:13,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 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 08:53:13,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2021-12-15 08:53:13,914 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 16 [2021-12-15 08:53:13,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:53:13,915 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2021-12-15 08:53:13,915 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:53:13,915 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2021-12-15 08:53:13,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-15 08:53:13,916 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:53:13,916 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:53:13,941 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 08:53:14,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2021-12-15 08:53:14,124 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:53:14,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:53:14,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1137819675, now seen corresponding path program 2 times [2021-12-15 08:53:14,124 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:53:14,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726043058] [2021-12-15 08:53:14,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:53:14,124 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:53:14,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:53:14,188 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:53:14,189 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:53:14,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726043058] [2021-12-15 08:53:14,189 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726043058] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 08:53:14,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1489298183] [2021-12-15 08:53:14,189 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 08:53:14,190 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:53:14,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 08:53:14,199 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 08:53:14,224 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 08:53:14,280 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-15 08:53:14,280 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 08:53:14,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-15 08:53:14,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:53:14,340 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:53:14,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 08:53:14,379 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:53:14,380 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1489298183] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 08:53:14,380 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 08:53:14,380 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2021-12-15 08:53:14,380 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131864651] [2021-12-15 08:53:14,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 08:53:14,381 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-15 08:53:14,381 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:53:14,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-15 08:53:14,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-12-15 08:53:14,382 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:53:14,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:53:14,513 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2021-12-15 08:53:14,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-15 08:53:14,514 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-12-15 08:53:14,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:53:14,514 INFO L225 Difference]: With dead ends: 33 [2021-12-15 08:53:14,514 INFO L226 Difference]: Without dead ends: 29 [2021-12-15 08:53:14,515 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2021-12-15 08:53:14,515 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 28 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 08:53:14,515 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 32 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 08:53:14,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-12-15 08:53:14,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 20. [2021-12-15 08:53:14,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:53:14,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2021-12-15 08:53:14,519 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 18 [2021-12-15 08:53:14,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:53:14,519 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2021-12-15 08:53:14,519 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:53:14,519 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2021-12-15 08:53:14,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-15 08:53:14,520 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:53:14,520 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:53:14,546 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 08:53:14,727 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:53:14,727 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:53:14,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:53:14,728 INFO L85 PathProgramCache]: Analyzing trace with hash -479454913, now seen corresponding path program 3 times [2021-12-15 08:53:14,728 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:53:14,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593130434] [2021-12-15 08:53:14,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:53:14,728 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:53:14,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:53:14,788 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:53:14,788 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:53:14,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593130434] [2021-12-15 08:53:14,789 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593130434] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 08:53:14,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948097096] [2021-12-15 08:53:14,789 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-15 08:53:14,789 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:53:14,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 08:53:14,790 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 08:53:14,817 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 08:53:14,837 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-12-15 08:53:14,837 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 08:53:14,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-15 08:53:14,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:53:14,917 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:53:14,918 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 08:53:14,953 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:53:14,953 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948097096] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 08:53:14,953 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 08:53:14,953 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2021-12-15 08:53:14,953 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953154142] [2021-12-15 08:53:14,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 08:53:14,954 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-15 08:53:14,954 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:53:14,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-15 08:53:14,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-12-15 08:53:14,955 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 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 08:53:15,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:53:15,017 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2021-12-15 08:53:15,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-15 08:53:15,018 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 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 19 [2021-12-15 08:53:15,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:53:15,019 INFO L225 Difference]: With dead ends: 37 [2021-12-15 08:53:15,019 INFO L226 Difference]: Without dead ends: 25 [2021-12-15 08:53:15,019 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2021-12-15 08:53:15,020 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 23 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 08:53:15,020 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 21 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 08:53:15,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-12-15 08:53:15,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2021-12-15 08:53:15,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 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 08:53:15,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2021-12-15 08:53:15,023 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 19 [2021-12-15 08:53:15,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:53:15,023 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2021-12-15 08:53:15,023 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 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 08:53:15,023 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2021-12-15 08:53:15,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-15 08:53:15,024 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:53:15,024 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:53:15,044 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 08:53:15,242 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:53:15,243 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:53:15,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:53:15,244 INFO L85 PathProgramCache]: Analyzing trace with hash 634982145, now seen corresponding path program 4 times [2021-12-15 08:53:15,245 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:53:15,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353231427] [2021-12-15 08:53:15,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:53:15,246 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:53:15,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:53:15,517 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:53:15,517 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:53:15,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353231427] [2021-12-15 08:53:15,517 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353231427] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 08:53:15,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [564813943] [2021-12-15 08:53:15,518 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-15 08:53:15,518 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:53:15,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 08:53:15,519 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 08:53:15,520 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 08:53:15,556 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-15 08:53:15,556 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 08:53:15,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 36 conjunts are in the unsatisfiable core [2021-12-15 08:53:15,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:53:15,568 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 11 treesize of output 7 [2021-12-15 08:53:15,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:53:15,612 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-15 08:53:15,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:53:15,642 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-15 08:53:15,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:53:15,760 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2021-12-15 08:53:15,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:53:15,860 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-15 08:53:15,860 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2021-12-15 08:53:16,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:53:16,029 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-15 08:53:16,030 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 32 [2021-12-15 08:53:16,056 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:53:16,056 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 08:53:18,554 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_47| Int) (v_ArrVal_153 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_44| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_153))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse4 (select v_ArrVal_153 (+ (* |v_ULTIMATE.start_main_~i~0#1_47| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_44| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 5 .cse0)) (let ((.cse1 (* .cse5 (- 1))) (.cse2 (* .cse4 (- 1))) (.cse3 (* .cse0 (- 1)))) (and (<= (+ |c_ULTIMATE.start_main_~i~0#1| 2) (div (+ .cse1 .cse2 .cse3 (- 1)) (- 5))) (<= (div (+ .cse1 .cse2 .cse3) (- 5)) (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) (not (= 5 .cse4)))))))) is different from false [2021-12-15 08:53:18,637 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_47| Int) (v_ArrVal_153 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_44| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_153))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse4 (select v_ArrVal_153 (+ (* |v_ULTIMATE.start_main_~i~0#1_47| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_44| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 5 .cse0)) (let ((.cse1 (* .cse5 (- 1))) (.cse2 (* .cse4 (- 1))) (.cse3 (* .cse0 (- 1)))) (and (<= (div (+ .cse1 .cse2 .cse3) (- 5)) (+ |c_ULTIMATE.start_main_~i~0#1| 2)) (<= (+ |c_ULTIMATE.start_main_~i~0#1| 3) (div (+ .cse1 .cse2 .cse3 (- 1)) (- 5))))) (not (= 5 .cse4)))))))) is different from false [2021-12-15 08:53:18,754 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2021-12-15 08:53:18,755 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [564813943] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 08:53:18,755 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 08:53:18,755 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 32 [2021-12-15 08:53:18,755 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34469189] [2021-12-15 08:53:18,755 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 08:53:18,756 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-12-15 08:53:18,756 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:53:18,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-12-15 08:53:18,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=763, Unknown=3, NotChecked=114, Total=992 [2021-12-15 08:53:18,757 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 32 states, 32 states have (on average 1.5625) internal successors, (50), 32 states have internal predecessors, (50), 0 states have call successors, (0), 0 states 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 08:53:19,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:53:19,011 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2021-12-15 08:53:19,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-15 08:53:19,011 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.5625) internal successors, (50), 32 states have internal predecessors, (50), 0 states have call successors, (0), 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 21 [2021-12-15 08:53:19,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:53:19,012 INFO L225 Difference]: With dead ends: 36 [2021-12-15 08:53:19,012 INFO L226 Difference]: Without dead ends: 32 [2021-12-15 08:53:19,012 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=163, Invalid=964, Unknown=3, NotChecked=130, Total=1260 [2021-12-15 08:53:19,013 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 7 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 105 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 08:53:19,013 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 82 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 154 Invalid, 0 Unknown, 105 Unchecked, 0.1s Time] [2021-12-15 08:53:19,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-12-15 08:53:19,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2021-12-15 08:53:19,016 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 08:53:19,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2021-12-15 08:53:19,016 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 21 [2021-12-15 08:53:19,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:53:19,017 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2021-12-15 08:53:19,017 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.5625) internal successors, (50), 32 states have internal predecessors, (50), 0 states have call successors, (0), 0 states 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 08:53:19,017 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2021-12-15 08:53:19,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-15 08:53:19,017 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:53:19,017 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:53:19,037 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 08:53:19,218 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:53:19,218 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:53:19,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:53:19,219 INFO L85 PathProgramCache]: Analyzing trace with hash 692240447, now seen corresponding path program 1 times [2021-12-15 08:53:19,219 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:53:19,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512207115] [2021-12-15 08:53:19,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:53:19,219 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:53:19,230 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-15 08:53:19,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [169837760] [2021-12-15 08:53:19,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:53:19,231 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:53:19,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 08:53:19,232 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 08:53:19,233 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 08:53:19,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:53:19,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-15 08:53:19,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:53:19,317 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-15 08:53:19,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:53:19,381 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-15 08:53:19,416 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 15 treesize of output 7 [2021-12-15 08:53:19,433 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:53:19,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 08:53:19,479 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_190 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_190) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 5)) is different from false [2021-12-15 08:53:19,488 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_190 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_190) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 5)) is different from false [2021-12-15 08:53:19,498 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 08:53:19,499 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2021-12-15 08:53:19,505 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 08:53:19,506 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2021-12-15 08:53:19,509 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 11 treesize of output 7 [2021-12-15 08:53:19,554 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2021-12-15 08:53:19,555 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:53:19,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512207115] [2021-12-15 08:53:19,555 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-15 08:53:19,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169837760] [2021-12-15 08:53:19,555 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [169837760] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 08:53:19,555 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-15 08:53:19,555 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2021-12-15 08:53:19,556 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976005734] [2021-12-15 08:53:19,556 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-15 08:53:19,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-15 08:53:19,556 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:53:19,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-15 08:53:19,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=126, Unknown=2, NotChecked=46, Total=210 [2021-12-15 08:53:19,557 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 0 states have call successors, (0), 0 states 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 08:53:19,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:53:19,708 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2021-12-15 08:53:19,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-15 08:53:19,709 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 0 states have call successors, (0), 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 21 [2021-12-15 08:53:19,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:53:19,709 INFO L225 Difference]: With dead ends: 41 [2021-12-15 08:53:19,709 INFO L226 Difference]: Without dead ends: 34 [2021-12-15 08:53:19,709 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=215, Unknown=2, NotChecked=62, Total=342 [2021-12-15 08:53:19,710 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 16 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 08:53:19,710 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 56 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 130 Invalid, 0 Unknown, 39 Unchecked, 0.1s Time] [2021-12-15 08:53:19,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-12-15 08:53:19,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2021-12-15 08:53:19,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.125) internal successors, (36), 32 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 08:53:19,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2021-12-15 08:53:19,714 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 21 [2021-12-15 08:53:19,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:53:19,714 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2021-12-15 08:53:19,714 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 0 states have call successors, (0), 0 states 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 08:53:19,714 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2021-12-15 08:53:19,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-15 08:53:19,715 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:53:19,715 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:53:19,735 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 08:53:19,923 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:53:19,924 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:53:19,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:53:19,924 INFO L85 PathProgramCache]: Analyzing trace with hash -2132829117, now seen corresponding path program 5 times [2021-12-15 08:53:19,924 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:53:19,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900927503] [2021-12-15 08:53:19,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:53:19,924 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:53:19,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:53:19,978 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:53:19,979 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:53:19,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900927503] [2021-12-15 08:53:19,979 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900927503] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 08:53:19,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [67878384] [2021-12-15 08:53:19,979 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-15 08:53:19,979 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:53:19,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 08:53:19,980 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 08:53:20,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-15 08:53:20,029 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2021-12-15 08:53:20,030 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 08:53:20,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-15 08:53:20,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:53:20,126 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:53:20,127 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 08:53:20,184 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:53:20,185 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [67878384] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 08:53:20,185 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 08:53:20,185 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2021-12-15 08:53:20,185 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367645582] [2021-12-15 08:53:20,185 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 08:53:20,185 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-15 08:53:20,186 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:53:20,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-15 08:53:20,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2021-12-15 08:53:20,186 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states 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 08:53:20,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:53:20,335 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2021-12-15 08:53:20,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-15 08:53:20,336 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 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 08:53:20,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:53:20,336 INFO L225 Difference]: With dead ends: 41 [2021-12-15 08:53:20,336 INFO L226 Difference]: Without dead ends: 37 [2021-12-15 08:53:20,336 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2021-12-15 08:53:20,337 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 40 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 08:53:20,337 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 28 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 08:53:20,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-12-15 08:53:20,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 25. [2021-12-15 08:53:20,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.125) internal successors, (27), 24 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 08:53:20,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2021-12-15 08:53:20,340 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 23 [2021-12-15 08:53:20,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:53:20,340 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2021-12-15 08:53:20,340 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states 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 08:53:20,340 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2021-12-15 08:53:20,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-15 08:53:20,340 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:53:20,340 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:53:20,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-15 08:53:20,541 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:53:20,542 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:53:20,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:53:20,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1038837147, now seen corresponding path program 6 times [2021-12-15 08:53:20,542 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:53:20,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579630470] [2021-12-15 08:53:20,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:53:20,542 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:53:20,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:53:20,598 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:53:20,599 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:53:20,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579630470] [2021-12-15 08:53:20,601 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579630470] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 08:53:20,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035437810] [2021-12-15 08:53:20,601 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-15 08:53:20,601 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:53:20,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 08:53:20,602 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 08:53:20,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-15 08:53:20,651 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2021-12-15 08:53:20,651 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 08:53:20,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-15 08:53:20,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:53:20,737 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:53:20,737 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 08:53:20,783 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:53:20,783 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2035437810] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 08:53:20,783 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 08:53:20,783 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2021-12-15 08:53:20,783 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036516269] [2021-12-15 08:53:20,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 08:53:20,784 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-15 08:53:20,784 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:53:20,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-15 08:53:20,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2021-12-15 08:53:20,784 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states 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 08:53:20,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:53:20,875 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2021-12-15 08:53:20,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-15 08:53:20,876 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 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 24 [2021-12-15 08:53:20,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:53:20,876 INFO L225 Difference]: With dead ends: 45 [2021-12-15 08:53:20,876 INFO L226 Difference]: Without dead ends: 30 [2021-12-15 08:53:20,876 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2021-12-15 08:53:20,877 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 34 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 08:53:20,877 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 19 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 08:53:20,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-12-15 08:53:20,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2021-12-15 08:53:20,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:53:20,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2021-12-15 08:53:20,880 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 24 [2021-12-15 08:53:20,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:53:20,880 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2021-12-15 08:53:20,880 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states 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 08:53:20,880 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2021-12-15 08:53:20,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-15 08:53:20,880 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:53:20,880 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:53:20,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-15 08:53:21,081 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-12-15 08:53:21,081 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:53:21,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:53:21,081 INFO L85 PathProgramCache]: Analyzing trace with hash -2121994781, now seen corresponding path program 7 times [2021-12-15 08:53:21,082 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:53:21,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833676881] [2021-12-15 08:53:21,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:53:21,082 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:53:21,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:53:21,457 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:53:21,458 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:53:21,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833676881] [2021-12-15 08:53:21,458 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833676881] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 08:53:21,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927880734] [2021-12-15 08:53:21,458 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-12-15 08:53:21,458 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:53:21,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 08:53:21,459 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 08:53:21,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-15 08:53:21,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:53:21,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 49 conjunts are in the unsatisfiable core [2021-12-15 08:53:21,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:53:21,527 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 11 treesize of output 7 [2021-12-15 08:53:21,530 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 10 treesize of output 8 [2021-12-15 08:53:21,538 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-15 08:53:21,553 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-15 08:53:21,572 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-15 08:53:21,678 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2021-12-15 08:53:21,776 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-15 08:53:21,777 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 41 [2021-12-15 08:53:21,896 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-15 08:53:21,896 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 43 [2021-12-15 08:53:22,016 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-15 08:53:22,017 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 32 [2021-12-15 08:53:22,043 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:53:22,043 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 08:53:25,334 WARN L838 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (<= ~N~0 |c_ULTIMATE.start_main_~i~0#1|) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (forall ((|v_ULTIMATE.start_main_~i~0#1_91| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_88| Int) (|v_ULTIMATE.start_main_~i~0#1_86| Int) (v_ArrVal_302 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_302))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select v_ArrVal_302 (+ (* |v_ULTIMATE.start_main_~i~0#1_91| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse3 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_88| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_86| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 5 .cse0)) (not (= 5 .cse1)) (not (= 5 .cse2)) (= (+ .cse0 .cse1 .cse2 .cse3) (* 5 ~N~0))))))))))) is different from false [2021-12-15 08:53:25,449 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_91| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_88| Int) (|v_ULTIMATE.start_main_~i~0#1_86| Int) (v_ArrVal_302 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_302))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select v_ArrVal_302 (+ (* |v_ULTIMATE.start_main_~i~0#1_91| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse3 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_88| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_86| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 5 .cse0)) (<= ~N~0 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (not (= 5 .cse1)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 2) ~N~0) (not (= 5 .cse2)) (= (+ .cse0 .cse1 .cse2 .cse3) (* 5 ~N~0))))))))) is different from false [2021-12-15 08:53:25,578 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_91| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_88| Int) (|v_ULTIMATE.start_main_~i~0#1_86| Int) (v_ArrVal_302 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_302))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select v_ArrVal_302 (+ (* |v_ULTIMATE.start_main_~i~0#1_91| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse3 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_88| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_86| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 5 .cse0)) (<= ~N~0 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (not (= 5 .cse1)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 2) ~N~0) (not (= 5 .cse2)) (= (+ .cse1 .cse0 .cse2 .cse3) (* 5 ~N~0))))))))) is different from false [2021-12-15 08:53:25,693 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_91| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_88| Int) (|v_ULTIMATE.start_main_~i~0#1_86| Int) (v_ArrVal_302 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_302))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select v_ArrVal_302 (+ (* |v_ULTIMATE.start_main_~i~0#1_91| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse3 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_88| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_86| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 5 .cse0)) (<= ~N~0 (+ |c_ULTIMATE.start_main_~i~0#1| 2)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 3) ~N~0) (not (= 5 .cse1)) (not (= 5 .cse2)) (= (+ .cse1 .cse0 .cse2 .cse3) (* 5 ~N~0))))))))) is different from false [2021-12-15 08:53:25,837 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2021-12-15 08:53:25,837 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927880734] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 08:53:25,837 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 08:53:25,837 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 16] total 38 [2021-12-15 08:53:25,837 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288127594] [2021-12-15 08:53:25,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 08:53:25,838 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-12-15 08:53:25,838 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:53:25,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-12-15 08:53:25,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1008, Unknown=5, NotChecked=268, Total=1406 [2021-12-15 08:53:25,839 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 38 states, 38 states have (on average 1.5526315789473684) internal successors, (59), 38 states have internal predecessors, (59), 0 states have call successors, (0), 0 states 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 08:53:26,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:53:26,027 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2021-12-15 08:53:26,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-15 08:53:26,027 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.5526315789473684) internal successors, (59), 38 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-15 08:53:26,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:53:26,028 INFO L225 Difference]: With dead ends: 45 [2021-12-15 08:53:26,028 INFO L226 Difference]: Without dead ends: 41 [2021-12-15 08:53:26,029 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 29 SyntacticMatches, 9 SemanticMatches, 39 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=159, Invalid=1184, Unknown=5, NotChecked=292, Total=1640 [2021-12-15 08:53:26,029 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 7 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 231 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 08:53:26,029 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 106 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 154 Invalid, 0 Unknown, 231 Unchecked, 0.1s Time] [2021-12-15 08:53:26,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2021-12-15 08:53:26,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2021-12-15 08:53:26,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 0 states have call successors, (0), 0 states 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 08:53:26,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2021-12-15 08:53:26,038 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 26 [2021-12-15 08:53:26,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:53:26,039 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2021-12-15 08:53:26,039 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.5526315789473684) internal successors, (59), 38 states have internal predecessors, (59), 0 states have call successors, (0), 0 states 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 08:53:26,039 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2021-12-15 08:53:26,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-15 08:53:26,042 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:53:26,042 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:53:26,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-15 08:53:26,259 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:53:26,259 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:53:26,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:53:26,260 INFO L85 PathProgramCache]: Analyzing trace with hash -2064736479, now seen corresponding path program 2 times [2021-12-15 08:53:26,260 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:53:26,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852445988] [2021-12-15 08:53:26,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:53:26,260 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:53:26,267 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-15 08:53:26,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1563518935] [2021-12-15 08:53:26,275 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 08:53:26,276 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:53:26,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 08:53:26,276 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 08:53:26,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-15 08:53:26,348 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-15 08:53:26,348 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 08:53:26,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-15 08:53:26,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:53:26,396 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-15 08:53:26,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:53:26,440 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-15 08:53:26,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:53:26,492 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-15 08:53:26,517 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-15 08:53:26,531 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:53:26,531 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 08:53:26,568 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_350) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 5)) is different from false [2021-12-15 08:53:26,575 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_350) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 8)) 5)) is different from false [2021-12-15 08:53:26,584 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_350) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) 5)) is different from false [2021-12-15 08:53:26,592 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 08:53:26,593 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2021-12-15 08:53:26,597 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 08:53:26,597 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2021-12-15 08:53:26,600 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 11 treesize of output 7 [2021-12-15 08:53:26,666 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2021-12-15 08:53:26,666 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:53:26,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852445988] [2021-12-15 08:53:26,666 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-15 08:53:26,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563518935] [2021-12-15 08:53:26,666 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1563518935] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 08:53:26,666 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-15 08:53:26,666 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-12-15 08:53:26,667 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346997215] [2021-12-15 08:53:26,667 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-15 08:53:26,667 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-15 08:53:26,667 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:53:26,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-15 08:53:26,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=201, Unknown=3, NotChecked=90, Total=342 [2021-12-15 08:53:26,668 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 0 states have call successors, (0), 0 states 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 08:53:26,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:53:26,897 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2021-12-15 08:53:26,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-15 08:53:26,897 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-15 08:53:26,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:53:26,898 INFO L225 Difference]: With dead ends: 49 [2021-12-15 08:53:26,898 INFO L226 Difference]: Without dead ends: 42 [2021-12-15 08:53:26,898 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 32 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=349, Unknown=3, NotChecked=120, Total=552 [2021-12-15 08:53:26,899 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 17 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 74 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 08:53:26,899 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 68 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 214 Invalid, 0 Unknown, 74 Unchecked, 0.1s Time] [2021-12-15 08:53:26,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2021-12-15 08:53:26,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2021-12-15 08:53:26,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.1) internal successors, (44), 40 states have internal predecessors, (44), 0 states have call successors, (0), 0 states 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 08:53:26,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2021-12-15 08:53:26,906 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 26 [2021-12-15 08:53:26,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:53:26,906 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2021-12-15 08:53:26,907 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 0 states have call successors, (0), 0 states 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 08:53:26,907 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2021-12-15 08:53:26,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-15 08:53:26,907 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:53:26,907 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:53:26,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-15 08:53:27,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-12-15 08:53:27,123 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:53:27,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:53:27,124 INFO L85 PathProgramCache]: Analyzing trace with hash 640571873, now seen corresponding path program 8 times [2021-12-15 08:53:27,124 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:53:27,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180286567] [2021-12-15 08:53:27,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:53:27,124 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:53:27,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:53:27,196 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:53:27,197 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:53:27,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180286567] [2021-12-15 08:53:27,197 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180286567] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 08:53:27,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165578797] [2021-12-15 08:53:27,197 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 08:53:27,197 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:53:27,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 08:53:27,198 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 08:53:27,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-15 08:53:27,261 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-15 08:53:27,261 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 08:53:27,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-15 08:53:27,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:53:27,356 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:53:27,356 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 08:53:27,421 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:53:27,422 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165578797] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 08:53:27,422 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 08:53:27,422 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2021-12-15 08:53:27,422 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784214219] [2021-12-15 08:53:27,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 08:53:27,422 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-15 08:53:27,422 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:53:27,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-15 08:53:27,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2021-12-15 08:53:27,423 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 0 states have call successors, (0), 0 states 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 08:53:27,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:53:27,570 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2021-12-15 08:53:27,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-15 08:53:27,570 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 0 states have call successors, (0), 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 08:53:27,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:53:27,571 INFO L225 Difference]: With dead ends: 49 [2021-12-15 08:53:27,571 INFO L226 Difference]: Without dead ends: 45 [2021-12-15 08:53:27,571 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2021-12-15 08:53:27,572 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 61 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 08:53:27,572 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 22 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 08:53:27,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2021-12-15 08:53:27,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 30. [2021-12-15 08:53:27,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 0 states have call successors, (0), 0 states 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 08:53:27,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2021-12-15 08:53:27,575 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 28 [2021-12-15 08:53:27,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:53:27,575 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2021-12-15 08:53:27,575 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 0 states have call successors, (0), 0 states 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 08:53:27,575 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2021-12-15 08:53:27,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-15 08:53:27,576 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:53:27,576 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:53:27,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-12-15 08:53:27,779 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-12-15 08:53:27,781 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:53:27,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:53:27,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1478838205, now seen corresponding path program 9 times [2021-12-15 08:53:27,781 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:53:27,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899348791] [2021-12-15 08:53:27,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:53:27,781 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:53:27,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:53:27,869 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:53:27,869 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:53:27,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899348791] [2021-12-15 08:53:27,869 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899348791] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 08:53:27,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210078124] [2021-12-15 08:53:27,870 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-15 08:53:27,870 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:53:27,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 08:53:27,871 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 08:53:27,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-15 08:53:27,960 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-12-15 08:53:27,960 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 08:53:27,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-15 08:53:27,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:53:28,070 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:53:28,070 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 08:53:28,121 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:53:28,121 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210078124] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 08:53:28,121 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 08:53:28,121 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2021-12-15 08:53:28,122 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314806391] [2021-12-15 08:53:28,122 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 08:53:28,122 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-15 08:53:28,122 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:53:28,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-15 08:53:28,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2021-12-15 08:53:28,123 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 0 states have call successors, (0), 0 states 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 08:53:28,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:53:28,253 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2021-12-15 08:53:28,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-15 08:53:28,253 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 0 states have call successors, (0), 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 08:53:28,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:53:28,254 INFO L225 Difference]: With dead ends: 53 [2021-12-15 08:53:28,254 INFO L226 Difference]: Without dead ends: 35 [2021-12-15 08:53:28,254 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2021-12-15 08:53:28,254 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 46 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 08:53:28,255 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 23 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 08:53:28,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-12-15 08:53:28,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2021-12-15 08:53:28,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 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 08:53:28,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2021-12-15 08:53:28,258 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 29 [2021-12-15 08:53:28,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:53:28,258 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2021-12-15 08:53:28,258 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 0 states have call successors, (0), 0 states 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 08:53:28,258 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2021-12-15 08:53:28,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-15 08:53:28,258 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:53:28,258 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:53:28,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-12-15 08:53:28,459 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-12-15 08:53:28,459 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:53:28,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:53:28,459 INFO L85 PathProgramCache]: Analyzing trace with hash -2018974843, now seen corresponding path program 10 times [2021-12-15 08:53:28,459 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:53:28,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219635400] [2021-12-15 08:53:28,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:53:28,460 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:53:28,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:53:28,971 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:53:28,971 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:53:28,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219635400] [2021-12-15 08:53:28,972 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219635400] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 08:53:28,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555975823] [2021-12-15 08:53:28,972 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-15 08:53:28,972 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:53:28,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 08:53:28,973 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 08:53:28,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-15 08:53:29,027 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-15 08:53:29,027 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 08:53:29,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 58 conjunts are in the unsatisfiable core [2021-12-15 08:53:29,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:53:29,045 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 11 treesize of output 7 [2021-12-15 08:53:29,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:53:29,077 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-15 08:53:29,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:53:29,122 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-15 08:53:29,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:53:29,186 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-15 08:53:29,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:53:29,236 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-15 08:53:29,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:53:29,419 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2021-12-15 08:53:29,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:53:29,537 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-15 08:53:29,537 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 41 [2021-12-15 08:53:29,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:53:29,663 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-15 08:53:29,663 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2021-12-15 08:53:29,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:53:29,796 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-15 08:53:29,796 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2021-12-15 08:53:29,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 08:53:29,975 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-15 08:53:29,976 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 32 [2021-12-15 08:53:30,014 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:53:30,014 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 08:53:47,975 WARN L838 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (<= ~N~0 |c_ULTIMATE.start_main_~i~0#1|) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_149| Int) (|v_ULTIMATE.start_main_~i~0#1_145| Int) (|v_ULTIMATE.start_main_~i~0#1_152| Int) (v_ArrVal_486 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_486))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select v_ArrVal_486 (+ (* |v_ULTIMATE.start_main_~i~0#1_152| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse4 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse0 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_149| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse1 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_147| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse2 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_145| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 5 .cse0)) (not (= 5 .cse1)) (not (= 5 .cse2)) (not (= 5 .cse3)) (= (+ .cse0 .cse1 .cse3 .cse2 .cse4) (* 5 ~N~0)))))))))))) is different from false [2021-12-15 08:53:48,361 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_149| Int) (|v_ULTIMATE.start_main_~i~0#1_145| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_152| Int) (v_ArrVal_486 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_486))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select v_ArrVal_486 (+ (* |v_ULTIMATE.start_main_~i~0#1_152| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse4 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse0 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_149| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse1 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_147| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse2 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_145| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 5 .cse0)) (not (= 5 .cse1)) (not (= 5 .cse2)) (<= ~N~0 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 2) ~N~0) (not (= 5 .cse3)) (= (+ .cse0 .cse1 .cse3 .cse2 .cse4) (* 5 ~N~0)))))))))) is different from false [2021-12-15 08:53:48,756 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_149| Int) (|v_ULTIMATE.start_main_~i~0#1_145| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_152| Int) (v_ArrVal_486 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_486))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select v_ArrVal_486 (+ (* |v_ULTIMATE.start_main_~i~0#1_152| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse4 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse0 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_149| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse2 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_147| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse1 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse2 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_145| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 5 .cse0)) (not (= 5 .cse1)) (not (= 5 .cse2)) (<= ~N~0 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 2) ~N~0) (not (= 5 .cse3)) (= (+ .cse0 .cse2 .cse3 .cse1 .cse4) (* 5 ~N~0)))))))))) is different from false [2021-12-15 08:53:49,134 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_149| Int) (|v_ULTIMATE.start_main_~i~0#1_145| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_152| Int) (v_ArrVal_486 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_486))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select v_ArrVal_486 (+ (* |v_ULTIMATE.start_main_~i~0#1_152| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse4 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse0 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_149| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse2 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_147| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse1 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse2 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_145| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 5 .cse0)) (not (= 5 .cse1)) (not (= 5 .cse2)) (<= ~N~0 (+ |c_ULTIMATE.start_main_~i~0#1| 2)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 3) ~N~0) (not (= 5 .cse3)) (= (+ .cse0 .cse2 .cse3 .cse1 .cse4) (* 5 ~N~0)))))))))) is different from false [2021-12-15 08:53:49,827 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_149| Int) (|v_ULTIMATE.start_main_~i~0#1_145| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_152| Int) (v_ArrVal_486 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_486))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select v_ArrVal_486 (+ (* |v_ULTIMATE.start_main_~i~0#1_152| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse4 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse0 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_149| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse2 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_147| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse1 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse2 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_145| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (< (+ |c_ULTIMATE.start_main_~i~0#1| 4) ~N~0) (not (= 5 .cse0)) (<= ~N~0 (+ |c_ULTIMATE.start_main_~i~0#1| 3)) (not (= 5 .cse1)) (not (= 5 .cse2)) (not (= 5 .cse3)) (= (+ .cse0 .cse2 .cse3 .cse1 .cse4) (* 5 ~N~0)))))))))) is different from false [2021-12-15 08:53:50,158 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_149| Int) (|v_ULTIMATE.start_main_~i~0#1_145| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_152| Int) (v_ArrVal_486 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_486))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select v_ArrVal_486 (+ (* |v_ULTIMATE.start_main_~i~0#1_152| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse4 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse0 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_149| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse2 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_147| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse1 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse2 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_145| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (< (+ |c_ULTIMATE.start_main_~i~0#1| 4) ~N~0) (<= ~N~0 (+ |c_ULTIMATE.start_main_~i~0#1| 3)) (not (= 5 .cse0)) (not (= 5 .cse1)) (not (= 5 .cse2)) (not (= 5 .cse3)) (= (+ .cse0 .cse2 .cse3 .cse1 .cse4) (* 5 ~N~0)))))))))) is different from false [2021-12-15 08:53:50,186 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2021-12-15 08:53:50,186 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555975823] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 08:53:50,186 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 08:53:50,186 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18, 20] total 54 [2021-12-15 08:53:50,187 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774405587] [2021-12-15 08:53:50,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 08:53:50,187 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2021-12-15 08:53:50,187 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:53:50,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2021-12-15 08:53:50,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=2081, Unknown=14, NotChecked=582, Total=2862 [2021-12-15 08:53:50,188 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 54 states, 54 states have (on average 1.4814814814814814) internal successors, (80), 54 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:53:50,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:53:50,756 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2021-12-15 08:53:50,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-15 08:53:50,757 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 1.4814814814814814) internal successors, (80), 54 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-12-15 08:53:50,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:53:50,757 INFO L225 Difference]: With dead ends: 52 [2021-12-15 08:53:50,757 INFO L226 Difference]: Without dead ends: 48 [2021-12-15 08:53:50,758 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 32 SyntacticMatches, 7 SemanticMatches, 54 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 832 ImplicationChecksByTransitivity, 17.8s TimeCoverageRelationStatistics Valid=215, Invalid=2245, Unknown=14, NotChecked=606, Total=3080 [2021-12-15 08:53:50,758 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 18 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 360 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 08:53:50,758 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 142 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 229 Invalid, 0 Unknown, 360 Unchecked, 0.1s Time] [2021-12-15 08:53:50,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2021-12-15 08:53:50,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2021-12-15 08:53:50,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 45 states have internal predecessors, (50), 0 states have call successors, (0), 0 states 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 08:53:50,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2021-12-15 08:53:50,762 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 31 [2021-12-15 08:53:50,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:53:50,762 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2021-12-15 08:53:50,762 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 1.4814814814814814) internal successors, (80), 54 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:53:50,762 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2021-12-15 08:53:50,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-15 08:53:50,763 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:53:50,763 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:53:50,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-12-15 08:53:50,963 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-15 08:53:50,963 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:53:50,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:53:50,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1961716541, now seen corresponding path program 3 times [2021-12-15 08:53:50,964 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:53:50,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595241452] [2021-12-15 08:53:50,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:53:50,964 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:53:50,971 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-15 08:53:50,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [316572666] [2021-12-15 08:53:50,972 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-15 08:53:50,972 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:53:50,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 08:53:50,975 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 08:53:50,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-15 08:53:51,041 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-12-15 08:53:51,041 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 08:53:51,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-15 08:53:51,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:53:51,055 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 10 treesize of output 8 [2021-12-15 08:53:51,072 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 15 treesize of output 11 [2021-12-15 08:53:51,140 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 18 treesize of output 20 [2021-12-15 08:53:51,167 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 18 treesize of output 20 [2021-12-15 08:53:51,194 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 18 treesize of output 20 [2021-12-15 08:53:51,220 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 08:53:51,220 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2021-12-15 08:53:51,259 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-15 08:53:51,259 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 08:53:51,312 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_546 (Array Int Int)) (|ULTIMATE.start_main_~i~0#1| Int)) (or (<= c_~N~0 |ULTIMATE.start_main_~i~0#1|) (= 5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_546) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0))) is different from false [2021-12-15 08:53:51,456 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 08:53:51,457 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 26 treesize of output 27 [2021-12-15 08:53:51,462 INFO L354 Elim1Store]: treesize reduction 12, result has 25.0 percent of original size [2021-12-15 08:53:51,462 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 30 [2021-12-15 08:53:51,477 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 13 not checked. [2021-12-15 08:53:51,477 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:53:51,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595241452] [2021-12-15 08:53:51,477 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-15 08:53:51,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316572666] [2021-12-15 08:53:51,478 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [316572666] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 08:53:51,478 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-15 08:53:51,478 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-12-15 08:53:51,478 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362698611] [2021-12-15 08:53:51,478 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-15 08:53:51,478 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-15 08:53:51,478 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:53:51,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-15 08:53:51,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=129, Unknown=6, NotChecked=24, Total=210 [2021-12-15 08:53:51,479 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 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 08:53:55,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:53:55,575 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2021-12-15 08:53:55,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-15 08:53:55,575 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-12-15 08:53:55,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:53:55,575 INFO L225 Difference]: With dead ends: 55 [2021-12-15 08:53:55,575 INFO L226 Difference]: Without dead ends: 51 [2021-12-15 08:53:55,576 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 2 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=73, Invalid=165, Unknown=6, NotChecked=28, Total=272 [2021-12-15 08:53:55,576 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 08:53:55,576 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 38 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 51 Unchecked, 0.0s Time] [2021-12-15 08:53:55,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-12-15 08:53:55,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2021-12-15 08:53:55,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.14) internal successors, (57), 50 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 08:53:55,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2021-12-15 08:53:55,580 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 31 [2021-12-15 08:53:55,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:53:55,581 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2021-12-15 08:53:55,581 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 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 08:53:55,581 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2021-12-15 08:53:55,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-15 08:53:55,581 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:53:55,581 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:53:55,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-12-15 08:53:55,795 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:53:55,795 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:53:55,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:53:55,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1399241145, now seen corresponding path program 11 times [2021-12-15 08:53:55,796 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:53:55,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109385672] [2021-12-15 08:53:55,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:53:55,796 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:53:55,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:53:55,888 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 9 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:53:55,888 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:53:55,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109385672] [2021-12-15 08:53:55,888 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109385672] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 08:53:55,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835739327] [2021-12-15 08:53:55,888 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-15 08:53:55,888 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:53:55,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 08:53:55,890 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 08:53:55,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-12-15 08:53:55,964 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2021-12-15 08:53:55,965 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 08:53:55,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-15 08:53:55,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:53:56,094 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:53:56,094 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 08:53:56,165 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:53:56,165 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [835739327] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 08:53:56,165 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 08:53:56,165 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2021-12-15 08:53:56,165 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281863099] [2021-12-15 08:53:56,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 08:53:56,166 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-15 08:53:56,166 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:53:56,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-15 08:53:56,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2021-12-15 08:53:56,167 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand has 20 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 0 states 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 08:53:56,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:53:56,430 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2021-12-15 08:53:56,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-15 08:53:56,431 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-12-15 08:53:56,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:53:56,431 INFO L225 Difference]: With dead ends: 69 [2021-12-15 08:53:56,431 INFO L226 Difference]: Without dead ends: 65 [2021-12-15 08:53:56,432 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=206, Invalid=664, Unknown=0, NotChecked=0, Total=870 [2021-12-15 08:53:56,432 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 49 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 08:53:56,432 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 34 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-15 08:53:56,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-12-15 08:53:56,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 40. [2021-12-15 08:53:56,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 39 states have internal predecessors, (45), 0 states have call successors, (0), 0 states 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 08:53:56,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2021-12-15 08:53:56,436 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 33 [2021-12-15 08:53:56,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:53:56,436 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2021-12-15 08:53:56,437 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 0 states 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 08:53:56,437 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2021-12-15 08:53:56,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-15 08:53:56,437 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:53:56,437 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:53:56,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-12-15 08:53:56,643 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-12-15 08:53:56,643 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:53:56,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:53:56,644 INFO L85 PathProgramCache]: Analyzing trace with hash 981485409, now seen corresponding path program 12 times [2021-12-15 08:53:56,644 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:53:56,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922515552] [2021-12-15 08:53:56,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:53:56,644 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:53:56,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:53:56,741 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 25 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:53:56,742 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:53:56,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922515552] [2021-12-15 08:53:56,742 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922515552] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 08:53:56,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417569474] [2021-12-15 08:53:56,742 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-15 08:53:56,742 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:53:56,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 08:53:56,743 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 08:53:56,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-12-15 08:53:56,814 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2021-12-15 08:53:56,814 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 08:53:56,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-15 08:53:56,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:53:56,957 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 35 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:53:56,958 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 08:53:57,027 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 35 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:53:57,027 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [417569474] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 08:53:57,027 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 08:53:57,027 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2021-12-15 08:53:57,027 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575281053] [2021-12-15 08:53:57,027 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 08:53:57,027 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-15 08:53:57,027 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 08:53:57,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-15 08:53:57,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2021-12-15 08:53:57,028 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand has 20 states, 20 states have (on average 2.75) internal successors, (55), 20 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:53:57,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 08:53:57,159 INFO L93 Difference]: Finished difference Result 78 states and 90 transitions. [2021-12-15 08:53:57,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-15 08:53:57,159 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.75) internal successors, (55), 20 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-12-15 08:53:57,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 08:53:57,159 INFO L225 Difference]: With dead ends: 78 [2021-12-15 08:53:57,159 INFO L226 Difference]: Without dead ends: 50 [2021-12-15 08:53:57,160 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2021-12-15 08:53:57,160 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 56 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 08:53:57,160 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 34 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 08:53:57,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-12-15 08:53:57,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2021-12-15 08:53:57,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.146341463414634) internal successors, (47), 41 states have internal predecessors, (47), 0 states have call successors, (0), 0 states 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 08:53:57,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2021-12-15 08:53:57,164 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 34 [2021-12-15 08:53:57,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 08:53:57,164 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2021-12-15 08:53:57,164 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.75) internal successors, (55), 20 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 08:53:57,164 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2021-12-15 08:53:57,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-15 08:53:57,164 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 08:53:57,164 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 08:53:57,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-12-15 08:53:57,364 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-12-15 08:53:57,365 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 08:53:57,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 08:53:57,365 INFO L85 PathProgramCache]: Analyzing trace with hash -596322977, now seen corresponding path program 13 times [2021-12-15 08:53:57,365 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 08:53:57,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5742996] [2021-12-15 08:53:57,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 08:53:57,365 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 08:53:57,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:53:57,907 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:53:57,907 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 08:53:57,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5742996] [2021-12-15 08:53:57,907 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5742996] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 08:53:57,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910680213] [2021-12-15 08:53:57,907 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-12-15 08:53:57,907 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 08:53:57,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 08:53:57,908 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 08:53:57,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-12-15 08:53:57,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 08:53:57,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 73 conjunts are in the unsatisfiable core [2021-12-15 08:53:57,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 08:53:57,980 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 11 treesize of output 7 [2021-12-15 08:53:57,983 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 10 treesize of output 8 [2021-12-15 08:53:57,997 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-15 08:53:58,024 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-15 08:53:58,050 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-15 08:53:58,072 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-15 08:53:58,092 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-15 08:53:58,234 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2021-12-15 08:53:58,337 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-15 08:53:58,337 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2021-12-15 08:53:58,453 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-15 08:53:58,453 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2021-12-15 08:53:58,588 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-15 08:53:58,588 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2021-12-15 08:53:58,713 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-15 08:53:58,713 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2021-12-15 08:53:58,876 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-15 08:53:58,876 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 32 [2021-12-15 08:53:58,908 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 08:53:58,908 INFO L328 TraceCheckSpWp]: Computing backward predicates...