./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/s32if.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ff03de63 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-fpi/s32if.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 371b46898ac196d32c6a3ef4c51b315e7fba4a376d0f69ff343a10a3b7c63d98 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ff03de6 [2021-12-21 10:14:53,554 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 10:14:53,556 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 10:14:53,609 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 10:14:53,610 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 10:14:53,612 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 10:14:53,613 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 10:14:53,615 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 10:14:53,616 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 10:14:53,620 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 10:14:53,620 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 10:14:53,621 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 10:14:53,621 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 10:14:53,623 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 10:14:53,624 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 10:14:53,626 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 10:14:53,627 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 10:14:53,628 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 10:14:53,629 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 10:14:53,633 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 10:14:53,634 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 10:14:53,635 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 10:14:53,636 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 10:14:53,636 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 10:14:53,641 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 10:14:53,641 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 10:14:53,641 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 10:14:53,642 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 10:14:53,643 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 10:14:53,643 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 10:14:53,643 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 10:14:53,644 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 10:14:53,645 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 10:14:53,646 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 10:14:53,647 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 10:14:53,647 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 10:14:53,648 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 10:14:53,648 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 10:14:53,648 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 10:14:53,649 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 10:14:53,649 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 10:14:53,650 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-21 10:14:53,678 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 10:14:53,678 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 10:14:53,678 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 10:14:53,678 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 10:14:53,679 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-21 10:14:53,679 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-21 10:14:53,680 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 10:14:53,680 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 10:14:53,680 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 10:14:53,680 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 10:14:53,681 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-21 10:14:53,681 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-21 10:14:53,681 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-21 10:14:53,681 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 10:14:53,681 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-21 10:14:53,681 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-21 10:14:53,682 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-21 10:14:53,682 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-21 10:14:53,682 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-21 10:14:53,682 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 10:14:53,682 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-21 10:14:53,682 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 10:14:53,683 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 10:14:53,683 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-21 10:14:53,683 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 10:14:53,683 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 10:14:53,683 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-21 10:14:53,683 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-21 10:14:53,683 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-21 10:14:53,684 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-21 10:14:53,684 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-21 10:14:53,684 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-21 10:14:53,684 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-21 10:14:53,684 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 10:14:53,684 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 -> 371b46898ac196d32c6a3ef4c51b315e7fba4a376d0f69ff343a10a3b7c63d98 [2021-12-21 10:14:53,877 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 10:14:53,902 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 10:14:53,904 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 10:14:53,905 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 10:14:53,905 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 10:14:53,906 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/s32if.c [2021-12-21 10:14:53,958 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9942916c3/a6ac7ac5f03045408c65e7a54e23fa81/FLAG322d955ee [2021-12-21 10:14:54,298 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 10:14:54,298 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s32if.c [2021-12-21 10:14:54,302 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9942916c3/a6ac7ac5f03045408c65e7a54e23fa81/FLAG322d955ee [2021-12-21 10:14:54,310 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9942916c3/a6ac7ac5f03045408c65e7a54e23fa81 [2021-12-21 10:14:54,312 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 10:14:54,313 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 10:14:54,314 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 10:14:54,314 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 10:14:54,320 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 10:14:54,320 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 10:14:54" (1/1) ... [2021-12-21 10:14:54,321 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@463f4519 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:54, skipping insertion in model container [2021-12-21 10:14:54,321 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 10:14:54" (1/1) ... [2021-12-21 10:14:54,325 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 10:14:54,334 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 10:14:54,441 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/s32if.c[588,601] [2021-12-21 10:14:54,454 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 10:14:54,462 INFO L203 MainTranslator]: Completed pre-run [2021-12-21 10:14:54,470 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/s32if.c[588,601] [2021-12-21 10:14:54,479 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 10:14:54,487 INFO L208 MainTranslator]: Completed translation [2021-12-21 10:14:54,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:54 WrapperNode [2021-12-21 10:14:54,488 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 10:14:54,489 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-21 10:14:54,489 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-21 10:14:54,489 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-21 10:14:54,494 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:54" (1/1) ... [2021-12-21 10:14:54,498 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:54" (1/1) ... [2021-12-21 10:14:54,512 INFO L137 Inliner]: procedures = 17, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 90 [2021-12-21 10:14:54,513 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-21 10:14:54,513 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-21 10:14:54,513 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-21 10:14:54,513 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-21 10:14:54,519 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:54" (1/1) ... [2021-12-21 10:14:54,519 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:54" (1/1) ... [2021-12-21 10:14:54,529 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:54" (1/1) ... [2021-12-21 10:14:54,529 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:54" (1/1) ... [2021-12-21 10:14:54,534 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:54" (1/1) ... [2021-12-21 10:14:54,536 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:54" (1/1) ... [2021-12-21 10:14:54,537 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:54" (1/1) ... [2021-12-21 10:14:54,538 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-21 10:14:54,539 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-21 10:14:54,539 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-21 10:14:54,539 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-21 10:14:54,547 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:54" (1/1) ... [2021-12-21 10:14:54,552 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 10:14:54,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:14:54,568 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-21 10:14:54,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-21 10:14:54,591 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-21 10:14:54,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-21 10:14:54,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-21 10:14:54,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-21 10:14:54,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-21 10:14:54,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-21 10:14:54,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-21 10:14:54,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-21 10:14:54,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-21 10:14:54,677 INFO L234 CfgBuilder]: Building ICFG [2021-12-21 10:14:54,679 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-21 10:14:54,868 INFO L275 CfgBuilder]: Performing block encoding [2021-12-21 10:14:54,872 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-21 10:14:54,873 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2021-12-21 10:14:54,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 10:14:54 BoogieIcfgContainer [2021-12-21 10:14:54,874 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-21 10:14:54,875 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-21 10:14:54,875 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-21 10:14:54,879 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-21 10:14:54,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 10:14:54" (1/3) ... [2021-12-21 10:14:54,881 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@191b4046 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 10:14:54, skipping insertion in model container [2021-12-21 10:14:54,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:14:54" (2/3) ... [2021-12-21 10:14:54,881 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@191b4046 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 10:14:54, skipping insertion in model container [2021-12-21 10:14:54,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 10:14:54" (3/3) ... [2021-12-21 10:14:54,882 INFO L111 eAbstractionObserver]: Analyzing ICFG s32if.c [2021-12-21 10:14:54,887 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-21 10:14:54,887 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-21 10:14:54,928 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-21 10:14:54,936 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-21 10:14:54,936 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-21 10:14:54,947 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:14:54,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-21 10:14:54,958 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:14:54,958 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:14:54,959 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:14:54,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:14:54,963 INFO L85 PathProgramCache]: Analyzing trace with hash -845308063, now seen corresponding path program 1 times [2021-12-21 10:14:54,969 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:14:54,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038942652] [2021-12-21 10:14:54,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:14:54,970 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:14:55,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:14:55,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 10:14:55,083 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:14:55,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038942652] [2021-12-21 10:14:55,084 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038942652] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 10:14:55,084 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 10:14:55,085 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 10:14:55,086 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468453844] [2021-12-21 10:14:55,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 10:14:55,088 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-21 10:14:55,089 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:14:55,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-21 10:14:55,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-21 10:14:55,123 INFO L87 Difference]: Start difference. First operand has 23 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:14:55,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:14:55,134 INFO L93 Difference]: Finished difference Result 42 states and 60 transitions. [2021-12-21 10:14:55,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-21 10:14:55,138 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-12-21 10:14:55,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:14:55,143 INFO L225 Difference]: With dead ends: 42 [2021-12-21 10:14:55,143 INFO L226 Difference]: Without dead ends: 19 [2021-12-21 10:14:55,148 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-21 10:14:55,152 INFO L933 BasicCegarLoop]: 28 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, 28 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-21 10:14:55,153 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 10:14:55,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2021-12-21 10:14:55,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2021-12-21 10:14:55,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:14:55,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2021-12-21 10:14:55,175 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 13 [2021-12-21 10:14:55,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:14:55,175 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2021-12-21 10:14:55,175 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:14:55,175 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2021-12-21 10:14:55,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-21 10:14:55,176 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:14:55,176 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:14:55,176 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-21 10:14:55,177 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:14:55,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:14:55,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1238662774, now seen corresponding path program 1 times [2021-12-21 10:14:55,178 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:14:55,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76362093] [2021-12-21 10:14:55,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:14:55,179 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:14:55,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:14:55,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 10:14:55,270 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:14:55,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76362093] [2021-12-21 10:14:55,270 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76362093] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 10:14:55,270 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 10:14:55,271 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 10:14:55,271 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522030162] [2021-12-21 10:14:55,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 10:14:55,272 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 10:14:55,273 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:14:55,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 10:14:55,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-21 10:14:55,274 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:14:55,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:14:55,333 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2021-12-21 10:14:55,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 10:14:55,333 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-12-21 10:14:55,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:14:55,335 INFO L225 Difference]: With dead ends: 39 [2021-12-21 10:14:55,335 INFO L226 Difference]: Without dead ends: 27 [2021-12-21 10:14:55,338 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-21 10:14:55,339 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 33 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 10:14:55,339 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 11 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 10:14:55,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-12-21 10:14:55,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2021-12-21 10:14:55,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 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-21 10:14:55,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2021-12-21 10:14:55,348 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 13 [2021-12-21 10:14:55,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:14:55,350 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2021-12-21 10:14:55,352 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:14:55,352 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2021-12-21 10:14:55,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-21 10:14:55,353 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:14:55,353 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:14:55,354 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-21 10:14:55,354 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:14:55,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:14:55,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1944018757, now seen corresponding path program 1 times [2021-12-21 10:14:55,358 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:14:55,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186170042] [2021-12-21 10:14:55,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:14:55,359 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:14:55,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:14:55,695 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 10:14:55,695 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:14:55,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186170042] [2021-12-21 10:14:55,696 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186170042] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 10:14:55,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103401846] [2021-12-21 10:14:55,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:14:55,697 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:14:55,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:14:55,698 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 10:14:55,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-21 10:14:55,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:14:55,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 29 conjunts are in the unsatisfiable core [2021-12-21 10:14:55,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:14:55,798 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-12-21 10:14:55,806 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 10:14:55,837 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-21 10:14:55,902 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-21 10:14:55,981 INFO L387 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-21 10:14:56,086 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2021-12-21 10:14:56,115 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 10:14:56,115 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 10:14:56,252 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_46 (Array Int Int))) (let ((.cse0 (select v_ArrVal_46 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (or (not (= .cse0 4)) (= (+ .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_46) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (* c_~N~0 4))))) is different from false [2021-12-21 10:14:56,421 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 10:14:56,421 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2021-12-21 10:14:56,425 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 10:14:56,426 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2021-12-21 10:14:56,429 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-12-21 10:14:56,439 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-12-21 10:14:56,439 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103401846] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 10:14:56,439 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 10:14:56,439 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 19 [2021-12-21 10:14:56,440 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916079880] [2021-12-21 10:14:56,440 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 10:14:56,440 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-21 10:14:56,440 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:14:56,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-21 10:14:56,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=244, Unknown=2, NotChecked=32, Total=342 [2021-12-21 10:14:56,441 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 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-21 10:14:56,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:14:56,726 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2021-12-21 10:14:56,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-21 10:14:56,726 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 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) Word has length 21 [2021-12-21 10:14:56,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:14:56,728 INFO L225 Difference]: With dead ends: 42 [2021-12-21 10:14:56,728 INFO L226 Difference]: Without dead ends: 38 [2021-12-21 10:14:56,728 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=418, Unknown=2, NotChecked=44, Total=600 [2021-12-21 10:14:56,729 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 31 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 100 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 10:14:56,729 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 69 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 123 Invalid, 0 Unknown, 100 Unchecked, 0.1s Time] [2021-12-21 10:14:56,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2021-12-21 10:14:56,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 33. [2021-12-21 10:14:56,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:14:56,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2021-12-21 10:14:56,734 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 21 [2021-12-21 10:14:56,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:14:56,734 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2021-12-21 10:14:56,734 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 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-21 10:14:56,734 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2021-12-21 10:14:56,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-21 10:14:56,734 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:14:56,734 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:14:56,754 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-21 10:14:56,951 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-21 10:14:56,951 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:14:56,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:14:56,952 INFO L85 PathProgramCache]: Analyzing trace with hash 2001277059, now seen corresponding path program 1 times [2021-12-21 10:14:56,952 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:14:56,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322055211] [2021-12-21 10:14:56,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:14:56,952 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:14:56,964 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-21 10:14:56,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1077411156] [2021-12-21 10:14:56,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:14:56,964 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:14:56,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:14:56,965 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 10:14:56,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-21 10:14:57,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:14:57,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-21 10:14:57,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:14:57,049 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-21 10:14:57,101 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-21 10:14:57,112 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 10:14:57,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 10:14:57,154 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2021-12-21 10:14:57,162 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-21 10:14:57,162 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 30 [2021-12-21 10:14:57,177 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 10:14:57,177 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:14:57,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322055211] [2021-12-21 10:14:57,177 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-21 10:14:57,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1077411156] [2021-12-21 10:14:57,179 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1077411156] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 10:14:57,179 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 10:14:57,179 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2021-12-21 10:14:57,180 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968445360] [2021-12-21 10:14:57,180 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 10:14:57,181 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-21 10:14:57,181 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:14:57,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-21 10:14:57,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-12-21 10:14:57,182 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 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-21 10:14:57,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:14:57,296 INFO L93 Difference]: Finished difference Result 58 states and 75 transitions. [2021-12-21 10:14:57,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-21 10:14:57,296 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 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-21 10:14:57,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:14:57,297 INFO L225 Difference]: With dead ends: 58 [2021-12-21 10:14:57,297 INFO L226 Difference]: Without dead ends: 51 [2021-12-21 10:14:57,297 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2021-12-21 10:14:57,298 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 27 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 10:14:57,298 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 64 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 10:14:57,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-12-21 10:14:57,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 39. [2021-12-21 10:14:57,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.263157894736842) internal successors, (48), 38 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:14:57,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2021-12-21 10:14:57,312 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 21 [2021-12-21 10:14:57,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:14:57,312 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2021-12-21 10:14:57,313 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 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-21 10:14:57,313 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2021-12-21 10:14:57,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-21 10:14:57,314 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:14:57,315 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:14:57,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-21 10:14:57,534 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-21 10:14:57,534 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:14:57,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:14:57,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1649883961, now seen corresponding path program 1 times [2021-12-21 10:14:57,534 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:14:57,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501996167] [2021-12-21 10:14:57,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:14:57,535 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:14:57,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:14:57,648 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 10:14:57,648 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:14:57,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501996167] [2021-12-21 10:14:57,649 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501996167] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 10:14:57,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116410983] [2021-12-21 10:14:57,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:14:57,649 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:14:57,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:14:57,650 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 10:14:57,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-21 10:14:57,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:14:57,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-21 10:14:57,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:14:57,710 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-12-21 10:14:57,739 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-21 10:14:57,752 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 10:14:57,752 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 10:14:57,784 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2021-12-21 10:14:57,786 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2021-12-21 10:14:57,796 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 10:14:57,797 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [116410983] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 10:14:57,797 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 10:14:57,797 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2021-12-21 10:14:57,797 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097242689] [2021-12-21 10:14:57,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 10:14:57,797 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-21 10:14:57,798 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:14:57,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-21 10:14:57,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-12-21 10:14:57,798 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 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-21 10:14:57,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:14:57,864 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2021-12-21 10:14:57,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-21 10:14:57,864 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 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 21 [2021-12-21 10:14:57,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:14:57,865 INFO L225 Difference]: With dead ends: 58 [2021-12-21 10:14:57,865 INFO L226 Difference]: Without dead ends: 46 [2021-12-21 10:14:57,865 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2021-12-21 10:14:57,866 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 10 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 10:14:57,866 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 52 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 10:14:57,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2021-12-21 10:14:57,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 41. [2021-12-21 10:14:57,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.25) internal successors, (50), 40 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-21 10:14:57,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2021-12-21 10:14:57,870 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 21 [2021-12-21 10:14:57,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:14:57,870 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2021-12-21 10:14:57,870 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 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-21 10:14:57,871 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2021-12-21 10:14:57,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-21 10:14:57,871 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:14:57,871 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:14:57,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-21 10:14:58,086 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-21 10:14:58,086 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:14:58,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:14:58,086 INFO L85 PathProgramCache]: Analyzing trace with hash -823792505, now seen corresponding path program 2 times [2021-12-21 10:14:58,086 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:14:58,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440048945] [2021-12-21 10:14:58,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:14:58,087 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:14:58,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:14:58,153 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 10:14:58,153 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:14:58,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440048945] [2021-12-21 10:14:58,153 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440048945] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 10:14:58,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1504950167] [2021-12-21 10:14:58,154 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-21 10:14:58,154 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:14:58,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:14:58,155 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 10:14:58,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-21 10:14:58,201 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-21 10:14:58,202 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 10:14:58,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-21 10:14:58,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:14:58,264 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 10:14:58,264 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 10:14:58,307 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 10:14:58,307 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1504950167] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 10:14:58,307 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 10:14:58,308 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2021-12-21 10:14:58,308 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624736674] [2021-12-21 10:14:58,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 10:14:58,308 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-21 10:14:58,308 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:14:58,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-21 10:14:58,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-12-21 10:14:58,309 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:14:58,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:14:58,447 INFO L93 Difference]: Finished difference Result 69 states and 85 transitions. [2021-12-21 10:14:58,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-21 10:14:58,448 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-21 10:14:58,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:14:58,448 INFO L225 Difference]: With dead ends: 69 [2021-12-21 10:14:58,449 INFO L226 Difference]: Without dead ends: 59 [2021-12-21 10:14:58,449 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 40 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-21 10:14:58,449 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 62 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 10:14:58,450 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 28 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 10:14:58,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-12-21 10:14:58,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 39. [2021-12-21 10:14:58,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.236842105263158) internal successors, (47), 38 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-21 10:14:58,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2021-12-21 10:14:58,455 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 23 [2021-12-21 10:14:58,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:14:58,455 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2021-12-21 10:14:58,455 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:14:58,455 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2021-12-21 10:14:58,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-21 10:14:58,456 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:14:58,456 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:14:58,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-21 10:14:58,671 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-21 10:14:58,671 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:14:58,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:14:58,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1832157868, now seen corresponding path program 3 times [2021-12-21 10:14:58,672 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:14:58,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411463115] [2021-12-21 10:14:58,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:14:58,672 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:14:58,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:14:58,716 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 10:14:58,717 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:14:58,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411463115] [2021-12-21 10:14:58,717 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411463115] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 10:14:58,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625293627] [2021-12-21 10:14:58,717 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-21 10:14:58,717 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:14:58,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:14:58,718 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 10:14:58,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-21 10:14:58,764 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-12-21 10:14:58,764 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 10:14:58,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-21 10:14:58,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:14:58,841 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 10:14:58,841 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 10:14:58,904 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 10:14:58,905 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1625293627] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 10:14:58,905 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 10:14:58,905 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2021-12-21 10:14:58,905 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166218114] [2021-12-21 10:14:58,905 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 10:14:58,905 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-21 10:14:58,906 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:14:58,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-21 10:14:58,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-12-21 10:14:58,906 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:14:58,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:14:58,984 INFO L93 Difference]: Finished difference Result 73 states and 90 transitions. [2021-12-21 10:14:58,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-21 10:14:58,984 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-12-21 10:14:58,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:14:58,985 INFO L225 Difference]: With dead ends: 73 [2021-12-21 10:14:58,985 INFO L226 Difference]: Without dead ends: 42 [2021-12-21 10:14:58,985 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2021-12-21 10:14:58,986 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 54 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 10:14:58,986 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 21 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 10:14:58,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2021-12-21 10:14:58,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2021-12-21 10:14:58,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:14:58,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2021-12-21 10:14:58,990 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 24 [2021-12-21 10:14:58,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:14:58,990 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2021-12-21 10:14:58,990 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:14:58,990 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2021-12-21 10:14:58,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-21 10:14:58,991 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:14:58,991 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:14:59,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-12-21 10:14:59,191 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-21 10:14:59,192 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:14:59,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:14:59,195 INFO L85 PathProgramCache]: Analyzing trace with hash -14433298, now seen corresponding path program 4 times [2021-12-21 10:14:59,195 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:14:59,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310439161] [2021-12-21 10:14:59,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:14:59,195 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:14:59,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:14:59,593 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-21 10:14:59,593 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:14:59,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310439161] [2021-12-21 10:14:59,593 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310439161] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 10:14:59,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515835667] [2021-12-21 10:14:59,594 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-21 10:14:59,594 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:14:59,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:14:59,595 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 10:14:59,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-21 10:14:59,638 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-21 10:14:59,639 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 10:14:59,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 38 conjunts are in the unsatisfiable core [2021-12-21 10:14:59,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:14:59,653 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 10:14:59,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:14:59,674 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-21 10:14:59,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:14:59,707 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-21 10:14:59,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:14:59,808 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-21 10:14:59,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:14:59,844 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-21 10:14:59,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:14:59,920 INFO L387 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-21 10:15:00,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:15:00,015 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-21 10:15:00,015 INFO L387 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-21 10:15:00,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:15:00,176 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-21 10:15:00,176 INFO L387 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-21 10:15:00,202 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-21 10:15:00,202 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 10:15:00,480 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_208 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_63| Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_208))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse1 (select v_ArrVal_208 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (let ((.cse0 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_63| 4))))) (or (not (= .cse0 4)) (not (= .cse1 4)) (= (* c_~N~0 4) (+ .cse2 .cse0 .cse1)))))))) is different from false [2021-12-21 10:15:00,776 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_208 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_69| Int) (|v_ULTIMATE.start_main_~i~0#1_63| Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_208))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (select v_ArrVal_208 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_69| 4))))) (let ((.cse1 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_63| 4))))) (or (not (= .cse0 4)) (and (<= (div (+ (- 1) .cse1 .cse2 .cse0) 4) |c_ULTIMATE.start_main_~i~0#1|) (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) (div (+ .cse1 .cse2 .cse0) 4))) (not (= .cse1 4)))))))) is different from false [2021-12-21 10:15:00,846 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_208 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_69| Int) (|v_ULTIMATE.start_main_~i~0#1_63| Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_208))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (select v_ArrVal_208 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_69| 4))))) (let ((.cse1 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse2 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_63| 4))))) (or (not (= .cse0 4)) (not (= .cse1 4)) (and (<= (+ 2 |c_ULTIMATE.start_main_~i~0#1|) (div (+ .cse1 .cse2 .cse0) 4)) (<= (div (+ (- 1) .cse1 .cse2 .cse0) 4) (+ |c_ULTIMATE.start_main_~i~0#1| 1))))))))) is different from false [2021-12-21 10:15:00,925 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 7 not checked. [2021-12-21 10:15:00,925 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [515835667] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 10:15:00,925 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 10:15:00,925 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 13] total 35 [2021-12-21 10:15:00,925 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695174966] [2021-12-21 10:15:00,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 10:15:00,926 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-12-21 10:15:00,926 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:15:00,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-12-21 10:15:00,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=865, Unknown=3, NotChecked=186, Total=1190 [2021-12-21 10:15:00,927 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 35 states, 35 states have (on average 2.0285714285714285) internal successors, (71), 35 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:01,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:15:01,600 INFO L93 Difference]: Finished difference Result 82 states and 104 transitions. [2021-12-21 10:15:01,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-21 10:15:01,600 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.0285714285714285) internal successors, (71), 35 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-21 10:15:01,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:15:01,601 INFO L225 Difference]: With dead ends: 82 [2021-12-21 10:15:01,601 INFO L226 Difference]: Without dead ends: 78 [2021-12-21 10:15:01,602 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 41 SyntacticMatches, 6 SemanticMatches, 46 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=339, Invalid=1650, Unknown=3, NotChecked=264, Total=2256 [2021-12-21 10:15:01,602 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 51 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 306 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 10:15:01,602 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 107 Invalid, 777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 372 Invalid, 0 Unknown, 306 Unchecked, 0.2s Time] [2021-12-21 10:15:01,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-12-21 10:15:01,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 65. [2021-12-21 10:15:01,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.28125) internal successors, (82), 64 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:01,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 82 transitions. [2021-12-21 10:15:01,609 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 82 transitions. Word has length 29 [2021-12-21 10:15:01,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:15:01,609 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 82 transitions. [2021-12-21 10:15:01,609 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.0285714285714285) internal successors, (71), 35 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:01,609 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 82 transitions. [2021-12-21 10:15:01,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-21 10:15:01,610 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:15:01,610 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:15:01,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-21 10:15:01,823 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-21 10:15:01,823 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:15:01,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:15:01,824 INFO L85 PathProgramCache]: Analyzing trace with hash 42825004, now seen corresponding path program 1 times [2021-12-21 10:15:01,824 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:15:01,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106824352] [2021-12-21 10:15:01,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:15:01,824 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:15:01,833 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-21 10:15:01,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1604939220] [2021-12-21 10:15:01,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:15:01,833 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:15:01,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:15:01,834 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 10:15:01,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-21 10:15:01,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:15:01,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-21 10:15:01,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:15:01,957 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2021-12-21 10:15:02,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:15:02,011 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-21 10:15:02,038 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2021-12-21 10:15:02,050 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-21 10:15:02,050 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 10:15:02,086 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_253 (Array Int Int))) (= (+ (- 3) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_253) |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))) 1)) is different from false [2021-12-21 10:15:02,093 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_253 (Array Int Int))) (= (+ (- 3) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_253) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) 1)) is different from false [2021-12-21 10:15:02,126 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 10:15:02,126 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 33 [2021-12-21 10:15:02,131 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 10:15:02,132 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 42 [2021-12-21 10:15:02,134 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-21 10:15:02,193 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 5 not checked. [2021-12-21 10:15:02,194 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:15:02,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106824352] [2021-12-21 10:15:02,194 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-21 10:15:02,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604939220] [2021-12-21 10:15:02,194 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1604939220] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 10:15:02,194 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 10:15:02,194 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-12-21 10:15:02,195 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390159557] [2021-12-21 10:15:02,195 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 10:15:02,195 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-21 10:15:02,195 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:15:02,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-21 10:15:02,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=217, Unknown=2, NotChecked=62, Total=342 [2021-12-21 10:15:02,196 INFO L87 Difference]: Start difference. First operand 65 states and 82 transitions. Second operand has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 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-21 10:15:02,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:15:02,382 INFO L93 Difference]: Finished difference Result 113 states and 143 transitions. [2021-12-21 10:15:02,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-21 10:15:02,382 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 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) Word has length 29 [2021-12-21 10:15:02,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:15:02,383 INFO L225 Difference]: With dead ends: 113 [2021-12-21 10:15:02,383 INFO L226 Difference]: Without dead ends: 106 [2021-12-21 10:15:02,383 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=267, Unknown=2, NotChecked=70, Total=420 [2021-12-21 10:15:02,384 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 62 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 136 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 10:15:02,384 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 88 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 254 Invalid, 0 Unknown, 136 Unchecked, 0.1s Time] [2021-12-21 10:15:02,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-12-21 10:15:02,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 81. [2021-12-21 10:15:02,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.275) internal successors, (102), 80 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:02,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 102 transitions. [2021-12-21 10:15:02,391 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 102 transitions. Word has length 29 [2021-12-21 10:15:02,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:15:02,392 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 102 transitions. [2021-12-21 10:15:02,392 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 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-21 10:15:02,392 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 102 transitions. [2021-12-21 10:15:02,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-21 10:15:02,393 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:15:02,393 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:15:02,427 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-21 10:15:02,604 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-21 10:15:02,604 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:15:02,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:15:02,605 INFO L85 PathProgramCache]: Analyzing trace with hash -968292246, now seen corresponding path program 1 times [2021-12-21 10:15:02,605 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:15:02,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795202340] [2021-12-21 10:15:02,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:15:02,605 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:15:02,616 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-21 10:15:02,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [792877670] [2021-12-21 10:15:02,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:15:02,616 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:15:02,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:15:02,625 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 10:15:02,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-21 10:15:02,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:15:02,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 19 conjunts are in the unsatisfiable core [2021-12-21 10:15:02,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:15:02,694 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-21 10:15:02,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:15:02,727 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2021-12-21 10:15:02,741 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-21 10:15:02,756 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-21 10:15:02,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 10:15:02,818 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2021-12-21 10:15:02,819 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2021-12-21 10:15:02,836 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-21 10:15:02,837 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:15:02,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795202340] [2021-12-21 10:15:02,837 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-21 10:15:02,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [792877670] [2021-12-21 10:15:02,837 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [792877670] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 10:15:02,837 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 10:15:02,837 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2021-12-21 10:15:02,838 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526480180] [2021-12-21 10:15:02,838 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 10:15:02,838 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-21 10:15:02,838 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:15:02,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-21 10:15:02,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2021-12-21 10:15:02,839 INFO L87 Difference]: Start difference. First operand 81 states and 102 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 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-21 10:15:02,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:15:02,947 INFO L93 Difference]: Finished difference Result 123 states and 158 transitions. [2021-12-21 10:15:02,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-21 10:15:02,948 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 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 29 [2021-12-21 10:15:02,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:15:02,948 INFO L225 Difference]: With dead ends: 123 [2021-12-21 10:15:02,948 INFO L226 Difference]: Without dead ends: 92 [2021-12-21 10:15:02,949 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2021-12-21 10:15:02,949 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 11 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 10:15:02,950 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 64 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 10:15:02,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-12-21 10:15:02,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 81. [2021-12-21 10:15:02,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.25) internal successors, (100), 80 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:02,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 100 transitions. [2021-12-21 10:15:02,962 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 100 transitions. Word has length 29 [2021-12-21 10:15:02,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:15:02,962 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 100 transitions. [2021-12-21 10:15:02,962 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 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-21 10:15:02,962 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2021-12-21 10:15:02,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-21 10:15:02,964 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:15:02,964 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:15:02,980 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-21 10:15:03,181 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-21 10:15:03,181 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:15:03,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:15:03,182 INFO L85 PathProgramCache]: Analyzing trace with hash -554569936, now seen corresponding path program 5 times [2021-12-21 10:15:03,182 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:15:03,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916328320] [2021-12-21 10:15:03,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:15:03,182 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:15:03,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:15:03,229 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-21 10:15:03,229 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:15:03,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916328320] [2021-12-21 10:15:03,229 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916328320] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 10:15:03,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236452956] [2021-12-21 10:15:03,229 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-21 10:15:03,229 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:15:03,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:15:03,230 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 10:15:03,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-21 10:15:03,288 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2021-12-21 10:15:03,288 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 10:15:03,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-21 10:15:03,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:15:03,377 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-21 10:15:03,377 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 10:15:03,433 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-21 10:15:03,434 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236452956] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 10:15:03,434 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 10:15:03,434 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2021-12-21 10:15:03,434 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092414854] [2021-12-21 10:15:03,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 10:15:03,434 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-21 10:15:03,435 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:15:03,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-21 10:15:03,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2021-12-21 10:15:03,435 INFO L87 Difference]: Start difference. First operand 81 states and 100 transitions. Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:03,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:15:03,609 INFO L93 Difference]: Finished difference Result 115 states and 145 transitions. [2021-12-21 10:15:03,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-21 10:15:03,610 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-12-21 10:15:03,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:15:03,610 INFO L225 Difference]: With dead ends: 115 [2021-12-21 10:15:03,610 INFO L226 Difference]: Without dead ends: 102 [2021-12-21 10:15:03,611 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 55 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-21 10:15:03,611 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 74 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 10:15:03,611 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 31 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 10:15:03,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-12-21 10:15:03,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 80. [2021-12-21 10:15:03,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.2658227848101267) internal successors, (100), 79 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:03,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 100 transitions. [2021-12-21 10:15:03,618 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 100 transitions. Word has length 31 [2021-12-21 10:15:03,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:15:03,618 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 100 transitions. [2021-12-21 10:15:03,618 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:03,618 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 100 transitions. [2021-12-21 10:15:03,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-21 10:15:03,619 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:15:03,619 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:15:03,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-21 10:15:03,832 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-21 10:15:03,832 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:15:03,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:15:03,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1053387787, now seen corresponding path program 6 times [2021-12-21 10:15:03,832 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:15:03,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685519667] [2021-12-21 10:15:03,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:15:03,832 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:15:03,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:15:03,883 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-21 10:15:03,883 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:15:03,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685519667] [2021-12-21 10:15:03,883 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685519667] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 10:15:03,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099127364] [2021-12-21 10:15:03,883 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-21 10:15:03,883 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:15:03,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:15:03,884 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 10:15:03,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-21 10:15:03,939 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2021-12-21 10:15:03,940 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 10:15:03,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-21 10:15:03,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:15:04,013 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-21 10:15:04,013 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 10:15:04,064 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-21 10:15:04,064 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2099127364] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 10:15:04,064 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 10:15:04,065 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2021-12-21 10:15:04,065 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068435128] [2021-12-21 10:15:04,065 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 10:15:04,065 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-21 10:15:04,065 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:15:04,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-21 10:15:04,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2021-12-21 10:15:04,066 INFO L87 Difference]: Start difference. First operand 80 states and 100 transitions. Second operand has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 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-21 10:15:04,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:15:04,172 INFO L93 Difference]: Finished difference Result 103 states and 127 transitions. [2021-12-21 10:15:04,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-21 10:15:04,173 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 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) Word has length 32 [2021-12-21 10:15:04,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:15:04,173 INFO L225 Difference]: With dead ends: 103 [2021-12-21 10:15:04,173 INFO L226 Difference]: Without dead ends: 50 [2021-12-21 10:15:04,173 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2021-12-21 10:15:04,174 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 65 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 10:15:04,174 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 33 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 10:15:04,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-12-21 10:15:04,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 44. [2021-12-21 10:15:04,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 43 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:04,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2021-12-21 10:15:04,178 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 32 [2021-12-21 10:15:04,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:15:04,178 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2021-12-21 10:15:04,178 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 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-21 10:15:04,178 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2021-12-21 10:15:04,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-21 10:15:04,178 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:15:04,179 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:15:04,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-21 10:15:04,395 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-21 10:15:04,396 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:15:04,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:15:04,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1383779305, now seen corresponding path program 7 times [2021-12-21 10:15:04,396 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:15:04,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985116714] [2021-12-21 10:15:04,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:15:04,396 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:15:04,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:15:04,859 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-21 10:15:04,860 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:15:04,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985116714] [2021-12-21 10:15:04,860 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985116714] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 10:15:04,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1715378994] [2021-12-21 10:15:04,860 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-12-21 10:15:04,860 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:15:04,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:15:04,861 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 10:15:04,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-21 10:15:04,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:15:04,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 52 conjunts are in the unsatisfiable core [2021-12-21 10:15:04,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:15:04,928 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-12-21 10:15:04,931 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 10:15:04,954 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-21 10:15:04,982 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-21 10:15:05,010 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-21 10:15:05,086 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-21 10:15:05,110 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-21 10:15:05,129 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-21 10:15:05,183 INFO L387 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-21 10:15:05,264 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-21 10:15:05,264 INFO L387 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-21 10:15:05,378 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-21 10:15:05,379 INFO L387 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-21 10:15:05,489 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-21 10:15:05,489 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 10:15:06,111 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_438 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_131| Int) (|v_ULTIMATE.start_main_~i~0#1_129| Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_438))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select v_ArrVal_438 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (.cse3 (select .cse5 |c_ULTIMATE.start_main_~#sum~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 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_131| 4))))) (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 .cse0 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_129| 4))))) (or (not (= .cse0 4)) (not (= .cse1 4)) (= (+ .cse1 .cse2 .cse0 .cse3) (* c_~N~0 4)) (not (= .cse2 4))))))))) is different from false [2021-12-21 10:15:06,888 WARN L838 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (forall ((v_ArrVal_438 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_138| Int) (|v_ULTIMATE.start_main_~i~0#1_131| Int) (|v_ULTIMATE.start_main_~i~0#1_129| Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_438))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select v_ArrVal_438 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_138| 4)))) (.cse3 (select .cse5 |c_ULTIMATE.start_main_~#sum~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 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_131| 4))))) (let ((.cse2 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_129| 4))))) (or (= (* ~N~0 4) (+ .cse0 .cse1 .cse2 .cse3)) (not (= .cse0 4)) (not (= .cse1 4)) (not (= .cse2 4))))))))) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0)))) is different from false [2021-12-21 10:15:07,000 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_438 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_138| Int) (|v_ULTIMATE.start_main_~i~0#1_131| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_129| Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_438))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select v_ArrVal_438 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_138| 4)))) (.cse3 (select .cse5 |c_ULTIMATE.start_main_~#sum~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 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_131| 4))))) (let ((.cse2 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_129| 4))))) (or (= (* ~N~0 4) (+ .cse0 .cse1 .cse2 .cse3)) (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (= .cse0 4)) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0)) (not (= .cse1 4)) (not (= .cse2 4))))))))) is different from false [2021-12-21 10:15:07,257 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_438 (Array Int Int)) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_138| Int) (|v_ULTIMATE.start_main_~i~0#1_131| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_129| Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_438))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select v_ArrVal_438 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_138| 4)))) (.cse3 (select .cse5 |c_ULTIMATE.start_main_~#sum~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 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_131| 4))))) (let ((.cse2 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse1 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_129| 4))))) (or (= (* ~N~0 4) (+ .cse0 .cse1 .cse2 .cse3)) (not (= .cse0 4)) (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (= .cse1 4)) (not (= .cse2 4)) (not (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0))))))))) is different from false [2021-12-21 10:15:07,422 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 14 not checked. [2021-12-21 10:15:07,422 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1715378994] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 10:15:07,422 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 10:15:07,422 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 16] total 43 [2021-12-21 10:15:07,422 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096192112] [2021-12-21 10:15:07,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 10:15:07,423 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2021-12-21 10:15:07,423 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:15:07,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-12-21 10:15:07,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1340, Unknown=4, NotChecked=308, Total=1806 [2021-12-21 10:15:07,424 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 43 states, 43 states have (on average 1.9069767441860466) internal successors, (82), 43 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:08,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:15:08,314 INFO L93 Difference]: Finished difference Result 104 states and 131 transitions. [2021-12-21 10:15:08,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-12-21 10:15:08,315 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.9069767441860466) internal successors, (82), 43 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-12-21 10:15:08,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:15:08,316 INFO L225 Difference]: With dead ends: 104 [2021-12-21 10:15:08,316 INFO L226 Difference]: Without dead ends: 100 [2021-12-21 10:15:08,317 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 56 SyntacticMatches, 13 SemanticMatches, 54 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 774 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=374, Invalid=2290, Unknown=4, NotChecked=412, Total=3080 [2021-12-21 10:15:08,319 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 99 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 1273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 568 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-21 10:15:08,319 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 139 Invalid, 1273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 561 Invalid, 0 Unknown, 568 Unchecked, 0.3s Time] [2021-12-21 10:15:08,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-12-21 10:15:08,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 87. [2021-12-21 10:15:08,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 86 states have (on average 1.2674418604651163) internal successors, (109), 86 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:08,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 109 transitions. [2021-12-21 10:15:08,329 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 109 transitions. Word has length 37 [2021-12-21 10:15:08,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:15:08,330 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 109 transitions. [2021-12-21 10:15:08,330 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 1.9069767441860466) internal successors, (82), 43 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:08,330 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 109 transitions. [2021-12-21 10:15:08,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-21 10:15:08,330 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:15:08,330 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:15:08,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-12-21 10:15:08,539 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-21 10:15:08,540 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:15:08,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:15:08,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1441037607, now seen corresponding path program 2 times [2021-12-21 10:15:08,540 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:15:08,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433268507] [2021-12-21 10:15:08,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:15:08,540 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:15:08,551 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-21 10:15:08,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1144174598] [2021-12-21 10:15:08,552 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-21 10:15:08,552 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:15:08,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:15:08,553 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 10:15:08,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-21 10:15:08,613 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-21 10:15:08,613 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 10:15:08,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 30 conjunts are in the unsatisfiable core [2021-12-21 10:15:08,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:15:08,754 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2021-12-21 10:15:08,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:15:08,817 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-21 10:15:08,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:15:08,855 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-21 10:15:08,894 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 10:15:08,894 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2021-12-21 10:15:08,952 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 10:15:08,952 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 10:15:09,053 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_150| Int) (v_ArrVal_498 (Array Int Int))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_498) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_150| 4))) 4) (not (<= |v_ULTIMATE.start_main_~i~0#1_150| (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (< (+ |v_ULTIMATE.start_main_~i~0#1_150| 1) c_~N~0))) is different from false [2021-12-21 10:15:09,078 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_150| Int) (v_ArrVal_498 (Array Int Int))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_498) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_150| 4))) 4) (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) |v_ULTIMATE.start_main_~i~0#1_150|) (< (+ |v_ULTIMATE.start_main_~i~0#1_150| 1) c_~N~0))) is different from false [2021-12-21 10:15:09,528 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 10:15:09,528 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 33 [2021-12-21 10:15:09,534 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 10:15:09,534 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 42 [2021-12-21 10:15:09,539 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2021-12-21 10:15:09,858 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2021-12-21 10:15:09,859 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:15:09,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433268507] [2021-12-21 10:15:09,859 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-21 10:15:09,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144174598] [2021-12-21 10:15:09,859 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1144174598] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 10:15:09,859 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 10:15:09,859 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2021-12-21 10:15:09,859 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802960486] [2021-12-21 10:15:09,859 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 10:15:09,859 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-12-21 10:15:09,860 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:15:09,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-12-21 10:15:09,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=798, Unknown=10, NotChecked=122, Total=1122 [2021-12-21 10:15:09,860 INFO L87 Difference]: Start difference. First operand 87 states and 109 transitions. Second operand has 34 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 34 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:10,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:15:10,277 INFO L93 Difference]: Finished difference Result 143 states and 181 transitions. [2021-12-21 10:15:10,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-21 10:15:10,278 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 34 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-12-21 10:15:10,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:15:10,278 INFO L225 Difference]: With dead ends: 143 [2021-12-21 10:15:10,278 INFO L226 Difference]: Without dead ends: 136 [2021-12-21 10:15:10,279 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=374, Invalid=1345, Unknown=11, NotChecked=162, Total=1892 [2021-12-21 10:15:10,279 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 115 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 291 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 10:15:10,279 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 64 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 373 Invalid, 0 Unknown, 291 Unchecked, 0.2s Time] [2021-12-21 10:15:10,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-12-21 10:15:10,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 111. [2021-12-21 10:15:10,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 110 states have (on average 1.2636363636363637) internal successors, (139), 110 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:10,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 139 transitions. [2021-12-21 10:15:10,289 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 139 transitions. Word has length 37 [2021-12-21 10:15:10,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:15:10,289 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 139 transitions. [2021-12-21 10:15:10,290 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.9705882352941178) internal successors, (67), 34 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:10,290 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 139 transitions. [2021-12-21 10:15:10,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-21 10:15:10,290 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:15:10,290 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:15:10,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-12-21 10:15:10,503 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-21 10:15:10,503 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:15:10,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:15:10,504 INFO L85 PathProgramCache]: Analyzing trace with hash 2063837675, now seen corresponding path program 3 times [2021-12-21 10:15:10,504 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:15:10,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495658117] [2021-12-21 10:15:10,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:15:10,504 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:15:10,512 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-21 10:15:10,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [305751451] [2021-12-21 10:15:10,512 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-21 10:15:10,512 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:15:10,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:15:10,513 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 10:15:10,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-21 10:15:10,584 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-12-21 10:15:10,584 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 10:15:10,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 26 conjunts are in the unsatisfiable core [2021-12-21 10:15:10,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:15:10,623 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2021-12-21 10:15:10,666 INFO L353 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2021-12-21 10:15:10,666 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 29 [2021-12-21 10:15:10,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:15:10,740 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2021-12-21 10:15:10,771 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 10:15:10,772 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2021-12-21 10:15:10,856 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-21 10:15:10,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 10:15:10,936 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int) (v_ArrVal_553 (Array Int Int))) (let ((.cse0 (+ 2 |ULTIMATE.start_main_~i~0#1|))) (or (< .cse0 c_~N~0) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_553) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 4) (< c_~N~0 .cse0)))) is different from false [2021-12-21 10:15:11,068 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_551 Int) (v_ArrVal_553 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_170| Int)) (or (= 4 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_551)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_553) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_170| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (<= (+ 2 |v_ULTIMATE.start_main_~i~0#1_170|) |c_ULTIMATE.start_main_~i~0#1|) (< |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_170| 1)))) is different from false [2021-12-21 10:15:11,082 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_551 Int) (v_ArrVal_553 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_170| Int)) (or (< |c_ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_170|) (<= (+ |v_ULTIMATE.start_main_~i~0#1_170| 1) |c_ULTIMATE.start_main_~i~0#1|) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |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) v_ArrVal_551)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_553) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_170| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 4))) is different from false [2021-12-21 10:15:11,139 INFO L353 Elim1Store]: treesize reduction 39, result has 41.8 percent of original size [2021-12-21 10:15:11,139 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 46 [2021-12-21 10:15:11,146 INFO L353 Elim1Store]: treesize reduction 12, result has 25.0 percent of original size [2021-12-21 10:15:11,146 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 32 [2021-12-21 10:15:11,177 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 10 not checked. [2021-12-21 10:15:11,177 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:15:11,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495658117] [2021-12-21 10:15:11,178 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-21 10:15:11,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305751451] [2021-12-21 10:15:11,178 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [305751451] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 10:15:11,178 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 10:15:11,178 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 24 [2021-12-21 10:15:11,178 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23587792] [2021-12-21 10:15:11,178 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 10:15:11,178 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-12-21 10:15:11,178 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:15:11,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-12-21 10:15:11,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=338, Unknown=11, NotChecked=120, Total=552 [2021-12-21 10:15:11,179 INFO L87 Difference]: Start difference. First operand 111 states and 139 transitions. Second operand has 24 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:11,721 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_551 Int) (v_ArrVal_553 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_170| Int)) (or (< |c_ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_170|) (<= (+ |v_ULTIMATE.start_main_~i~0#1_170| 1) |c_ULTIMATE.start_main_~i~0#1|) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |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) v_ArrVal_551)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_553) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_170| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 4))) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (= (+ (- 3) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) 1)) is different from false [2021-12-21 10:15:13,730 WARN L838 $PredicateComparison]: unable to prove that (and (= (+ (- 3) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (- 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) 1) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (forall ((v_ArrVal_551 Int) (v_ArrVal_553 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_170| Int)) (or (= 4 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_551)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_553) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_170| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (<= (+ 2 |v_ULTIMATE.start_main_~i~0#1_170|) |c_ULTIMATE.start_main_~i~0#1|) (< |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_170| 1))))) is different from false [2021-12-21 10:15:14,314 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_ArrVal_551 Int) (v_ArrVal_553 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_170| Int)) (or (< |c_ULTIMATE.start_main_~i~0#1| |v_ULTIMATE.start_main_~i~0#1_170|) (<= (+ |v_ULTIMATE.start_main_~i~0#1_170| 1) |c_ULTIMATE.start_main_~i~0#1|) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |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) v_ArrVal_551)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_553) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_170| 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) 4))) (= (+ (- 3) (select .cse0 (+ .cse1 (- 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) 1) (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (= (+ (- 3) (select .cse0 (+ .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|))) 1))) is different from false [2021-12-21 10:15:16,325 WARN L838 $PredicateComparison]: unable to prove that (and (= (+ (- 3) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) (- 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) 1) (< (+ |c_ULTIMATE.start_main_~a~0#1.base| 1) |c_ULTIMATE.start_main_~#sum~0#1.base|) (exists ((|v_ULTIMATE.start_main_~i~0#1_162| Int)) (and (<= |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_162| 1)) (< |v_ULTIMATE.start_main_~i~0#1_162| c_~N~0) (= (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_162| 4) (- 4) |c_ULTIMATE.start_main_~a~0#1.offset|)) (- 3)) 1))) (forall ((v_ArrVal_551 Int) (v_ArrVal_553 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_170| Int)) (or (= 4 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_551)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_553) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_170| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (<= (+ 2 |v_ULTIMATE.start_main_~i~0#1_170|) |c_ULTIMATE.start_main_~i~0#1|) (< |c_ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_170| 1))))) is different from false [2021-12-21 10:15:16,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:15:16,438 INFO L93 Difference]: Finished difference Result 163 states and 204 transitions. [2021-12-21 10:15:16,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-21 10:15:16,438 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 0 states have call successors, (0), 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 37 [2021-12-21 10:15:16,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:15:16,439 INFO L225 Difference]: With dead ends: 163 [2021-12-21 10:15:16,439 INFO L226 Difference]: Without dead ends: 159 [2021-12-21 10:15:16,439 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 7 IntricatePredicates, 2 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=140, Invalid=523, Unknown=15, NotChecked=378, Total=1056 [2021-12-21 10:15:16,440 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 168 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 10:15:16,440 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 56 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 99 Invalid, 0 Unknown, 168 Unchecked, 0.1s Time] [2021-12-21 10:15:16,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-12-21 10:15:16,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 133. [2021-12-21 10:15:16,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 1.2954545454545454) internal successors, (171), 132 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:16,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 171 transitions. [2021-12-21 10:15:16,452 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 171 transitions. Word has length 37 [2021-12-21 10:15:16,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:15:16,452 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 171 transitions. [2021-12-21 10:15:16,453 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 24 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:16,453 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 171 transitions. [2021-12-21 10:15:16,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-21 10:15:16,453 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:15:16,453 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:15:16,470 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-12-21 10:15:16,659 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-21 10:15:16,659 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:15:16,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:15:16,660 INFO L85 PathProgramCache]: Analyzing trace with hash -147310295, now seen corresponding path program 2 times [2021-12-21 10:15:16,660 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:15:16,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118327810] [2021-12-21 10:15:16,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:15:16,660 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:15:16,673 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-21 10:15:16,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2083929903] [2021-12-21 10:15:16,673 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-21 10:15:16,674 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:15:16,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:15:16,674 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-21 10:15:16,676 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-21 10:15:16,741 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-21 10:15:16,741 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 10:15:16,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 27 conjunts are in the unsatisfiable core [2021-12-21 10:15:16,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:15:16,791 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-21 10:15:16,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:15:16,833 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2021-12-21 10:15:16,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:15:16,862 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2021-12-21 10:15:16,881 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-21 10:15:16,903 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-21 10:15:16,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 10:15:17,008 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2021-12-21 10:15:17,010 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2021-12-21 10:15:17,042 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-21 10:15:17,043 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:15:17,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118327810] [2021-12-21 10:15:17,043 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-21 10:15:17,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083929903] [2021-12-21 10:15:17,043 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2083929903] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 10:15:17,043 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 10:15:17,043 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-12-21 10:15:17,043 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091777667] [2021-12-21 10:15:17,043 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 10:15:17,043 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-21 10:15:17,043 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:15:17,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-21 10:15:17,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2021-12-21 10:15:17,044 INFO L87 Difference]: Start difference. First operand 133 states and 171 transitions. Second operand has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:17,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:15:17,236 INFO L93 Difference]: Finished difference Result 214 states and 283 transitions. [2021-12-21 10:15:17,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-21 10:15:17,236 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 0 states have call successors, (0), 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 37 [2021-12-21 10:15:17,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:15:17,237 INFO L225 Difference]: With dead ends: 214 [2021-12-21 10:15:17,237 INFO L226 Difference]: Without dead ends: 147 [2021-12-21 10:15:17,237 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2021-12-21 10:15:17,238 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 21 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 10:15:17,238 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 69 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 10:15:17,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-12-21 10:15:17,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 133. [2021-12-21 10:15:17,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 1.2803030303030303) internal successors, (169), 132 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:17,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 169 transitions. [2021-12-21 10:15:17,251 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 169 transitions. Word has length 37 [2021-12-21 10:15:17,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:15:17,251 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 169 transitions. [2021-12-21 10:15:17,251 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:17,251 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 169 transitions. [2021-12-21 10:15:17,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-21 10:15:17,251 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:15:17,251 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:15:17,268 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2021-12-21 10:15:17,452 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-21 10:15:17,452 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:15:17,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:15:17,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1016239403, now seen corresponding path program 8 times [2021-12-21 10:15:17,453 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:15:17,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579114440] [2021-12-21 10:15:17,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:15:17,453 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:15:17,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:15:17,537 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-21 10:15:17,537 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:15:17,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579114440] [2021-12-21 10:15:17,537 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579114440] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 10:15:17,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896498353] [2021-12-21 10:15:17,537 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-21 10:15:17,537 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:15:17,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:15:17,538 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-21 10:15:17,539 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-21 10:15:17,599 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-21 10:15:17,599 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 10:15:17,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-21 10:15:17,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:15:17,698 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-21 10:15:17,698 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 10:15:17,763 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-21 10:15:17,763 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [896498353] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 10:15:17,763 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 10:15:17,763 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2021-12-21 10:15:17,763 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788154363] [2021-12-21 10:15:17,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 10:15:17,763 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-21 10:15:17,763 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:15:17,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-21 10:15:17,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2021-12-21 10:15:17,764 INFO L87 Difference]: Start difference. First operand 133 states and 169 transitions. Second operand has 17 states, 17 states have (on average 3.0) internal successors, (51), 17 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:18,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:15:18,034 INFO L93 Difference]: Finished difference Result 178 states and 229 transitions. [2021-12-21 10:15:18,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-21 10:15:18,034 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.0) internal successors, (51), 17 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-12-21 10:15:18,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:15:18,035 INFO L225 Difference]: With dead ends: 178 [2021-12-21 10:15:18,035 INFO L226 Difference]: Without dead ends: 157 [2021-12-21 10:15:18,035 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 70 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-21 10:15:18,036 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 97 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 10:15:18,036 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 34 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-21 10:15:18,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-12-21 10:15:18,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 105. [2021-12-21 10:15:18,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 104 states have (on average 1.2596153846153846) internal successors, (131), 104 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:18,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 131 transitions. [2021-12-21 10:15:18,047 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 131 transitions. Word has length 39 [2021-12-21 10:15:18,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:15:18,047 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 131 transitions. [2021-12-21 10:15:18,047 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.0) internal successors, (51), 17 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:18,048 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 131 transitions. [2021-12-21 10:15:18,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-21 10:15:18,048 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:15:18,048 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:15:18,064 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-21 10:15:18,263 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-21 10:15:18,263 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:15:18,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:15:18,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1682760144, now seen corresponding path program 9 times [2021-12-21 10:15:18,264 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:15:18,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920793423] [2021-12-21 10:15:18,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:15:18,264 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:15:18,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:15:18,331 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-21 10:15:18,331 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:15:18,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920793423] [2021-12-21 10:15:18,332 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920793423] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 10:15:18,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879056317] [2021-12-21 10:15:18,332 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-21 10:15:18,332 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:15:18,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:15:18,333 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-21 10:15:18,333 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-21 10:15:18,418 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-12-21 10:15:18,419 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 10:15:18,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-21 10:15:18,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:15:18,528 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-21 10:15:18,528 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 10:15:18,604 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-21 10:15:18,605 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1879056317] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 10:15:18,605 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 10:15:18,605 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2021-12-21 10:15:18,605 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088512830] [2021-12-21 10:15:18,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 10:15:18,605 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-21 10:15:18,605 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:15:18,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-21 10:15:18,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2021-12-21 10:15:18,606 INFO L87 Difference]: Start difference. First operand 105 states and 131 transitions. Second operand has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:18,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:15:18,737 INFO L93 Difference]: Finished difference Result 131 states and 162 transitions. [2021-12-21 10:15:18,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-21 10:15:18,738 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-12-21 10:15:18,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:15:18,738 INFO L225 Difference]: With dead ends: 131 [2021-12-21 10:15:18,738 INFO L226 Difference]: Without dead ends: 58 [2021-12-21 10:15:18,738 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2021-12-21 10:15:18,739 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 90 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 10:15:18,739 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 36 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 10:15:18,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2021-12-21 10:15:18,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 52. [2021-12-21 10:15:18,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.196078431372549) internal successors, (61), 51 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:18,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2021-12-21 10:15:18,744 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 40 [2021-12-21 10:15:18,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:15:18,744 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2021-12-21 10:15:18,744 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.0588235294117645) internal successors, (52), 17 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:18,744 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2021-12-21 10:15:18,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-21 10:15:18,744 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:15:18,744 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:15:18,750 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-21 10:15:18,945 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-21 10:15:18,945 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:15:18,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:15:18,945 INFO L85 PathProgramCache]: Analyzing trace with hash -2111860654, now seen corresponding path program 10 times [2021-12-21 10:15:18,945 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:15:18,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792870214] [2021-12-21 10:15:18,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:15:18,946 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:15:18,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 10:15:19,419 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-21 10:15:19,419 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:15:19,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792870214] [2021-12-21 10:15:19,419 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792870214] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 10:15:19,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510902444] [2021-12-21 10:15:19,419 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-21 10:15:19,419 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:15:19,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:15:19,420 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-21 10:15:19,420 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-21 10:15:19,484 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-21 10:15:19,484 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 10:15:19,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 62 conjunts are in the unsatisfiable core [2021-12-21 10:15:19,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:15:19,497 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 10:15:19,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:15:19,528 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-21 10:15:19,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:15:19,573 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-21 10:15:19,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:15:19,611 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-21 10:15:19,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:15:19,654 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-21 10:15:19,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:15:19,776 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-21 10:15:19,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:15:19,801 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-21 10:15:19,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:15:19,825 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-21 10:15:19,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:15:19,854 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-21 10:15:19,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:15:19,933 INFO L387 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-21 10:15:20,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:15:20,061 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-21 10:15:20,061 INFO L387 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 67 treesize of output 45 [2021-12-21 10:15:20,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:15:20,217 INFO L353 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2021-12-21 10:15:20,217 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 94 treesize of output 63 [2021-12-21 10:15:20,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:15:20,394 INFO L353 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2021-12-21 10:15:20,394 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 58 [2021-12-21 10:15:20,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:15:20,612 INFO L353 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2021-12-21 10:15:20,612 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 99 treesize of output 43 [2021-12-21 10:15:20,651 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-21 10:15:20,651 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 10:15:31,080 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int) (|v_ULTIMATE.start_main_~i~0#1_245| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_789 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (|v_ULTIMATE.start_main_~i~0#1_243| Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_789))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse1 (select v_ArrVal_789 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))) (let ((.cse0 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_245| 4))))) (let ((.cse3 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse1 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_243| 4))))) (let ((.cse2 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse1 .cse0 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_241| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 4 .cse0)) (not (= .cse1 4)) (not (= .cse2 4)) (not (= 4 .cse3)) (= (* c_~N~0 4) (+ .cse4 .cse1 .cse2 .cse0 .cse3)))))))))) is different from false [2021-12-21 10:15:34,635 WARN L838 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_245| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_789 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_253| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (|v_ULTIMATE.start_main_~i~0#1_243| Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_789))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (select v_ArrVal_789 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_253| 4))))) (let ((.cse1 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_245| 4))))) (let ((.cse3 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse4 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_243| 4))))) (let ((.cse2 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse1 .cse4 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_241| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 4 .cse0)) (not (= .cse1 4)) (not (= 4 .cse2)) (= (* ~N~0 4) (+ .cse3 .cse1 .cse4 .cse0 .cse2)) (not (= .cse3 4)))))))))) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0) (not (< |c_ULTIMATE.start_main_~i~0#1| ~N~0)))) is different from false [2021-12-21 10:15:35,094 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_245| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_789 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_253| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_243| Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_789))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (select v_ArrVal_789 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_253| 4))))) (let ((.cse1 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_245| 4))))) (let ((.cse3 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse4 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_243| 4))))) (let ((.cse2 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse1 .cse4 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_241| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 4 .cse0)) (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0)) (not (= .cse1 4)) (not (= 4 .cse2)) (= (* ~N~0 4) (+ .cse3 .cse1 .cse4 .cse0 .cse2)) (not (= .cse3 4)))))))))) is different from false [2021-12-21 10:15:35,976 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_245| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_789 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_253| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_243| Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_789))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (select v_ArrVal_789 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_253| 4))))) (let ((.cse1 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_245| 4))))) (let ((.cse3 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse4 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_243| 4))))) (let ((.cse2 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse1 .cse4 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_241| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 4 .cse0)) (not (= .cse1 4)) (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (= 4 .cse2)) (= (* ~N~0 4) (+ .cse3 .cse1 .cse4 .cse0 .cse2)) (not (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0)) (not (= .cse3 4)))))))))) is different from false [2021-12-21 10:15:36,924 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_245| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_789 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_253| Int) (|v_ULTIMATE.start_main_~i~0#1_241| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_243| Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_789))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (select v_ArrVal_789 (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_253| 4))))) (let ((.cse1 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_245| 4))))) (let ((.cse3 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse4 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_243| 4))))) (let ((.cse2 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse1 .cse4 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_241| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 4 .cse0)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 4) ~N~0) (not (= .cse1 4)) (not (= 4 .cse2)) (= (* ~N~0 4) (+ .cse3 .cse1 .cse4 .cse0 .cse2)) (not (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0)) (not (= .cse3 4)))))))))) is different from false [2021-12-21 10:15:37,452 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 15 trivial. 23 not checked. [2021-12-21 10:15:37,452 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1510902444] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 10:15:37,452 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 10:15:37,453 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18, 19] total 53 [2021-12-21 10:15:37,453 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904373082] [2021-12-21 10:15:37,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 10:15:37,453 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2021-12-21 10:15:37,453 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:15:37,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-12-21 10:15:37,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=2089, Unknown=10, NotChecked=480, Total=2756 [2021-12-21 10:15:37,454 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand has 53 states, 53 states have (on average 1.830188679245283) internal successors, (97), 53 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:40,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:15:40,048 INFO L93 Difference]: Finished difference Result 122 states and 152 transitions. [2021-12-21 10:15:40,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-12-21 10:15:40,049 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 1.830188679245283) internal successors, (97), 53 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-12-21 10:15:40,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:15:40,049 INFO L225 Difference]: With dead ends: 122 [2021-12-21 10:15:40,049 INFO L226 Difference]: Without dead ends: 118 [2021-12-21 10:15:40,050 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 66 SyntacticMatches, 8 SemanticMatches, 72 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1188 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=502, Invalid=4199, Unknown=11, NotChecked=690, Total=5402 [2021-12-21 10:15:40,051 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 51 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 1586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 850 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-21 10:15:40,051 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 186 Invalid, 1586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 618 Invalid, 0 Unknown, 850 Unchecked, 0.4s Time] [2021-12-21 10:15:40,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-12-21 10:15:40,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 112. [2021-12-21 10:15:40,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 1.2612612612612613) internal successors, (140), 111 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:40,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 140 transitions. [2021-12-21 10:15:40,069 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 140 transitions. Word has length 45 [2021-12-21 10:15:40,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:15:40,069 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 140 transitions. [2021-12-21 10:15:40,069 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 1.830188679245283) internal successors, (97), 53 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:40,069 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 140 transitions. [2021-12-21 10:15:40,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-21 10:15:40,069 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:15:40,070 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:15:40,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-12-21 10:15:40,270 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:15:40,270 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:15:40,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:15:40,271 INFO L85 PathProgramCache]: Analyzing trace with hash -2054602352, now seen corresponding path program 4 times [2021-12-21 10:15:40,271 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:15:40,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661919188] [2021-12-21 10:15:40,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:15:40,271 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:15:40,280 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-21 10:15:40,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2007994700] [2021-12-21 10:15:40,280 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-21 10:15:40,281 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:15:40,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:15:40,282 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 10:15:40,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-12-21 10:15:40,355 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-21 10:15:40,355 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 10:15:40,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 32 conjunts are in the unsatisfiable core [2021-12-21 10:15:40,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:15:40,479 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2021-12-21 10:15:40,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:15:40,532 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-21 10:15:40,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:15:40,574 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-21 10:15:40,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:15:40,614 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-21 10:15:40,646 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2021-12-21 10:15:40,663 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 7 proven. 37 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-21 10:15:40,663 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 10:15:40,704 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_864 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_864) |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)) 4)) is different from false [2021-12-21 10:15:40,710 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_864 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_864) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4)) is different from false [2021-12-21 10:15:40,720 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_864 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_864) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4)) is different from false [2021-12-21 10:15:40,729 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_864 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_864) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4)) is different from false [2021-12-21 10:15:40,765 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 10:15:40,765 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 31 [2021-12-21 10:15:40,770 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 10:15:40,770 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 40 [2021-12-21 10:15:40,773 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 10:15:40,901 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 22 not checked. [2021-12-21 10:15:40,901 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:15:40,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661919188] [2021-12-21 10:15:40,902 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-21 10:15:40,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007994700] [2021-12-21 10:15:40,902 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2007994700] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 10:15:40,902 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 10:15:40,902 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2021-12-21 10:15:40,902 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702331890] [2021-12-21 10:15:40,902 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 10:15:40,902 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-12-21 10:15:40,902 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:15:40,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-12-21 10:15:40,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=421, Unknown=4, NotChecked=180, Total=702 [2021-12-21 10:15:40,903 INFO L87 Difference]: Start difference. First operand 112 states and 140 transitions. Second operand has 27 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 27 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:41,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:15:41,332 INFO L93 Difference]: Finished difference Result 238 states and 307 transitions. [2021-12-21 10:15:41,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-21 10:15:41,332 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 27 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-12-21 10:15:41,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:15:41,333 INFO L225 Difference]: With dead ends: 238 [2021-12-21 10:15:41,333 INFO L226 Difference]: Without dead ends: 231 [2021-12-21 10:15:41,333 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 63 SyntacticMatches, 8 SemanticMatches, 28 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=533, Unknown=4, NotChecked=204, Total=870 [2021-12-21 10:15:41,334 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 99 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 313 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-21 10:15:41,334 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 102 Invalid, 884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 500 Invalid, 0 Unknown, 313 Unchecked, 0.3s Time] [2021-12-21 10:15:41,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2021-12-21 10:15:41,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 142. [2021-12-21 10:15:41,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 1.2624113475177305) internal successors, (178), 141 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:41,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 178 transitions. [2021-12-21 10:15:41,353 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 178 transitions. Word has length 45 [2021-12-21 10:15:41,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:15:41,353 INFO L470 AbstractCegarLoop]: Abstraction has 142 states and 178 transitions. [2021-12-21 10:15:41,353 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 27 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:41,353 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 178 transitions. [2021-12-21 10:15:41,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-21 10:15:41,353 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:15:41,353 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:15:41,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-12-21 10:15:41,560 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:15:41,561 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:15:41,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:15:41,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1431802284, now seen corresponding path program 5 times [2021-12-21 10:15:41,561 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:15:41,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308718643] [2021-12-21 10:15:41,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:15:41,561 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:15:41,577 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-21 10:15:41,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1213303934] [2021-12-21 10:15:41,577 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-21 10:15:41,577 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:15:41,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:15:41,579 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 10:15:41,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-12-21 10:15:41,704 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2021-12-21 10:15:41,705 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 10:15:41,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 32 conjunts are in the unsatisfiable core [2021-12-21 10:15:41,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:15:41,719 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-12-21 10:15:41,786 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2021-12-21 10:15:41,829 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-12-21 10:15:41,829 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2021-12-21 10:15:41,872 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-21 10:15:41,903 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-21 10:15:41,927 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-21 10:15:41,942 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 13 proven. 29 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-21 10:15:41,942 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 10:15:41,978 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_933) |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)) 4)) is different from false [2021-12-21 10:15:41,984 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_933) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4)) is different from false [2021-12-21 10:15:41,993 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_933 (Array Int Int))) (= 4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_933) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2021-12-21 10:15:42,006 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_933 (Array Int Int)) (v_ArrVal_930 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_930)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_933) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4)) is different from false [2021-12-21 10:15:42,020 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_290| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_290|)) (forall ((v_ArrVal_933 (Array Int Int)) (v_ArrVal_930 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_290| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_930)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_933) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4)))) is different from false [2021-12-21 10:15:43,283 INFO L353 Elim1Store]: treesize reduction 37, result has 42.2 percent of original size [2021-12-21 10:15:43,284 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 43 [2021-12-21 10:15:43,289 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 10:15:43,289 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2021-12-21 10:15:43,291 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 10:15:43,346 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 22 not checked. [2021-12-21 10:15:43,347 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:15:43,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308718643] [2021-12-21 10:15:43,347 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-21 10:15:43,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1213303934] [2021-12-21 10:15:43,347 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1213303934] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 10:15:43,347 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 10:15:43,347 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 23 [2021-12-21 10:15:43,347 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909093045] [2021-12-21 10:15:43,347 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 10:15:43,347 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-21 10:15:43,347 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:15:43,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-21 10:15:43,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=253, Unknown=5, NotChecked=180, Total=506 [2021-12-21 10:15:43,348 INFO L87 Difference]: Start difference. First operand 142 states and 178 transitions. Second operand has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:45,432 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_290| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_290|)) (forall ((v_ArrVal_933 (Array Int Int)) (v_ArrVal_930 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_290| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_930)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_933) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4)))) (= 2 |c_ULTIMATE.start_main_~i~0#1|) (= (select (select |c_#memory_int| |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)) is different from false [2021-12-21 10:15:47,456 WARN L838 $PredicateComparison]: unable to prove that (and (<= 3 |c_ULTIMATE.start_main_~i~0#1|) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4) (forall ((|v_ULTIMATE.start_main_~i~0#1_290| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_290|)) (forall ((v_ArrVal_933 (Array Int Int)) (v_ArrVal_930 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_290| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_930)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_933) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 4)))) (forall ((v_ArrVal_933 (Array Int Int))) (= 4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_933) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))))) is different from false [2021-12-21 10:15:47,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:15:47,702 INFO L93 Difference]: Finished difference Result 264 states and 344 transitions. [2021-12-21 10:15:47,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-21 10:15:47,702 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-12-21 10:15:47,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:15:47,703 INFO L225 Difference]: With dead ends: 264 [2021-12-21 10:15:47,703 INFO L226 Difference]: Without dead ends: 238 [2021-12-21 10:15:47,704 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 64 SyntacticMatches, 9 SemanticMatches, 26 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=93, Invalid=348, Unknown=7, NotChecked=308, Total=756 [2021-12-21 10:15:47,704 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 36 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 291 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 10:15:47,704 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 81 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 380 Invalid, 0 Unknown, 291 Unchecked, 0.2s Time] [2021-12-21 10:15:47,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2021-12-21 10:15:47,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 206. [2021-12-21 10:15:47,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 205 states have (on average 1.2829268292682927) internal successors, (263), 205 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:47,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 263 transitions. [2021-12-21 10:15:47,732 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 263 transitions. Word has length 45 [2021-12-21 10:15:47,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:15:47,732 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 263 transitions. [2021-12-21 10:15:47,732 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 23 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:47,732 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 263 transitions. [2021-12-21 10:15:47,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-21 10:15:47,733 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:15:47,733 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:15:47,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2021-12-21 10:15:47,944 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:15:47,944 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:15:47,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:15:47,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1853695216, now seen corresponding path program 6 times [2021-12-21 10:15:47,945 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:15:47,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678480005] [2021-12-21 10:15:47,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:15:47,945 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:15:47,953 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-21 10:15:47,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [245469142] [2021-12-21 10:15:47,954 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-21 10:15:47,954 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:15:47,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:15:47,955 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 10:15:47,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2021-12-21 10:15:48,094 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2021-12-21 10:15:48,094 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 10:15:48,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 39 conjunts are in the unsatisfiable core [2021-12-21 10:15:48,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:15:48,110 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-12-21 10:15:48,245 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2021-12-21 10:15:48,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 10:15:48,304 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2021-12-21 10:15:48,345 INFO L353 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2021-12-21 10:15:48,345 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 32 [2021-12-21 10:15:48,434 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-21 10:15:48,463 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-21 10:15:48,482 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 17 proven. 34 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-21 10:15:48,482 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 10:15:48,524 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1004 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1004) |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)) 4)) is different from false [2021-12-21 10:15:48,530 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1004 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1004) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 4)) is different from false [2021-12-21 10:15:48,590 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (forall ((v_ArrVal_1004 (Array Int Int)) (v_ArrVal_1003 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1003)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1004) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 4)) (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0))) is different from false [2021-12-21 10:15:48,618 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_312| Int) (v_ArrVal_1000 Int) (v_ArrVal_1004 (Array Int Int)) (v_ArrVal_1003 Int)) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_312| 1) c_~N~0) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1000) (+ (* |v_ULTIMATE.start_main_~i~0#1_312| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1003)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1004) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 4))) is different from false [2021-12-21 10:15:48,661 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_313| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_313|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_312| Int) (v_ArrVal_1000 Int) (v_ArrVal_1004 (Array Int Int)) (v_ArrVal_1003 Int)) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_312| 1) c_~N~0) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_313| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1000) (+ (* |v_ULTIMATE.start_main_~i~0#1_312| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1003)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1004) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 4))))) is different from false [2021-12-21 10:15:48,761 INFO L353 Elim1Store]: treesize reduction 104, result has 35.4 percent of original size [2021-12-21 10:15:48,761 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 61 treesize of output 73 [2021-12-21 10:15:48,780 INFO L353 Elim1Store]: treesize reduction 24, result has 46.7 percent of original size [2021-12-21 10:15:48,780 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 66 [2021-12-21 10:15:48,786 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 10:15:49,001 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 17 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 19 not checked. [2021-12-21 10:15:49,002 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 10:15:49,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678480005] [2021-12-21 10:15:49,002 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-21 10:15:49,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245469142] [2021-12-21 10:15:49,002 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245469142] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 10:15:49,002 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 10:15:49,002 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 35 [2021-12-21 10:15:49,002 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597190416] [2021-12-21 10:15:49,002 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 10:15:49,002 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-12-21 10:15:49,002 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 10:15:49,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-12-21 10:15:49,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=706, Unknown=5, NotChecked=300, Total=1190 [2021-12-21 10:15:49,003 INFO L87 Difference]: Start difference. First operand 206 states and 263 transitions. Second operand has 35 states, 35 states have (on average 1.9428571428571428) internal successors, (68), 35 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:51,089 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_313| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_313|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_312| Int) (v_ArrVal_1000 Int) (v_ArrVal_1004 (Array Int Int)) (v_ArrVal_1003 Int)) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_312| 1) c_~N~0) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_313| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1000) (+ (* |v_ULTIMATE.start_main_~i~0#1_312| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1003)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1004) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 4))))) (< 2 c_~N~0) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (+ (- 3) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) 1) (= (+ (- 1) |c_ULTIMATE.start_main_~i~0#1|) 0)) is different from false [2021-12-21 10:15:53,125 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_313| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_313|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_312| Int) (v_ArrVal_1000 Int) (v_ArrVal_1004 (Array Int Int)) (v_ArrVal_1003 Int)) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_312| 1) c_~N~0) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_313| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1000) (+ (* |v_ULTIMATE.start_main_~i~0#1_312| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1003)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1004) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 4))))) (= (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (- 3)) 1) (< 2 c_~N~0) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (<= 2 |c_ULTIMATE.start_main_~i~0#1|) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (forall ((v_ArrVal_1004 (Array Int Int)) (v_ArrVal_1003 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1003)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1004) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 4)) (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0)))) is different from false [2021-12-21 10:15:55,129 WARN L838 $PredicateComparison]: unable to prove that (and (= (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (- 3)) 1) (< 2 c_~N~0) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_312| Int) (v_ArrVal_1000 Int) (v_ArrVal_1004 (Array Int Int)) (v_ArrVal_1003 Int)) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_312| 1) c_~N~0) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1000) (+ (* |v_ULTIMATE.start_main_~i~0#1_312| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1003)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1004) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 4))) (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (forall ((v_ArrVal_1004 (Array Int Int)) (v_ArrVal_1003 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1003)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1004) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 4)) (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0)))) is different from false [2021-12-21 10:15:57,132 WARN L838 $PredicateComparison]: unable to prove that (and (< 2 c_~N~0) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (or (= (* |c_ULTIMATE.start_main_~i~0#1| 4) 4) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 4)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (forall ((v_ArrVal_1004 (Array Int Int)) (v_ArrVal_1003 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1003)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1004) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 4)) (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0)))) is different from false [2021-12-21 10:15:59,135 WARN L838 $PredicateComparison]: unable to prove that (and (< 2 c_~N~0) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (or (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 4) (<= |c_ULTIMATE.start_main_~i~0#1| 2)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (forall ((v_ArrVal_1004 (Array Int Int)) (v_ArrVal_1003 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_1003)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_1004) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 4)) (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0)))) is different from false [2021-12-21 10:15:59,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 10:15:59,316 INFO L93 Difference]: Finished difference Result 244 states and 308 transitions. [2021-12-21 10:15:59,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-12-21 10:15:59,316 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.9428571428571428) internal successors, (68), 35 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-12-21 10:15:59,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 10:15:59,317 INFO L225 Difference]: With dead ends: 244 [2021-12-21 10:15:59,317 INFO L226 Difference]: Without dead ends: 226 [2021-12-21 10:15:59,318 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 56 SyntacticMatches, 5 SemanticMatches, 42 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=230, Invalid=922, Unknown=10, NotChecked=730, Total=1892 [2021-12-21 10:15:59,318 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 75 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 311 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-21 10:15:59,318 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 92 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 320 Invalid, 0 Unknown, 311 Unchecked, 0.2s Time] [2021-12-21 10:15:59,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2021-12-21 10:15:59,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 207. [2021-12-21 10:15:59,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 206 states have (on average 1.2718446601941749) internal successors, (262), 206 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:59,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 262 transitions. [2021-12-21 10:15:59,347 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 262 transitions. Word has length 45 [2021-12-21 10:15:59,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 10:15:59,347 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 262 transitions. [2021-12-21 10:15:59,347 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.9428571428571428) internal successors, (68), 35 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 10:15:59,347 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 262 transitions. [2021-12-21 10:15:59,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-21 10:15:59,347 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 10:15:59,347 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 10:15:59,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2021-12-21 10:15:59,548 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-12-21 10:15:59,548 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 10:15:59,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 10:15:59,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1422716494, now seen corresponding path program 3 times [2021-12-21 10:15:59,549 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 10:15:59,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204213380] [2021-12-21 10:15:59,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 10:15:59,549 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 10:15:59,557 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-21 10:15:59,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1118392011] [2021-12-21 10:15:59,558 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-21 10:15:59,558 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 10:15:59,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 10:15:59,559 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 10:15:59,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2021-12-21 10:15:59,657 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-12-21 10:15:59,657 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 10:15:59,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 30 conjunts are in the unsatisfiable core [2021-12-21 10:15:59,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 10:15:59,688 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-12-21 10:15:59,806 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2021-12-21 10:15:59,807 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2021-12-21 10:15:59,872 INFO L353 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2021-12-21 10:15:59,872 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 34 [2021-12-21 10:15:59,974 INFO L353 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2021-12-21 10:15:59,974 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 38 [2021-12-21 10:16:00,095 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 10:16:00,095 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 32 [2021-12-21 10:16:00,337 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 27 proven. 31 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-21 10:16:00,337 INFO L328 TraceCheckSpWp]: Computing backward predicates...