./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/s4if.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-fpi/s4if.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 5fe0a71bff946f0cc68d0dab1416e0ef991c6bf06ad7cbb70643ca18073a3c7e --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-15 21:54:00,643 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 21:54:00,645 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 21:54:00,704 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 21:54:00,719 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 21:54:00,720 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 21:54:00,721 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 21:54:00,722 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 21:54:00,723 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 21:54:00,723 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 21:54:00,724 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 21:54:00,725 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 21:54:00,725 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 21:54:00,725 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 21:54:00,726 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 21:54:00,727 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 21:54:00,728 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 21:54:00,728 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 21:54:00,730 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 21:54:00,731 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 21:54:00,735 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 21:54:00,739 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 21:54:00,740 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 21:54:00,740 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 21:54:00,742 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 21:54:00,742 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 21:54:00,743 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 21:54:00,743 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 21:54:00,748 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 21:54:00,749 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 21:54:00,749 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 21:54:00,749 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 21:54:00,750 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 21:54:00,750 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 21:54:00,751 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 21:54:00,751 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 21:54:00,752 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 21:54:00,752 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 21:54:00,752 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 21:54:00,753 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 21:54:00,754 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 21:54:00,755 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-15 21:54:00,768 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 21:54:00,773 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 21:54:00,774 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 21:54:00,774 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 21:54:00,775 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-15 21:54:00,775 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-15 21:54:00,775 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 21:54:00,775 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 21:54:00,775 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 21:54:00,776 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 21:54:00,777 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 21:54:00,777 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 21:54:00,777 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 21:54:00,777 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 21:54:00,777 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-15 21:54:00,777 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-15 21:54:00,777 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-15 21:54:00,778 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 21:54:00,778 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 21:54:00,778 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 21:54:00,778 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-15 21:54:00,778 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 21:54:00,778 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 21:54:00,779 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-15 21:54:00,779 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 21:54:00,779 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 21:54:00,779 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-15 21:54:00,780 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-15 21:54:00,780 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 21:54:00,780 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-15 21:54:00,780 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-15 21:54:00,780 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-15 21:54:00,781 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-15 21:54:00,781 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 21:54:00,781 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 -> 5fe0a71bff946f0cc68d0dab1416e0ef991c6bf06ad7cbb70643ca18073a3c7e [2021-12-15 21:54:00,972 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 21:54:00,990 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 21:54:00,992 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 21:54:00,993 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 21:54:00,996 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 21:54:00,997 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/s4if.c [2021-12-15 21:54:01,046 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10b56a33d/6c4d5c24eafb48ad89d4afea09a244da/FLAG2de03466b [2021-12-15 21:54:01,402 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 21:54:01,403 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s4if.c [2021-12-15 21:54:01,407 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10b56a33d/6c4d5c24eafb48ad89d4afea09a244da/FLAG2de03466b [2021-12-15 21:54:01,417 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10b56a33d/6c4d5c24eafb48ad89d4afea09a244da [2021-12-15 21:54:01,419 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 21:54:01,421 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 21:54:01,424 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 21:54:01,424 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 21:54:01,426 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 21:54:01,427 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:54:01" (1/1) ... [2021-12-15 21:54:01,428 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22bba57e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:01, skipping insertion in model container [2021-12-15 21:54:01,428 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:54:01" (1/1) ... [2021-12-15 21:54:01,432 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 21:54:01,442 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 21:54:01,550 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/s4if.c[587,600] [2021-12-15 21:54:01,563 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 21:54:01,568 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 21:54:01,576 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/s4if.c[587,600] [2021-12-15 21:54:01,581 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 21:54:01,591 INFO L208 MainTranslator]: Completed translation [2021-12-15 21:54:01,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:01 WrapperNode [2021-12-15 21:54:01,591 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 21:54:01,592 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 21:54:01,592 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 21:54:01,592 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 21:54:01,597 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:01" (1/1) ... [2021-12-15 21:54:01,601 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:01" (1/1) ... [2021-12-15 21:54:01,614 INFO L137 Inliner]: procedures = 17, calls = 30, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 79 [2021-12-15 21:54:01,614 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 21:54:01,615 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 21:54:01,615 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 21:54:01,615 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 21:54:01,622 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:01" (1/1) ... [2021-12-15 21:54:01,622 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:01" (1/1) ... [2021-12-15 21:54:01,624 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:01" (1/1) ... [2021-12-15 21:54:01,624 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:01" (1/1) ... [2021-12-15 21:54:01,628 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:01" (1/1) ... [2021-12-15 21:54:01,630 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:01" (1/1) ... [2021-12-15 21:54:01,631 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:01" (1/1) ... [2021-12-15 21:54:01,632 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 21:54:01,633 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 21:54:01,633 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 21:54:01,633 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 21:54:01,634 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:01" (1/1) ... [2021-12-15 21:54:01,650 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 21:54:01,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 21:54:01,714 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-15 21:54:01,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-15 21:54:01,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 21:54:01,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 21:54:01,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-15 21:54:01,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-15 21:54:01,749 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-15 21:54:01,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 21:54:01,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 21:54:01,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-15 21:54:01,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-15 21:54:01,792 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 21:54:01,793 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 21:54:01,883 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 21:54:01,889 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 21:54:01,889 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-15 21:54:01,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:54:01 BoogieIcfgContainer [2021-12-15 21:54:01,891 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 21:54:01,901 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-15 21:54:01,902 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-15 21:54:01,905 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-15 21:54:01,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 09:54:01" (1/3) ... [2021-12-15 21:54:01,906 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cd3de5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:54:01, skipping insertion in model container [2021-12-15 21:54:01,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:54:01" (2/3) ... [2021-12-15 21:54:01,906 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cd3de5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:54:01, skipping insertion in model container [2021-12-15 21:54:01,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:54:01" (3/3) ... [2021-12-15 21:54:01,907 INFO L111 eAbstractionObserver]: Analyzing ICFG s4if.c [2021-12-15 21:54:01,910 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-15 21:54:01,911 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-15 21:54:01,966 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-15 21:54:01,972 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-15 21:54:01,973 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-15 21:54:01,986 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:54:01,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-15 21:54:01,991 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:54:01,992 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:54:01,998 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:54:02,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:54:02,002 INFO L85 PathProgramCache]: Analyzing trace with hash 356661439, now seen corresponding path program 1 times [2021-12-15 21:54:02,008 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:54:02,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227836600] [2021-12-15 21:54:02,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:54:02,009 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:54:02,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:54:02,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:54:02,097 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:54:02,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227836600] [2021-12-15 21:54:02,097 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227836600] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:54:02,098 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:54:02,098 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 21:54:02,099 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401114225] [2021-12-15 21:54:02,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:54:02,102 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-15 21:54:02,102 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:54:02,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-15 21:54:02,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-15 21:54:02,123 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:54:02,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:54:02,132 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2021-12-15 21:54:02,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-15 21:54:02,134 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-15 21:54:02,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:54:02,152 INFO L225 Difference]: With dead ends: 34 [2021-12-15 21:54:02,153 INFO L226 Difference]: Without dead ends: 15 [2021-12-15 21:54:02,156 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-15 21:54:02,158 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 21:54:02,159 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 21:54:02,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2021-12-15 21:54:02,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2021-12-15 21:54:02,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:54:02,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2021-12-15 21:54:02,188 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 11 [2021-12-15 21:54:02,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:54:02,188 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2021-12-15 21:54:02,188 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:54:02,189 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2021-12-15 21:54:02,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-15 21:54:02,189 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:54:02,189 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:54:02,190 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-15 21:54:02,190 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:54:02,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:54:02,193 INFO L85 PathProgramCache]: Analyzing trace with hash -452685187, now seen corresponding path program 1 times [2021-12-15 21:54:02,194 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:54:02,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794557274] [2021-12-15 21:54:02,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:54:02,194 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:54:02,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:54:02,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:54:02,287 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:54:02,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794557274] [2021-12-15 21:54:02,287 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794557274] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 21:54:02,287 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 21:54:02,288 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 21:54:02,288 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193571186] [2021-12-15 21:54:02,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 21:54:02,289 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 21:54:02,290 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:54:02,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 21:54:02,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-15 21:54:02,291 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:54:02,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:54:02,331 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2021-12-15 21:54:02,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 21:54:02,332 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-15 21:54:02,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:54:02,333 INFO L225 Difference]: With dead ends: 28 [2021-12-15 21:54:02,333 INFO L226 Difference]: Without dead ends: 20 [2021-12-15 21:54:02,336 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-15 21:54:02,337 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 21 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 21:54:02,337 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 10 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 21:54:02,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-12-15 21:54:02,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2021-12-15 21:54:02,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:54:02,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2021-12-15 21:54:02,345 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2021-12-15 21:54:02,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:54:02,346 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2021-12-15 21:54:02,348 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:54:02,348 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2021-12-15 21:54:02,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-15 21:54:02,349 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:54:02,349 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:54:02,349 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-15 21:54:02,350 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:54:02,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:54:02,351 INFO L85 PathProgramCache]: Analyzing trace with hash 623611495, now seen corresponding path program 1 times [2021-12-15 21:54:02,354 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:54:02,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311548448] [2021-12-15 21:54:02,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:54:02,355 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:54:02,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:54:02,668 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:54:02,668 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:54:02,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311548448] [2021-12-15 21:54:02,669 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311548448] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 21:54:02,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403720110] [2021-12-15 21:54:02,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:54:02,669 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 21:54:02,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 21:54:02,670 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 21:54:02,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-15 21:54:02,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:54:02,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 28 conjunts are in the unsatisfiable core [2021-12-15 21:54:02,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 21:54:02,824 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-12-15 21:54:02,835 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 21:54:02,870 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-15 21:54:02,959 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2021-12-15 21:54:03,052 INFO L388 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 51 treesize of output 23 [2021-12-15 21:54:03,062 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:54:03,063 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 21:54:03,294 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 21:54:03,295 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2021-12-15 21:54:03,297 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-15 21:54:03,299 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2021-12-15 21:54:03,303 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-12-15 21:54:03,317 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:54:03,317 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [403720110] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 21:54:03,318 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 21:54:03,318 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 21 [2021-12-15 21:54:03,318 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691656605] [2021-12-15 21:54:03,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 21:54:03,318 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-15 21:54:03,319 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:54:03,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-15 21:54:03,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2021-12-15 21:54:03,320 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 21 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 21 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:54:03,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:54:03,540 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2021-12-15 21:54:03,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-15 21:54:03,541 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 21 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-15 21:54:03,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:54:03,543 INFO L225 Difference]: With dead ends: 46 [2021-12-15 21:54:03,543 INFO L226 Difference]: Without dead ends: 41 [2021-12-15 21:54:03,544 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=146, Invalid=504, Unknown=0, NotChecked=0, Total=650 [2021-12-15 21:54:03,544 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 24 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 21:54:03,545 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 44 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 98 Invalid, 0 Unknown, 39 Unchecked, 0.1s Time] [2021-12-15 21:54:03,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2021-12-15 21:54:03,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 26. [2021-12-15 21:54:03,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:54:03,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2021-12-15 21:54:03,549 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 16 [2021-12-15 21:54:03,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:54:03,549 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2021-12-15 21:54:03,550 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 21 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:54:03,550 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2021-12-15 21:54:03,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-15 21:54:03,550 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:54:03,550 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:54:03,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-15 21:54:03,763 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 21:54:03,763 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:54:03,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:54:03,764 INFO L85 PathProgramCache]: Analyzing trace with hash 680869797, now seen corresponding path program 1 times [2021-12-15 21:54:03,764 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:54:03,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331944828] [2021-12-15 21:54:03,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:54:03,764 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:54:03,775 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-15 21:54:03,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1588374571] [2021-12-15 21:54:03,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:54:03,775 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 21:54:03,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 21:54:03,790 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 21:54:03,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-15 21:54:03,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:54:03,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-15 21:54:03,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 21:54:03,851 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 21:54:03,881 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-15 21:54:03,892 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:54:03,892 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 21:54:03,929 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2021-12-15 21:54:03,931 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2021-12-15 21:54:03,945 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:54:03,945 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:54:03,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331944828] [2021-12-15 21:54:03,946 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-15 21:54:03,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1588374571] [2021-12-15 21:54:03,946 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1588374571] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 21:54:03,946 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-15 21:54:03,946 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2021-12-15 21:54:03,946 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18581438] [2021-12-15 21:54:03,947 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-15 21:54:03,947 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-15 21:54:03,947 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:54:03,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-15 21:54:03,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-12-15 21:54:03,948 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:54:04,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:54:04,000 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2021-12-15 21:54:04,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-15 21:54:04,001 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-15 21:54:04,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:54:04,002 INFO L225 Difference]: With dead ends: 38 [2021-12-15 21:54:04,002 INFO L226 Difference]: Without dead ends: 26 [2021-12-15 21:54:04,002 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-12-15 21:54:04,003 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 4 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 21:54:04,003 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 42 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 21:54:04,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-12-15 21:54:04,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2021-12-15 21:54:04,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:54:04,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2021-12-15 21:54:04,006 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 16 [2021-12-15 21:54:04,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:54:04,006 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2021-12-15 21:54:04,007 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:54:04,007 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2021-12-15 21:54:04,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-15 21:54:04,007 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:54:04,007 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:54:04,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-15 21:54:04,223 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2021-12-15 21:54:04,224 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:54:04,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:54:04,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1137819675, now seen corresponding path program 2 times [2021-12-15 21:54:04,224 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:54:04,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095153574] [2021-12-15 21:54:04,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:54:04,225 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:54:04,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:54:04,296 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:54:04,296 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:54:04,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095153574] [2021-12-15 21:54:04,297 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095153574] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 21:54:04,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42749909] [2021-12-15 21:54:04,297 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 21:54:04,297 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 21:54:04,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 21:54:04,298 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 21:54:04,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-15 21:54:04,360 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-15 21:54:04,360 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 21:54:04,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-15 21:54:04,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 21:54:04,415 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:54:04,416 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 21:54:04,449 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:54:04,449 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42749909] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 21:54:04,449 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 21:54:04,450 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2021-12-15 21:54:04,450 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352964638] [2021-12-15 21:54:04,450 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 21:54:04,450 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-15 21:54:04,450 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:54:04,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-15 21:54:04,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-12-15 21:54:04,451 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:54:04,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:54:04,547 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2021-12-15 21:54:04,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-15 21:54:04,547 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-12-15 21:54:04,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:54:04,549 INFO L225 Difference]: With dead ends: 33 [2021-12-15 21:54:04,549 INFO L226 Difference]: Without dead ends: 29 [2021-12-15 21:54:04,549 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2021-12-15 21:54:04,550 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 28 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 21:54:04,551 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 32 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 21:54:04,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-12-15 21:54:04,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 20. [2021-12-15 21:54:04,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:54:04,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2021-12-15 21:54:04,557 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 18 [2021-12-15 21:54:04,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:54:04,557 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2021-12-15 21:54:04,557 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:54:04,557 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2021-12-15 21:54:04,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-15 21:54:04,558 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:54:04,558 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:54:04,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-15 21:54:04,771 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 21:54:04,771 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:54:04,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:54:04,772 INFO L85 PathProgramCache]: Analyzing trace with hash -479454913, now seen corresponding path program 3 times [2021-12-15 21:54:04,772 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:54:04,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756155715] [2021-12-15 21:54:04,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:54:04,772 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:54:04,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:54:04,845 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:54:04,846 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:54:04,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756155715] [2021-12-15 21:54:04,846 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756155715] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 21:54:04,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451851918] [2021-12-15 21:54:04,846 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-15 21:54:04,846 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 21:54:04,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 21:54:04,847 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 21:54:04,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-15 21:54:04,884 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-12-15 21:54:04,884 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 21:54:04,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-15 21:54:04,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 21:54:04,939 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:54:04,940 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 21:54:04,975 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:54:04,975 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [451851918] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 21:54:04,976 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 21:54:04,976 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2021-12-15 21:54:04,976 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569246282] [2021-12-15 21:54:04,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 21:54:04,977 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-15 21:54:04,977 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:54:04,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-15 21:54:04,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-12-15 21:54:04,977 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:54:05,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:54:05,060 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2021-12-15 21:54:05,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-15 21:54:05,061 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-12-15 21:54:05,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:54:05,061 INFO L225 Difference]: With dead ends: 37 [2021-12-15 21:54:05,061 INFO L226 Difference]: Without dead ends: 25 [2021-12-15 21:54:05,062 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2021-12-15 21:54:05,062 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 23 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 21:54:05,062 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 21 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 21:54:05,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-12-15 21:54:05,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2021-12-15 21:54:05,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:54:05,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2021-12-15 21:54:05,065 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 19 [2021-12-15 21:54:05,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:54:05,065 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2021-12-15 21:54:05,065 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:54:05,065 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2021-12-15 21:54:05,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-15 21:54:05,066 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:54:05,066 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:54:05,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-15 21:54:05,282 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 21:54:05,282 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:54:05,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:54:05,283 INFO L85 PathProgramCache]: Analyzing trace with hash 634982145, now seen corresponding path program 4 times [2021-12-15 21:54:05,283 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:54:05,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440929275] [2021-12-15 21:54:05,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:54:05,283 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:54:05,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:54:05,513 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:54:05,513 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:54:05,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440929275] [2021-12-15 21:54:05,513 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440929275] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 21:54:05,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005453698] [2021-12-15 21:54:05,513 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-15 21:54:05,513 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 21:54:05,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 21:54:05,514 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 21:54:05,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-15 21:54:05,555 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-15 21:54:05,555 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 21:54:05,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 36 conjunts are in the unsatisfiable core [2021-12-15 21:54:05,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 21:54:05,569 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 21:54:05,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 21:54:05,591 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-15 21:54:05,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 21:54:05,637 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-15 21:54:05,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 21:54:05,815 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2021-12-15 21:54:05,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 21:54:05,945 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-15 21:54:05,946 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2021-12-15 21:54:06,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 21:54:06,191 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-15 21:54:06,192 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 32 [2021-12-15 21:54:06,229 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:54:06,230 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 21:54:08,788 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_47| Int) (v_ArrVal_153 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_44| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_153))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (select v_ArrVal_153 (+ (* |v_ULTIMATE.start_main_~i~0#1_47| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse1 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_44| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 4 .cse0)) (not (= 4 .cse1)) (let ((.cse2 (* .cse5 (- 1))) (.cse3 (* .cse0 (- 1))) (.cse4 (* .cse1 (- 1)))) (and (<= (div (+ .cse2 .cse3 .cse4) (- 4)) (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (<= (+ |c_ULTIMATE.start_main_~i~0#1| 2) (div (+ .cse2 .cse3 .cse4 (- 1)) (- 4))))))))))) is different from false [2021-12-15 21:54:08,868 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_47| Int) (v_ArrVal_153 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_44| Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_153))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse5 (select .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse0 (select v_ArrVal_153 (+ (* |v_ULTIMATE.start_main_~i~0#1_47| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse4 (select (select (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse7 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse5 .cse0))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_44| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 4 .cse0)) (let ((.cse1 (* .cse5 (- 1))) (.cse2 (* .cse0 (- 1))) (.cse3 (* .cse4 (- 1)))) (and (<= (div (+ .cse1 .cse2 .cse3) (- 4)) (+ |c_ULTIMATE.start_main_~i~0#1| 2)) (<= (+ |c_ULTIMATE.start_main_~i~0#1| 3) (div (+ .cse1 .cse2 .cse3 (- 1)) (- 4))))) (not (= 4 .cse4)))))))) is different from false [2021-12-15 21:54:08,968 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2021-12-15 21:54:08,968 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2005453698] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 21:54:08,968 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 21:54:08,968 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 32 [2021-12-15 21:54:08,969 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671173988] [2021-12-15 21:54:08,969 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 21:54:08,969 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-12-15 21:54:08,969 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:54:08,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-12-15 21:54:08,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=753, Unknown=3, NotChecked=114, Total=992 [2021-12-15 21:54:08,970 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 32 states, 32 states have (on average 1.5625) internal successors, (50), 32 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:54:09,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:54:09,225 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2021-12-15 21:54:09,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-15 21:54:09,226 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.5625) internal successors, (50), 32 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-12-15 21:54:09,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:54:09,226 INFO L225 Difference]: With dead ends: 36 [2021-12-15 21:54:09,226 INFO L226 Difference]: Without dead ends: 32 [2021-12-15 21:54:09,227 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=177, Invalid=950, Unknown=3, NotChecked=130, Total=1260 [2021-12-15 21:54:09,228 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 6 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 105 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 21:54:09,228 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 77 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 147 Invalid, 0 Unknown, 105 Unchecked, 0.1s Time] [2021-12-15 21:54:09,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-12-15 21:54:09,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2021-12-15 21:54:09,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:54:09,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2021-12-15 21:54:09,232 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 21 [2021-12-15 21:54:09,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:54:09,232 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2021-12-15 21:54:09,232 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.5625) internal successors, (50), 32 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:54:09,233 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2021-12-15 21:54:09,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-15 21:54:09,233 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:54:09,233 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:54:09,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-15 21:54:09,434 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 21:54:09,434 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:54:09,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:54:09,434 INFO L85 PathProgramCache]: Analyzing trace with hash 692240447, now seen corresponding path program 1 times [2021-12-15 21:54:09,435 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:54:09,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426206598] [2021-12-15 21:54:09,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:54:09,435 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:54:09,445 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-15 21:54:09,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1292419277] [2021-12-15 21:54:09,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:54:09,445 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 21:54:09,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 21:54:09,446 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 21:54:09,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-15 21:54:09,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:54:09,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-15 21:54:09,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 21:54:09,557 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-15 21:54:09,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 21:54:09,608 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-15 21:54:09,641 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-15 21:54:09,656 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:54:09,657 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 21:54:09,701 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_190 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_190) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 4)) is different from false [2021-12-15 21:54:09,709 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_190 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_190) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 4)) is different from false [2021-12-15 21:54:09,718 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 21:54:09,719 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2021-12-15 21:54:09,723 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 21:54:09,724 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2021-12-15 21:54:09,726 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 21:54:09,770 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2021-12-15 21:54:09,771 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:54:09,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426206598] [2021-12-15 21:54:09,771 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-15 21:54:09,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292419277] [2021-12-15 21:54:09,771 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1292419277] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 21:54:09,771 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-15 21:54:09,771 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2021-12-15 21:54:09,771 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418516722] [2021-12-15 21:54:09,772 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-15 21:54:09,772 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-15 21:54:09,772 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:54:09,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-15 21:54:09,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=126, Unknown=2, NotChecked=46, Total=210 [2021-12-15 21:54:09,773 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:54:09,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:54:09,917 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2021-12-15 21:54:09,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-15 21:54:09,918 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-12-15 21:54:09,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:54:09,918 INFO L225 Difference]: With dead ends: 41 [2021-12-15 21:54:09,918 INFO L226 Difference]: Without dead ends: 34 [2021-12-15 21:54:09,919 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=238, Unknown=2, NotChecked=66, Total=380 [2021-12-15 21:54:09,919 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 16 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 38 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 21:54:09,919 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 56 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 121 Invalid, 0 Unknown, 38 Unchecked, 0.1s Time] [2021-12-15 21:54:09,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-12-15 21:54:09,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2021-12-15 21:54:09,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:54:09,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2021-12-15 21:54:09,922 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 21 [2021-12-15 21:54:09,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:54:09,922 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2021-12-15 21:54:09,922 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:54:09,923 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2021-12-15 21:54:09,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-15 21:54:09,923 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:54:09,923 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:54:09,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-15 21:54:10,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 21:54:10,123 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:54:10,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:54:10,124 INFO L85 PathProgramCache]: Analyzing trace with hash -2132829117, now seen corresponding path program 5 times [2021-12-15 21:54:10,124 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:54:10,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526255618] [2021-12-15 21:54:10,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:54:10,124 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:54:10,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:54:10,189 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:54:10,190 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:54:10,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526255618] [2021-12-15 21:54:10,190 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526255618] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 21:54:10,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256384827] [2021-12-15 21:54:10,190 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-15 21:54:10,190 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 21:54:10,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 21:54:10,191 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 21:54:10,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-15 21:54:10,237 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2021-12-15 21:54:10,238 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 21:54:10,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-15 21:54:10,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 21:54:10,320 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:54:10,320 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 21:54:10,381 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:54:10,381 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256384827] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 21:54:10,381 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 21:54:10,381 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2021-12-15 21:54:10,381 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592066312] [2021-12-15 21:54:10,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 21:54:10,382 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-15 21:54:10,382 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:54:10,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-15 21:54:10,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2021-12-15 21:54:10,383 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:54:10,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:54:10,518 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2021-12-15 21:54:10,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-15 21:54:10,519 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-15 21:54:10,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:54:10,519 INFO L225 Difference]: With dead ends: 41 [2021-12-15 21:54:10,519 INFO L226 Difference]: Without dead ends: 37 [2021-12-15 21:54:10,520 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2021-12-15 21:54:10,520 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 35 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 21:54:10,521 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 28 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 21:54:10,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-12-15 21:54:10,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 25. [2021-12-15 21:54:10,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:54:10,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2021-12-15 21:54:10,524 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 23 [2021-12-15 21:54:10,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:54:10,524 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2021-12-15 21:54:10,524 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:54:10,524 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2021-12-15 21:54:10,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-15 21:54:10,524 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:54:10,524 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:54:10,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-15 21:54:10,735 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 21:54:10,735 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:54:10,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:54:10,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1038837147, now seen corresponding path program 6 times [2021-12-15 21:54:10,736 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:54:10,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145750841] [2021-12-15 21:54:10,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:54:10,736 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:54:10,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:54:10,781 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:54:10,782 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:54:10,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145750841] [2021-12-15 21:54:10,782 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145750841] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 21:54:10,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660006075] [2021-12-15 21:54:10,782 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-15 21:54:10,782 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 21:54:10,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 21:54:10,785 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 21:54:10,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-15 21:54:10,835 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2021-12-15 21:54:10,835 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 21:54:10,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-15 21:54:10,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 21:54:10,915 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:54:10,916 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 21:54:10,964 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:54:10,965 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [660006075] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 21:54:10,965 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 21:54:10,965 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2021-12-15 21:54:10,965 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739319093] [2021-12-15 21:54:10,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 21:54:10,966 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-15 21:54:10,966 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:54:10,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-15 21:54:10,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2021-12-15 21:54:10,966 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:54:11,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:54:11,054 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2021-12-15 21:54:11,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-15 21:54:11,054 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-12-15 21:54:11,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:54:11,055 INFO L225 Difference]: With dead ends: 45 [2021-12-15 21:54:11,055 INFO L226 Difference]: Without dead ends: 30 [2021-12-15 21:54:11,055 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2021-12-15 21:54:11,056 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 38 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 21:54:11,056 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 21 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 21:54:11,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-12-15 21:54:11,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2021-12-15 21:54:11,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:54:11,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2021-12-15 21:54:11,059 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 24 [2021-12-15 21:54:11,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:54:11,059 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2021-12-15 21:54:11,059 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:54:11,059 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2021-12-15 21:54:11,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-15 21:54:11,060 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:54:11,060 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:54:11,077 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-12-15 21:54:11,277 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-12-15 21:54:11,277 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:54:11,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:54:11,277 INFO L85 PathProgramCache]: Analyzing trace with hash -2121994781, now seen corresponding path program 7 times [2021-12-15 21:54:11,277 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:54:11,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690809121] [2021-12-15 21:54:11,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:54:11,277 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:54:11,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:54:11,824 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:54:11,824 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:54:11,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690809121] [2021-12-15 21:54:11,824 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690809121] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 21:54:11,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690983786] [2021-12-15 21:54:11,824 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-12-15 21:54:11,824 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 21:54:11,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 21:54:11,825 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 21:54:11,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-15 21:54:11,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:54:11,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 49 conjunts are in the unsatisfiable core [2021-12-15 21:54:11,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 21:54:11,901 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 21:54:11,904 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-12-15 21:54:11,915 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-15 21:54:11,951 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-15 21:54:11,982 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-15 21:54:12,088 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2021-12-15 21:54:12,179 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-15 21:54:12,179 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2021-12-15 21:54:12,277 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-15 21:54:12,277 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2021-12-15 21:54:12,415 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:54:12,416 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 21:54:16,359 WARN L838 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_91| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_88| Int) (|v_ULTIMATE.start_main_~i~0#1_86| Int) (v_ArrVal_302 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_302))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse0 (select v_ArrVal_302 (+ (* |v_ULTIMATE.start_main_~i~0#1_91| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse3 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_88| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse1 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_86| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 4 .cse0)) (not (= 4 .cse1)) (= (+ .cse1 .cse0 .cse2 .cse3) (* 4 ~N~0)) (not (= 4 .cse2))))))))) (<= ~N~0 |c_ULTIMATE.start_main_~i~0#1|) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0))) is different from false [2021-12-15 21:54:16,461 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_91| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_88| Int) (|v_ULTIMATE.start_main_~i~0#1_86| Int) (v_ArrVal_302 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_302))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse0 (select v_ArrVal_302 (+ (* |v_ULTIMATE.start_main_~i~0#1_91| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse3 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_88| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse1 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_86| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 4 .cse0)) (not (= 4 .cse1)) (<= ~N~0 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 2) ~N~0) (= (+ .cse1 .cse0 .cse2 .cse3) (* 4 ~N~0)) (not (= 4 .cse2))))))))) is different from false [2021-12-15 21:54:16,565 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_91| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_88| Int) (|v_ULTIMATE.start_main_~i~0#1_86| Int) (v_ArrVal_302 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_302))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse0 (select v_ArrVal_302 (+ (* |v_ULTIMATE.start_main_~i~0#1_91| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse3 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_88| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse1 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_86| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 4 .cse0)) (not (= 4 .cse1)) (= (+ .cse0 .cse1 .cse2 .cse3) (* 4 ~N~0)) (<= ~N~0 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 2) ~N~0) (not (= 4 .cse2))))))))) is different from false [2021-12-15 21:54:16,687 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_91| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_88| Int) (|v_ULTIMATE.start_main_~i~0#1_86| Int) (v_ArrVal_302 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_302))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse0 (select v_ArrVal_302 (+ (* |v_ULTIMATE.start_main_~i~0#1_91| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse3 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse2 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_88| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse1 (select (select (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_86| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 4 .cse0)) (not (= 4 .cse1)) (<= ~N~0 (+ |c_ULTIMATE.start_main_~i~0#1| 2)) (= (+ .cse0 .cse1 .cse2 .cse3) (* 4 ~N~0)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 3) ~N~0) (not (= 4 .cse2))))))))) is different from false [2021-12-15 21:54:16,809 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2021-12-15 21:54:16,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [690983786] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 21:54:16,810 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 21:54:16,810 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 16] total 42 [2021-12-15 21:54:16,810 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802183955] [2021-12-15 21:54:16,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 21:54:16,810 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2021-12-15 21:54:16,810 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:54:16,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-12-15 21:54:16,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1267, Unknown=5, NotChecked=300, Total=1722 [2021-12-15 21:54:16,811 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 42 states, 42 states have (on average 1.5476190476190477) internal successors, (65), 42 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:54:17,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:54:17,096 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2021-12-15 21:54:17,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-15 21:54:17,097 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.5476190476190477) internal successors, (65), 42 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-15 21:54:17,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:54:17,097 INFO L225 Difference]: With dead ends: 45 [2021-12-15 21:54:17,097 INFO L226 Difference]: Without dead ends: 41 [2021-12-15 21:54:17,098 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 28 SyntacticMatches, 7 SemanticMatches, 44 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 562 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=203, Invalid=1530, Unknown=5, NotChecked=332, Total=2070 [2021-12-15 21:54:17,098 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 8 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 189 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 21:54:17,098 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 113 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 242 Invalid, 0 Unknown, 189 Unchecked, 0.1s Time] [2021-12-15 21:54:17,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2021-12-15 21:54:17,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2021-12-15 21:54:17,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:54:17,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2021-12-15 21:54:17,103 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 26 [2021-12-15 21:54:17,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:54:17,103 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2021-12-15 21:54:17,103 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.5476190476190477) internal successors, (65), 42 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:54:17,103 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2021-12-15 21:54:17,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-15 21:54:17,104 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:54:17,104 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:54:17,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-15 21:54:17,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 21:54:17,315 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:54:17,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:54:17,316 INFO L85 PathProgramCache]: Analyzing trace with hash -2064736479, now seen corresponding path program 2 times [2021-12-15 21:54:17,316 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:54:17,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866806135] [2021-12-15 21:54:17,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:54:17,316 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:54:17,324 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-15 21:54:17,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [570961202] [2021-12-15 21:54:17,325 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 21:54:17,325 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 21:54:17,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 21:54:17,326 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 21:54:17,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-15 21:54:17,382 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-15 21:54:17,382 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 21:54:17,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-15 21:54:17,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 21:54:17,440 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-15 21:54:17,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 21:54:17,486 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-15 21:54:17,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 21:54:17,520 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-15 21:54:17,549 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-15 21:54:17,563 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:54:17,564 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 21:54:17,607 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_350) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 4)) is different from false [2021-12-15 21:54:17,614 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_350) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 8)) 4)) is different from false [2021-12-15 21:54:17,624 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_350 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_350) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) 4)) is different from false [2021-12-15 21:54:17,633 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 21:54:17,634 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2021-12-15 21:54:17,639 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 21:54:17,639 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2021-12-15 21:54:17,642 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 21:54:17,708 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2021-12-15 21:54:17,708 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:54:17,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866806135] [2021-12-15 21:54:17,708 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-15 21:54:17,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570961202] [2021-12-15 21:54:17,708 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [570961202] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 21:54:17,709 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-15 21:54:17,709 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-12-15 21:54:17,709 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162972671] [2021-12-15 21:54:17,709 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-15 21:54:17,709 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-15 21:54:17,709 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:54:17,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-15 21:54:17,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=201, Unknown=3, NotChecked=90, Total=342 [2021-12-15 21:54:17,710 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:54:17,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:54:17,881 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2021-12-15 21:54:17,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-15 21:54:17,881 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-15 21:54:17,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:54:17,881 INFO L225 Difference]: With dead ends: 49 [2021-12-15 21:54:17,882 INFO L226 Difference]: Without dead ends: 42 [2021-12-15 21:54:17,882 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=380, Unknown=3, NotChecked=126, Total=600 [2021-12-15 21:54:17,882 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 21 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 78 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 21:54:17,883 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 54 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 151 Invalid, 0 Unknown, 78 Unchecked, 0.1s Time] [2021-12-15 21:54:17,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2021-12-15 21:54:17,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2021-12-15 21:54:17,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.1) internal successors, (44), 40 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:54:17,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2021-12-15 21:54:17,887 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 26 [2021-12-15 21:54:17,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:54:17,887 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2021-12-15 21:54:17,887 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:54:17,888 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2021-12-15 21:54:17,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-15 21:54:17,888 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:54:17,888 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:54:17,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-15 21:54:18,104 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-12-15 21:54:18,104 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:54:18,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:54:18,104 INFO L85 PathProgramCache]: Analyzing trace with hash 640571873, now seen corresponding path program 8 times [2021-12-15 21:54:18,105 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:54:18,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4295690] [2021-12-15 21:54:18,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:54:18,105 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:54:18,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:54:18,190 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:54:18,191 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:54:18,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4295690] [2021-12-15 21:54:18,191 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4295690] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 21:54:18,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819421146] [2021-12-15 21:54:18,192 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 21:54:18,192 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 21:54:18,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 21:54:18,193 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 21:54:18,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-15 21:54:18,271 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-15 21:54:18,271 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 21:54:18,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-15 21:54:18,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 21:54:18,408 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:54:18,408 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 21:54:18,483 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:54:18,483 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819421146] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 21:54:18,484 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 21:54:18,484 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2021-12-15 21:54:18,484 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289640933] [2021-12-15 21:54:18,484 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 21:54:18,484 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-15 21:54:18,484 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:54:18,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-15 21:54:18,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2021-12-15 21:54:18,485 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:54:18,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:54:18,681 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2021-12-15 21:54:18,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-15 21:54:18,681 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-12-15 21:54:18,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:54:18,681 INFO L225 Difference]: With dead ends: 49 [2021-12-15 21:54:18,681 INFO L226 Difference]: Without dead ends: 45 [2021-12-15 21:54:18,682 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2021-12-15 21:54:18,682 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 49 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 21:54:18,682 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 22 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 21:54:18,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2021-12-15 21:54:18,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 30. [2021-12-15 21:54:18,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:54:18,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2021-12-15 21:54:18,685 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 28 [2021-12-15 21:54:18,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:54:18,686 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2021-12-15 21:54:18,686 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:54:18,686 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2021-12-15 21:54:18,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-15 21:54:18,686 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:54:18,686 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:54:18,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-12-15 21:54:18,895 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-12-15 21:54:18,895 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:54:18,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:54:18,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1478838205, now seen corresponding path program 9 times [2021-12-15 21:54:18,896 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:54:18,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843736990] [2021-12-15 21:54:18,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:54:18,896 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:54:18,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:54:18,958 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:54:18,958 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:54:18,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843736990] [2021-12-15 21:54:18,958 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843736990] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 21:54:18,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909163376] [2021-12-15 21:54:18,958 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-15 21:54:18,959 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 21:54:18,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 21:54:18,973 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 21:54:19,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-15 21:54:19,045 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-12-15 21:54:19,045 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 21:54:19,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-15 21:54:19,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 21:54:19,144 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:54:19,144 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 21:54:19,193 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:54:19,193 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909163376] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 21:54:19,193 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 21:54:19,193 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2021-12-15 21:54:19,194 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845887979] [2021-12-15 21:54:19,194 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 21:54:19,194 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-15 21:54:19,194 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:54:19,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-15 21:54:19,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2021-12-15 21:54:19,194 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:54:19,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:54:19,282 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2021-12-15 21:54:19,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-15 21:54:19,283 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-15 21:54:19,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:54:19,283 INFO L225 Difference]: With dead ends: 53 [2021-12-15 21:54:19,283 INFO L226 Difference]: Without dead ends: 35 [2021-12-15 21:54:19,284 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2021-12-15 21:54:19,284 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 37 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 21:54:19,284 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 37 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 21:54:19,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-12-15 21:54:19,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2021-12-15 21:54:19,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:54:19,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2021-12-15 21:54:19,287 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 29 [2021-12-15 21:54:19,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:54:19,287 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2021-12-15 21:54:19,287 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.764705882352941) internal successors, (47), 17 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:54:19,287 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2021-12-15 21:54:19,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-15 21:54:19,287 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:54:19,287 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:54:19,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-12-15 21:54:19,495 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-12-15 21:54:19,495 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:54:19,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:54:19,496 INFO L85 PathProgramCache]: Analyzing trace with hash -2018974843, now seen corresponding path program 10 times [2021-12-15 21:54:19,496 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:54:19,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440610078] [2021-12-15 21:54:19,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:54:19,496 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:54:19,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:54:20,061 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:54:20,061 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:54:20,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440610078] [2021-12-15 21:54:20,061 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440610078] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 21:54:20,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [682519096] [2021-12-15 21:54:20,061 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-15 21:54:20,061 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 21:54:20,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 21:54:20,062 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 21:54:20,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-15 21:54:20,112 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-15 21:54:20,112 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 21:54:20,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 58 conjunts are in the unsatisfiable core [2021-12-15 21:54:20,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 21:54:20,127 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 21:54:20,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 21:54:20,155 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-15 21:54:20,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 21:54:20,184 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-15 21:54:20,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 21:54:20,212 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-15 21:54:20,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 21:54:20,258 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-15 21:54:20,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 21:54:20,414 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2021-12-15 21:54:20,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 21:54:20,540 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-15 21:54:20,541 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 41 [2021-12-15 21:54:20,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 21:54:20,786 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-15 21:54:20,787 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 43 [2021-12-15 21:54:20,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 21:54:20,924 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-15 21:54:20,924 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2021-12-15 21:54:21,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-15 21:54:21,090 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-15 21:54:21,090 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 32 [2021-12-15 21:54:21,119 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:54:21,119 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 21:54:37,324 WARN L838 $PredicateComparison]: unable to prove that (forall ((~N~0 Int)) (or (<= ~N~0 |c_ULTIMATE.start_main_~i~0#1|) (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_149| Int) (|v_ULTIMATE.start_main_~i~0#1_145| Int) (|v_ULTIMATE.start_main_~i~0#1_152| Int) (v_ArrVal_486 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_486))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select v_ArrVal_486 (+ (* |v_ULTIMATE.start_main_~i~0#1_152| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse4 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse0 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_149| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse2 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_147| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse1 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse2 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_145| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 4 .cse0)) (not (= 4 .cse1)) (= (+ .cse0 .cse2 .cse3 .cse1 .cse4) (* 4 ~N~0)) (not (= 4 .cse2)) (not (= 4 .cse3)))))))))) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0))) is different from false [2021-12-15 21:54:37,699 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_149| Int) (|v_ULTIMATE.start_main_~i~0#1_145| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_152| Int) (v_ArrVal_486 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_486))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select v_ArrVal_486 (+ (* |v_ULTIMATE.start_main_~i~0#1_152| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse4 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse0 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_149| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse2 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_147| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse1 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 .cse2 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_145| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 4 .cse0)) (not (= 4 .cse1)) (= (+ .cse0 .cse2 .cse3 .cse1 .cse4) (* 4 ~N~0)) (not (= 4 .cse2)) (<= ~N~0 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 2) ~N~0) (not (= 4 .cse3)))))))))) is different from false [2021-12-15 21:54:38,035 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_149| Int) (|v_ULTIMATE.start_main_~i~0#1_145| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_152| Int) (v_ArrVal_486 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_486))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select v_ArrVal_486 (+ (* |v_ULTIMATE.start_main_~i~0#1_152| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse4 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse1 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_149| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse2 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_147| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_145| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (not (= 4 .cse0)) (not (= 4 .cse1)) (= (+ .cse1 .cse2 .cse3 .cse0 .cse4) (* 4 ~N~0)) (not (= 4 .cse2)) (<= ~N~0 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 2) ~N~0) (not (= 4 .cse3)))))))))) is different from false [2021-12-15 21:54:38,353 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_149| Int) (|v_ULTIMATE.start_main_~i~0#1_145| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_152| Int) (v_ArrVal_486 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_486))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select v_ArrVal_486 (+ (* |v_ULTIMATE.start_main_~i~0#1_152| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse4 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse1 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_149| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse2 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_147| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_145| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (<= ~N~0 (+ |c_ULTIMATE.start_main_~i~0#1| 2)) (not (= 4 .cse0)) (not (= 4 .cse1)) (= (+ .cse1 .cse2 .cse3 .cse0 .cse4) (* 4 ~N~0)) (not (= 4 .cse2)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 3) ~N~0) (not (= 4 .cse3)))))))))) is different from false [2021-12-15 21:54:38,712 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_149| Int) (|v_ULTIMATE.start_main_~i~0#1_145| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_152| Int) (v_ArrVal_486 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_486))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select v_ArrVal_486 (+ (* |v_ULTIMATE.start_main_~i~0#1_152| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse4 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse1 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_149| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse2 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_147| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_145| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (<= ~N~0 (+ |c_ULTIMATE.start_main_~i~0#1| 2)) (not (= 4 .cse0)) (not (= 4 .cse1)) (not (= 4 .cse2)) (= (+ .cse1 .cse2 .cse3 .cse0 .cse4) (* 4 ~N~0)) (< (+ |c_ULTIMATE.start_main_~i~0#1| 3) ~N~0) (not (= 4 .cse3)))))))))) is different from false [2021-12-15 21:54:39,038 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_149| Int) (|v_ULTIMATE.start_main_~i~0#1_145| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_152| Int) (v_ArrVal_486 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_486))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select v_ArrVal_486 (+ (* |v_ULTIMATE.start_main_~i~0#1_152| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse4 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse1 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_149| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse2 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_147| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_145| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (< (+ |c_ULTIMATE.start_main_~i~0#1| 4) ~N~0) (<= ~N~0 (+ |c_ULTIMATE.start_main_~i~0#1| 3)) (not (= 4 .cse0)) (not (= 4 .cse1)) (not (= 4 .cse2)) (= (+ .cse1 .cse2 .cse3 .cse0 .cse4) (* 4 ~N~0)) (not (= 4 .cse3)))))))))) is different from false [2021-12-15 21:54:39,424 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_149| Int) (|v_ULTIMATE.start_main_~i~0#1_145| Int) (~N~0 Int) (|v_ULTIMATE.start_main_~i~0#1_152| Int) (v_ArrVal_486 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_486))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse3 (select v_ArrVal_486 (+ (* |v_ULTIMATE.start_main_~i~0#1_152| 4) |ULTIMATE.start_main_~a~0#1.offset|))) (.cse4 (select .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse1 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_149| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse2 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_147| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse0 (select (select (store .cse5 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse1 .cse2 .cse3 .cse4))) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_145| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (or (< (+ |c_ULTIMATE.start_main_~i~0#1| 4) ~N~0) (<= ~N~0 (+ |c_ULTIMATE.start_main_~i~0#1| 3)) (not (= 4 .cse0)) (not (= 4 .cse1)) (= (+ .cse1 .cse2 .cse3 .cse0 .cse4) (* 4 ~N~0)) (not (= 4 .cse2)) (not (= 4 .cse3)))))))))) is different from false [2021-12-15 21:54:39,464 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2021-12-15 21:54:39,465 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [682519096] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 21:54:39,465 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 21:54:39,465 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18, 21] total 55 [2021-12-15 21:54:39,466 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206431335] [2021-12-15 21:54:39,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 21:54:39,467 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2021-12-15 21:54:39,467 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:54:39,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2021-12-15 21:54:39,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=2083, Unknown=14, NotChecked=686, Total=2970 [2021-12-15 21:54:39,468 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 55 states, 55 states have (on average 1.4545454545454546) internal successors, (80), 55 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:54:40,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:54:40,159 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2021-12-15 21:54:40,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-15 21:54:40,159 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 1.4545454545454546) internal successors, (80), 55 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-12-15 21:54:40,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:54:40,159 INFO L225 Difference]: With dead ends: 53 [2021-12-15 21:54:40,160 INFO L226 Difference]: Without dead ends: 49 [2021-12-15 21:54:40,160 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 31 SyntacticMatches, 8 SemanticMatches, 56 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 873 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=229, Invalid=2335, Unknown=14, NotChecked=728, Total=3306 [2021-12-15 21:54:40,161 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 9 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 305 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 21:54:40,161 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 179 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 295 Invalid, 0 Unknown, 305 Unchecked, 0.1s Time] [2021-12-15 21:54:40,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2021-12-15 21:54:40,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2021-12-15 21:54:40,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 45 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:54:40,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2021-12-15 21:54:40,165 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 31 [2021-12-15 21:54:40,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:54:40,165 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2021-12-15 21:54:40,165 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 1.4545454545454546) internal successors, (80), 55 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:54:40,165 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2021-12-15 21:54:40,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-15 21:54:40,166 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:54:40,166 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:54:40,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-12-15 21:54:40,366 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-15 21:54:40,367 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:54:40,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:54:40,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1961716541, now seen corresponding path program 3 times [2021-12-15 21:54:40,367 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:54:40,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449174026] [2021-12-15 21:54:40,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:54:40,368 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:54:40,375 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-15 21:54:40,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1984833844] [2021-12-15 21:54:40,378 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-15 21:54:40,378 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 21:54:40,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 21:54:40,379 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 21:54:40,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-15 21:54:40,450 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-12-15 21:54:40,450 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 21:54:40,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-15 21:54:40,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 21:54:40,460 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-12-15 21:54:40,477 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-12-15 21:54:40,558 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-15 21:54:40,589 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-15 21:54:40,627 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-15 21:54:40,658 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 21:54:40,658 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2021-12-15 21:54:40,701 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-15 21:54:40,701 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 21:54:40,760 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_546 (Array Int Int)) (|ULTIMATE.start_main_~i~0#1| Int)) (or (= 4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_546) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|))) (<= c_~N~0 |ULTIMATE.start_main_~i~0#1|) (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~N~0))) is different from false [2021-12-15 21:54:40,912 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 21:54:40,912 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2021-12-15 21:54:40,918 INFO L354 Elim1Store]: treesize reduction 12, result has 25.0 percent of original size [2021-12-15 21:54:40,918 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 30 [2021-12-15 21:54:40,937 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 13 not checked. [2021-12-15 21:54:40,937 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:54:40,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449174026] [2021-12-15 21:54:40,937 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-15 21:54:40,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984833844] [2021-12-15 21:54:40,937 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1984833844] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 21:54:40,937 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-15 21:54:40,937 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2021-12-15 21:54:40,937 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890077571] [2021-12-15 21:54:40,937 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-15 21:54:40,938 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-15 21:54:40,938 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:54:40,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-15 21:54:40,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=129, Unknown=6, NotChecked=24, Total=210 [2021-12-15 21:54:40,938 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:54:45,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:54:45,029 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2021-12-15 21:54:45,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-15 21:54:45,030 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-12-15 21:54:45,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:54:45,030 INFO L225 Difference]: With dead ends: 56 [2021-12-15 21:54:45,030 INFO L226 Difference]: Without dead ends: 52 [2021-12-15 21:54:45,030 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 2 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=73, Invalid=165, Unknown=6, NotChecked=28, Total=272 [2021-12-15 21:54:45,031 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 9 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 49 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 21:54:45,031 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 35 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 49 Unchecked, 0.0s Time] [2021-12-15 21:54:45,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2021-12-15 21:54:45,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2021-12-15 21:54:45,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.14) internal successors, (57), 50 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:54:45,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2021-12-15 21:54:45,037 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 31 [2021-12-15 21:54:45,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:54:45,037 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2021-12-15 21:54:45,037 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:54:45,037 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2021-12-15 21:54:45,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-15 21:54:45,037 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:54:45,037 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:54:45,054 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-12-15 21:54:45,254 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 21:54:45,254 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:54:45,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:54:45,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1399241145, now seen corresponding path program 11 times [2021-12-15 21:54:45,255 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:54:45,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284965426] [2021-12-15 21:54:45,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:54:45,255 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:54:45,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:54:45,394 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 9 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:54:45,394 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:54:45,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284965426] [2021-12-15 21:54:45,395 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284965426] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 21:54:45,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [81840704] [2021-12-15 21:54:45,395 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-15 21:54:45,395 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 21:54:45,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 21:54:45,396 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 21:54:45,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-12-15 21:54:45,480 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2021-12-15 21:54:45,480 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 21:54:45,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-15 21:54:45,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 21:54:45,608 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:54:45,609 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 21:54:45,677 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:54:45,677 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [81840704] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 21:54:45,678 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 21:54:45,678 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2021-12-15 21:54:45,678 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913205346] [2021-12-15 21:54:45,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 21:54:45,678 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-15 21:54:45,678 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:54:45,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-15 21:54:45,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2021-12-15 21:54:45,678 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand has 20 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:54:45,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:54:45,910 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2021-12-15 21:54:45,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-15 21:54:45,911 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-12-15 21:54:45,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:54:45,911 INFO L225 Difference]: With dead ends: 69 [2021-12-15 21:54:45,911 INFO L226 Difference]: Without dead ends: 65 [2021-12-15 21:54:45,911 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=206, Invalid=664, Unknown=0, NotChecked=0, Total=870 [2021-12-15 21:54:45,912 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 48 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 21:54:45,912 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 34 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 21:54:45,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-12-15 21:54:45,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 40. [2021-12-15 21:54:45,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 39 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:54:45,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2021-12-15 21:54:45,916 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 33 [2021-12-15 21:54:45,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:54:45,916 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2021-12-15 21:54:45,916 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:54:45,916 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2021-12-15 21:54:45,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-15 21:54:45,917 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:54:45,917 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:54:45,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-12-15 21:54:46,117 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-12-15 21:54:46,117 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:54:46,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:54:46,118 INFO L85 PathProgramCache]: Analyzing trace with hash 981485409, now seen corresponding path program 12 times [2021-12-15 21:54:46,118 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:54:46,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313507351] [2021-12-15 21:54:46,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:54:46,118 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:54:46,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:54:46,216 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 25 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:54:46,217 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:54:46,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313507351] [2021-12-15 21:54:46,217 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313507351] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 21:54:46,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126661542] [2021-12-15 21:54:46,217 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-15 21:54:46,217 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 21:54:46,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 21:54:46,218 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 21:54:46,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-12-15 21:54:46,311 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2021-12-15 21:54:46,311 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 21:54:46,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-15 21:54:46,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 21:54:46,442 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 35 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:54:46,442 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 21:54:46,501 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 35 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:54:46,501 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1126661542] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 21:54:46,501 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 21:54:46,501 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2021-12-15 21:54:46,501 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242966956] [2021-12-15 21:54:46,501 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 21:54:46,501 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-15 21:54:46,502 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 21:54:46,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-15 21:54:46,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2021-12-15 21:54:46,502 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand has 20 states, 20 states have (on average 2.75) internal successors, (55), 20 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:54:46,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 21:54:46,631 INFO L93 Difference]: Finished difference Result 78 states and 90 transitions. [2021-12-15 21:54:46,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-15 21:54:46,631 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.75) internal successors, (55), 20 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-12-15 21:54:46,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 21:54:46,632 INFO L225 Difference]: With dead ends: 78 [2021-12-15 21:54:46,632 INFO L226 Difference]: Without dead ends: 50 [2021-12-15 21:54:46,632 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2021-12-15 21:54:46,632 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 69 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 21:54:46,632 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 29 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 21:54:46,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-12-15 21:54:46,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2021-12-15 21:54:46,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.146341463414634) internal successors, (47), 41 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:54:46,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2021-12-15 21:54:46,636 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 34 [2021-12-15 21:54:46,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 21:54:46,636 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2021-12-15 21:54:46,636 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.75) internal successors, (55), 20 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 21:54:46,636 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2021-12-15 21:54:46,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-15 21:54:46,636 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 21:54:46,636 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 21:54:46,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-12-15 21:54:46,836 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-12-15 21:54:46,837 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 21:54:46,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 21:54:46,837 INFO L85 PathProgramCache]: Analyzing trace with hash -596322977, now seen corresponding path program 13 times [2021-12-15 21:54:46,837 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 21:54:46,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044146218] [2021-12-15 21:54:46,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 21:54:46,837 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 21:54:46,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:54:47,420 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:54:47,420 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 21:54:47,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044146218] [2021-12-15 21:54:47,420 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044146218] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 21:54:47,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616409388] [2021-12-15 21:54:47,420 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-12-15 21:54:47,420 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 21:54:47,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 21:54:47,421 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-15 21:54:47,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-12-15 21:54:47,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 21:54:47,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 73 conjunts are in the unsatisfiable core [2021-12-15 21:54:47,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 21:54:47,516 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 21:54:47,519 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2021-12-15 21:54:47,538 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-15 21:54:47,554 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-15 21:54:47,593 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-15 21:54:47,614 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-15 21:54:47,632 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-15 21:54:47,764 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2021-12-15 21:54:47,862 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-15 21:54:47,862 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 41 [2021-12-15 21:54:47,988 INFO L354 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2021-12-15 21:54:47,989 INFO L388 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 90 treesize of output 59 [2021-12-15 21:54:48,216 INFO L354 Elim1Store]: treesize reduction 96, result has 1.0 percent of original size [2021-12-15 21:54:48,216 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 119 treesize of output 75 [2021-12-15 21:54:48,385 INFO L354 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2021-12-15 21:54:48,386 INFO L388 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 91 treesize of output 60 [2021-12-15 21:54:48,541 INFO L354 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2021-12-15 21:54:48,541 INFO L388 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 75 treesize of output 35 [2021-12-15 21:54:48,585 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 21:54:48,585 INFO L328 TraceCheckSpWp]: Computing backward predicates...