./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/sina4.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b5317dae 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/sina4.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 933eff495d93b07d12af9180ab5b75cc35fb173187f8af9883307194e1e7fea3 --- Real Ultimate output --- This is Ultimate 0.2.2-?-b5317da-m [2023-02-16 00:35:34,690 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 00:35:34,691 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 00:35:34,712 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 00:35:34,714 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 00:35:34,717 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 00:35:34,718 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 00:35:34,720 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 00:35:34,722 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 00:35:34,726 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 00:35:34,727 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 00:35:34,728 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 00:35:34,729 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 00:35:34,731 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 00:35:34,733 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 00:35:34,734 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 00:35:34,735 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 00:35:34,736 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 00:35:34,737 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 00:35:34,739 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 00:35:34,740 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 00:35:34,741 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 00:35:34,741 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 00:35:34,742 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 00:35:34,748 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 00:35:34,748 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 00:35:34,748 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 00:35:34,749 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 00:35:34,749 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 00:35:34,750 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 00:35:34,750 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 00:35:34,751 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 00:35:34,752 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 00:35:34,753 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 00:35:34,754 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 00:35:34,754 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 00:35:34,755 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 00:35:34,755 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 00:35:34,755 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 00:35:34,756 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 00:35:34,757 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 00:35:34,757 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-16 00:35:34,782 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 00:35:34,783 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 00:35:34,783 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 00:35:34,783 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 00:35:34,784 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 00:35:34,784 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 00:35:34,785 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 00:35:34,785 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 00:35:34,785 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 00:35:34,785 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 00:35:34,786 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 00:35:34,786 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 00:35:34,786 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 00:35:34,786 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 00:35:34,786 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-16 00:35:34,786 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 00:35:34,787 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-16 00:35:34,787 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 00:35:34,787 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-16 00:35:34,787 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 00:35:34,787 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-16 00:35:34,787 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 00:35:34,787 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 00:35:34,788 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 00:35:34,788 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 00:35:34,788 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 00:35:34,788 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 00:35:34,788 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-16 00:35:34,788 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-16 00:35:34,788 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-16 00:35:34,789 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 00:35:34,789 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-16 00:35:34,789 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 00:35:34,789 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 00:35:34,789 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 00:35:34,789 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 933eff495d93b07d12af9180ab5b75cc35fb173187f8af9883307194e1e7fea3 [2023-02-16 00:35:34,990 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 00:35:35,006 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 00:35:35,008 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 00:35:35,009 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 00:35:35,010 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 00:35:35,011 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/sina4.c [2023-02-16 00:35:35,955 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 00:35:36,098 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 00:35:36,099 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/sina4.c [2023-02-16 00:35:36,103 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd00e4927/338aaaf9ad48448fb178312c96de9a23/FLAG61b9d8b20 [2023-02-16 00:35:36,116 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd00e4927/338aaaf9ad48448fb178312c96de9a23 [2023-02-16 00:35:36,118 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 00:35:36,119 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 00:35:36,121 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 00:35:36,122 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 00:35:36,124 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 00:35:36,125 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 12:35:36" (1/1) ... [2023-02-16 00:35:36,126 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@289b6820 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:35:36, skipping insertion in model container [2023-02-16 00:35:36,126 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 12:35:36" (1/1) ... [2023-02-16 00:35:36,131 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 00:35:36,142 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 00:35:36,281 WARN L237 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/sina4.c[588,601] [2023-02-16 00:35:36,303 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 00:35:36,316 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 00:35:36,335 WARN L237 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/sina4.c[588,601] [2023-02-16 00:35:36,349 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 00:35:36,358 INFO L208 MainTranslator]: Completed translation [2023-02-16 00:35:36,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:35:36 WrapperNode [2023-02-16 00:35:36,359 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 00:35:36,360 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 00:35:36,360 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 00:35:36,360 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 00:35:36,364 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:35:36" (1/1) ... [2023-02-16 00:35:36,376 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:35:36" (1/1) ... [2023-02-16 00:35:36,396 INFO L138 Inliner]: procedures = 17, calls = 33, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 106 [2023-02-16 00:35:36,396 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 00:35:36,397 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 00:35:36,397 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 00:35:36,397 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 00:35:36,403 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:35:36" (1/1) ... [2023-02-16 00:35:36,404 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:35:36" (1/1) ... [2023-02-16 00:35:36,407 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:35:36" (1/1) ... [2023-02-16 00:35:36,408 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:35:36" (1/1) ... [2023-02-16 00:35:36,421 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:35:36" (1/1) ... [2023-02-16 00:35:36,424 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:35:36" (1/1) ... [2023-02-16 00:35:36,429 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:35:36" (1/1) ... [2023-02-16 00:35:36,430 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:35:36" (1/1) ... [2023-02-16 00:35:36,433 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 00:35:36,434 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 00:35:36,434 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 00:35:36,434 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 00:35:36,435 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:35:36" (1/1) ... [2023-02-16 00:35:36,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 00:35:36,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:35:36,457 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) [2023-02-16 00:35:36,476 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 [2023-02-16 00:35:36,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-16 00:35:36,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-16 00:35:36,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-16 00:35:36,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-16 00:35:36,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-16 00:35:36,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 00:35:36,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 00:35:36,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-16 00:35:36,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-16 00:35:36,573 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 00:35:36,574 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 00:35:36,708 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 00:35:36,712 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 00:35:36,712 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2023-02-16 00:35:36,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 12:35:36 BoogieIcfgContainer [2023-02-16 00:35:36,714 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 00:35:36,715 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-16 00:35:36,715 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-16 00:35:36,717 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-16 00:35:36,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 12:35:36" (1/3) ... [2023-02-16 00:35:36,718 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50fe2c7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 12:35:36, skipping insertion in model container [2023-02-16 00:35:36,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:35:36" (2/3) ... [2023-02-16 00:35:36,718 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50fe2c7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 12:35:36, skipping insertion in model container [2023-02-16 00:35:36,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 12:35:36" (3/3) ... [2023-02-16 00:35:36,719 INFO L112 eAbstractionObserver]: Analyzing ICFG sina4.c [2023-02-16 00:35:36,731 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-16 00:35:36,731 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-16 00:35:36,760 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-16 00:35:36,765 INFO L357 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4945664e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-16 00:35:36,765 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-16 00:35:36,768 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 25 states have (on average 1.56) internal successors, (39), 26 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) [2023-02-16 00:35:36,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-16 00:35:36,773 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:35:36,774 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:35:36,775 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:35:36,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:35:36,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1389277550, now seen corresponding path program 1 times [2023-02-16 00:35:36,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:35:36,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167427315] [2023-02-16 00:35:36,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:35:36,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:35:36,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:35:36,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:35:36,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:35:36,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167427315] [2023-02-16 00:35:36,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167427315] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:35:36,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:35:36,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 00:35:36,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764898372] [2023-02-16 00:35:36,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:35:36,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-16 00:35:36,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:35:36,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-16 00:35:36,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-16 00:35:36,970 INFO L87 Difference]: Start difference. First operand has 27 states, 25 states have (on average 1.56) internal successors, (39), 26 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) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:35:36,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:35:36,984 INFO L93 Difference]: Finished difference Result 50 states and 72 transitions. [2023-02-16 00:35:36,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-16 00:35:36,986 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 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 [2023-02-16 00:35:36,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:35:36,990 INFO L225 Difference]: With dead ends: 50 [2023-02-16 00:35:36,990 INFO L226 Difference]: Without dead ends: 23 [2023-02-16 00:35:36,993 INFO L412 NwaCegarLoop]: 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 [2023-02-16 00:35:36,996 INFO L413 NwaCegarLoop]: 32 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, 32 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 [2023-02-16 00:35:36,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 00:35:37,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-02-16 00:35:37,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-02-16 00:35:37,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:35:37,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2023-02-16 00:35:37,026 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 16 [2023-02-16 00:35:37,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:35:37,026 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2023-02-16 00:35:37,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:35:37,027 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2023-02-16 00:35:37,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-16 00:35:37,028 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:35:37,028 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:35:37,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-16 00:35:37,029 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:35:37,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:35:37,030 INFO L85 PathProgramCache]: Analyzing trace with hash 796930410, now seen corresponding path program 1 times [2023-02-16 00:35:37,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:35:37,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886536598] [2023-02-16 00:35:37,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:35:37,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:35:37,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:35:37,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:35:37,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:35:37,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886536598] [2023-02-16 00:35:37,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886536598] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:35:37,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:35:37,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 00:35:37,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607506993] [2023-02-16 00:35:37,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:35:37,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 00:35:37,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:35:37,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 00:35:37,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-16 00:35:37,205 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:35:37,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:35:37,262 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2023-02-16 00:35:37,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 00:35:37,262 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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 [2023-02-16 00:35:37,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:35:37,263 INFO L225 Difference]: With dead ends: 53 [2023-02-16 00:35:37,263 INFO L226 Difference]: Without dead ends: 37 [2023-02-16 00:35:37,264 INFO L412 NwaCegarLoop]: 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 [2023-02-16 00:35:37,265 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 45 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 00:35:37,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 17 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 00:35:37,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-02-16 00:35:37,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 27. [2023-02-16 00:35:37,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 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) [2023-02-16 00:35:37,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2023-02-16 00:35:37,272 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 16 [2023-02-16 00:35:37,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:35:37,273 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2023-02-16 00:35:37,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:35:37,274 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2023-02-16 00:35:37,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-16 00:35:37,274 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:35:37,274 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:35:37,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-16 00:35:37,275 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:35:37,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:35:37,278 INFO L85 PathProgramCache]: Analyzing trace with hash 495241442, now seen corresponding path program 1 times [2023-02-16 00:35:37,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:35:37,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693224886] [2023-02-16 00:35:37,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:35:37,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:35:37,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:35:38,658 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:35:38,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:35:38,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693224886] [2023-02-16 00:35:38,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693224886] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:35:38,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804700551] [2023-02-16 00:35:38,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:35:38,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:35:38,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:35:38,663 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) [2023-02-16 00:35:38,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-16 00:35:38,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:35:38,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 47 conjunts are in the unsatisfiable core [2023-02-16 00:35:38,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:35:38,815 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 00:35:38,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:35:38,858 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 22 [2023-02-16 00:35:39,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:35:39,037 INFO L350 Elim1Store]: Elim1 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 36 treesize of output 23 [2023-02-16 00:35:39,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:35:39,150 INFO L350 Elim1Store]: Elim1 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 40 treesize of output 23 [2023-02-16 00:35:39,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:35:39,305 INFO L321 Elim1Store]: treesize reduction 32, result has 45.8 percent of original size [2023-02-16 00:35:39,306 INFO L350 Elim1Store]: Elim1 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 2 case distinctions, treesize of input 32 treesize of output 42 [2023-02-16 00:35:39,557 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:35:39,557 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 79 treesize of output 159 [2023-02-16 00:35:39,573 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:35:39,573 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:35:41,610 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~b~0#1.base| Int)) (= (select (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 8))) (store (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse0) (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse0)) 1))) |c_ULTIMATE.start_main_~b~0#1.offset|) (+ c_~N~0 2))) is different from false [2023-02-16 00:35:41,816 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:35:41,823 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-02-16 00:35:41,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804700551] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:35:41,823 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:35:41,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 38 [2023-02-16 00:35:41,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560406585] [2023-02-16 00:35:41,823 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:35:41,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-02-16 00:35:41,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:35:41,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-02-16 00:35:41,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=1144, Unknown=1, NotChecked=70, Total=1406 [2023-02-16 00:35:41,825 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 38 states, 38 states have (on average 1.605263157894737) internal successors, (61), 38 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:35:42,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:35:42,520 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2023-02-16 00:35:42,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-16 00:35:42,520 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.605263157894737) internal successors, (61), 38 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-02-16 00:35:42,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:35:42,521 INFO L225 Difference]: With dead ends: 59 [2023-02-16 00:35:42,521 INFO L226 Difference]: Without dead ends: 57 [2023-02-16 00:35:42,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 25 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 819 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=323, Invalid=2032, Unknown=1, NotChecked=94, Total=2450 [2023-02-16 00:35:42,523 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 78 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 42 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 00:35:42,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 139 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 434 Invalid, 0 Unknown, 42 Unchecked, 0.3s Time] [2023-02-16 00:35:42,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-02-16 00:35:42,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 46. [2023-02-16 00:35:42,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.2222222222222223) internal successors, (55), 45 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) [2023-02-16 00:35:42,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2023-02-16 00:35:42,530 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 55 transitions. Word has length 24 [2023-02-16 00:35:42,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:35:42,530 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 55 transitions. [2023-02-16 00:35:42,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.605263157894737) internal successors, (61), 38 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:35:42,530 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2023-02-16 00:35:42,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-16 00:35:42,531 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:35:42,531 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:35:42,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-16 00:35:42,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:35:42,738 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:35:42,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:35:42,739 INFO L85 PathProgramCache]: Analyzing trace with hash 831040416, now seen corresponding path program 2 times [2023-02-16 00:35:42,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:35:42,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897629070] [2023-02-16 00:35:42,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:35:42,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:35:42,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:35:42,805 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-16 00:35:42,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:35:42,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897629070] [2023-02-16 00:35:42,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897629070] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:35:42,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283538878] [2023-02-16 00:35:42,806 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 00:35:42,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:35:42,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:35:42,807 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) [2023-02-16 00:35:42,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-16 00:35:42,863 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-16 00:35:42,863 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 00:35:42,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-16 00:35:42,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:35:42,901 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-16 00:35:42,901 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:35:42,930 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-16 00:35:42,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [283538878] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:35:42,931 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:35:42,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-02-16 00:35:42,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074855585] [2023-02-16 00:35:42,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:35:42,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-16 00:35:42,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:35:42,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-16 00:35:42,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-02-16 00:35:42,934 INFO L87 Difference]: Start difference. First operand 46 states and 55 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:35:43,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:35:43,041 INFO L93 Difference]: Finished difference Result 110 states and 128 transitions. [2023-02-16 00:35:43,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-16 00:35:43,042 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-02-16 00:35:43,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:35:43,044 INFO L225 Difference]: With dead ends: 110 [2023-02-16 00:35:43,044 INFO L226 Difference]: Without dead ends: 66 [2023-02-16 00:35:43,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2023-02-16 00:35:43,047 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 54 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 00:35:43,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 55 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 00:35:43,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-02-16 00:35:43,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2023-02-16 00:35:43,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 45 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:35:43,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2023-02-16 00:35:43,068 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 26 [2023-02-16 00:35:43,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:35:43,069 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2023-02-16 00:35:43,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:35:43,069 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2023-02-16 00:35:43,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-16 00:35:43,070 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:35:43,071 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:35:43,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-16 00:35:43,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-02-16 00:35:43,279 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:35:43,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:35:43,280 INFO L85 PathProgramCache]: Analyzing trace with hash -587916192, now seen corresponding path program 3 times [2023-02-16 00:35:43,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:35:43,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303494083] [2023-02-16 00:35:43,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:35:43,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:35:43,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:35:43,345 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-16 00:35:43,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:35:43,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303494083] [2023-02-16 00:35:43,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303494083] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:35:43,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784715376] [2023-02-16 00:35:43,346 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-16 00:35:43,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:35:43,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:35:43,348 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) [2023-02-16 00:35:43,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-16 00:35:43,414 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-02-16 00:35:43,414 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 00:35:43,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-16 00:35:43,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:35:43,448 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-16 00:35:43,448 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:35:43,478 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-16 00:35:43,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [784715376] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:35:43,479 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:35:43,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-02-16 00:35:43,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672734014] [2023-02-16 00:35:43,479 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:35:43,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-16 00:35:43,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:35:43,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-16 00:35:43,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-02-16 00:35:43,481 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:35:43,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:35:43,569 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2023-02-16 00:35:43,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-16 00:35:43,570 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-02-16 00:35:43,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:35:43,570 INFO L225 Difference]: With dead ends: 63 [2023-02-16 00:35:43,570 INFO L226 Difference]: Without dead ends: 50 [2023-02-16 00:35:43,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2023-02-16 00:35:43,571 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 78 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 00:35:43,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 46 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 00:35:43,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-02-16 00:35:43,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2023-02-16 00:35:43,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 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) [2023-02-16 00:35:43,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2023-02-16 00:35:43,575 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 26 [2023-02-16 00:35:43,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:35:43,576 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2023-02-16 00:35:43,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:35:43,576 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2023-02-16 00:35:43,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-16 00:35:43,576 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:35:43,577 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:35:43,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-16 00:35:43,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:35:43,783 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:35:43,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:35:43,784 INFO L85 PathProgramCache]: Analyzing trace with hash -826292134, now seen corresponding path program 4 times [2023-02-16 00:35:43,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:35:43,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110795399] [2023-02-16 00:35:43,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:35:43,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:35:43,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:35:45,495 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:35:45,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:35:45,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110795399] [2023-02-16 00:35:45,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110795399] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:35:45,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678633218] [2023-02-16 00:35:45,496 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-16 00:35:45,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:35:45,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:35:45,498 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) [2023-02-16 00:35:45,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-16 00:35:45,561 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-16 00:35:45,561 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 00:35:45,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 72 conjunts are in the unsatisfiable core [2023-02-16 00:35:45,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:35:45,589 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 00:35:45,593 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 00:35:45,637 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 22 [2023-02-16 00:35:45,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2023-02-16 00:35:45,910 INFO L321 Elim1Store]: treesize reduction 26, result has 3.7 percent of original size [2023-02-16 00:35:45,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 53 [2023-02-16 00:35:46,026 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:35:46,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:35:46,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:35:46,028 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:35:46,029 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 42 [2023-02-16 00:35:46,270 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:35:46,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:35:46,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 43 [2023-02-16 00:35:46,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:35:46,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:35:46,405 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:35:46,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2023-02-16 00:35:46,532 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:35:46,533 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:35:46,550 INFO L321 Elim1Store]: treesize reduction 38, result has 46.5 percent of original size [2023-02-16 00:35:46,550 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 52 [2023-02-16 00:35:46,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:35:46,726 INFO L321 Elim1Store]: treesize reduction 53, result has 26.4 percent of original size [2023-02-16 00:35:46,726 INFO L350 Elim1Store]: Elim1 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 4 case distinctions, treesize of input 43 treesize of output 60 [2023-02-16 00:35:46,897 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:35:46,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 68 [2023-02-16 00:35:46,923 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:35:46,923 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:35:49,141 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~b~0#1.base| Int) (v_ArrVal_228 Int) (|v_ULTIMATE.start_main_~i~0#1_70| Int)) (or (= (select (store (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 8))) (store (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |c_ULTIMATE.start_main_~b~0#1.offset| .cse0) (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse0)) 1))) (+ |c_ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_70| 8)) v_ArrVal_228) |c_ULTIMATE.start_main_~b~0#1.offset|) (+ c_~N~0 2)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_70|)))) is different from false [2023-02-16 00:35:50,507 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-02-16 00:35:50,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678633218] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:35:50,508 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:35:50,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 24] total 66 [2023-02-16 00:35:50,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042837639] [2023-02-16 00:35:50,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:35:50,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2023-02-16 00:35:50,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:35:50,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2023-02-16 00:35:50,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=3716, Unknown=1, NotChecked=126, Total=4290 [2023-02-16 00:35:50,510 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 66 states, 66 states have (on average 1.2878787878787878) internal successors, (85), 66 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:37:30,653 WARN L233 SmtUtils]: Spent 52.16s on a formula simplification that was a NOOP. DAG size: 117 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-16 00:37:33,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-16 00:37:35,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-16 00:37:37,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-16 00:37:39,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-16 00:37:41,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-16 00:37:56,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:37:56,556 INFO L93 Difference]: Finished difference Result 169 states and 192 transitions. [2023-02-16 00:37:56,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2023-02-16 00:37:56,557 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 1.2878787878787878) internal successors, (85), 66 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-02-16 00:37:56,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:37:56,557 INFO L225 Difference]: With dead ends: 169 [2023-02-16 00:37:56,557 INFO L226 Difference]: Without dead ends: 167 [2023-02-16 00:37:56,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 147 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7273 ImplicationChecksByTransitivity, 116.9s TimeCoverageRelationStatistics Valid=2151, Invalid=19603, Unknown=6, NotChecked=292, Total=22052 [2023-02-16 00:37:56,563 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 324 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 1655 mSolverCounterSat, 357 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 2130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 1655 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 113 IncrementalHoareTripleChecker+Unchecked, 13.5s IncrementalHoareTripleChecker+Time [2023-02-16 00:37:56,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 494 Invalid, 2130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [357 Valid, 1655 Invalid, 5 Unknown, 113 Unchecked, 13.5s Time] [2023-02-16 00:37:56,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2023-02-16 00:37:56,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 86. [2023-02-16 00:37:56,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.2) internal successors, (102), 85 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:37:56,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 102 transitions. [2023-02-16 00:37:56,593 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 102 transitions. Word has length 32 [2023-02-16 00:37:56,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:37:56,593 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 102 transitions. [2023-02-16 00:37:56,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 1.2878787878787878) internal successors, (85), 66 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:37:56,593 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 102 transitions. [2023-02-16 00:37:56,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-16 00:37:56,594 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:37:56,594 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:37:56,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-16 00:37:56,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:37:56,795 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:37:56,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:37:56,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1737020496, now seen corresponding path program 1 times [2023-02-16 00:37:56,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:37:56,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587628049] [2023-02-16 00:37:56,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:37:56,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:37:56,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:37:58,730 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:37:58,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:37:58,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587628049] [2023-02-16 00:37:58,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587628049] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:37:58,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976953610] [2023-02-16 00:37:58,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:37:58,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:37:58,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:37:58,732 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) [2023-02-16 00:37:58,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-16 00:37:58,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:37:58,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 77 conjunts are in the unsatisfiable core [2023-02-16 00:37:58,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:37:58,803 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-16 00:37:58,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2023-02-16 00:37:58,836 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 [2023-02-16 00:37:58,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:37:58,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-16 00:37:58,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2023-02-16 00:37:58,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:37:58,998 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2023-02-16 00:37:59,062 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:37:59,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:37:59,064 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 36 [2023-02-16 00:37:59,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:37:59,157 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 34 [2023-02-16 00:37:59,305 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:37:59,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:37:59,307 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 51 [2023-02-16 00:37:59,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:37:59,429 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:37:59,435 INFO L321 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2023-02-16 00:37:59,436 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 55 [2023-02-16 00:37:59,849 INFO L321 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-02-16 00:37:59,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 85 treesize of output 41 [2023-02-16 00:37:59,878 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-16 00:37:59,879 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:38:03,280 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:38:03,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 216 treesize of output 175 [2023-02-16 00:38:05,962 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse6 (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse1 (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse2 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse7 (+ .cse1 .cse2))) (= (let ((.cse5 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (select (select (let ((.cse0 (store .cse3 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse4 (store .cse6 |c_ULTIMATE.start_main_~a~0#1.offset| .cse7))) (store .cse4 .cse5 (+ (select .cse6 .cse5) (select (select (store .cse3 |c_ULTIMATE.start_main_~a~0#1.base| .cse4) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))))))) (store .cse0 |c_ULTIMATE.start_main_~b~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ .cse1 .cse2 1)))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5)) .cse7)))))) is different from false [2023-02-16 00:38:09,056 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 8)) 1)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse6 (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse1 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse7 (+ .cse1 .cse2))) (= (let ((.cse5 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (select (select (let ((.cse0 (store .cse3 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse4 (store .cse6 |c_ULTIMATE.start_main_~a~0#1.offset| .cse7))) (store .cse4 .cse5 (+ (select (select (store .cse3 |c_ULTIMATE.start_main_~a~0#1.base| .cse4) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse6 .cse5))))))) (store .cse0 |c_ULTIMATE.start_main_~b~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ .cse1 .cse2 1)))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5)) .cse7)))))) is different from false [2023-02-16 00:38:12,050 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 8) 8) 1)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse6 (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse1 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse7 (+ .cse1 .cse2))) (= (let ((.cse5 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (select (select (let ((.cse0 (store .cse3 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse4 (store .cse6 |c_ULTIMATE.start_main_~a~0#1.offset| .cse7))) (store .cse4 .cse5 (+ (select .cse6 .cse5) (select (select (store .cse3 |c_ULTIMATE.start_main_~a~0#1.base| .cse4) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))))))) (store .cse0 |c_ULTIMATE.start_main_~b~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ .cse1 .cse2 1)))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5)) .cse7)))))) is different from false [2023-02-16 00:38:12,266 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:38:12,266 INFO L350 Elim1Store]: Elim1 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 2 case distinctions, treesize of input 500 treesize of output 206 [2023-02-16 00:38:12,304 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:38:12,304 INFO L350 Elim1Store]: Elim1 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 1943 treesize of output 1723 [2023-02-16 00:38:12,367 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:38:12,368 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 1578 treesize of output 1340 [2023-02-16 00:38:12,938 INFO L350 Elim1Store]: Elim1 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 1318 treesize of output 1302 [2023-02-16 00:38:17,880 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:38:17,881 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 case distinctions, treesize of input 58 treesize of output 75 [2023-02-16 00:38:18,443 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-02-16 00:38:18,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [976953610] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:38:18,443 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:38:18,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 19, 21] total 59 [2023-02-16 00:38:18,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594677469] [2023-02-16 00:38:18,443 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:38:18,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2023-02-16 00:38:18,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:38:18,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2023-02-16 00:38:18,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=2867, Unknown=3, NotChecked=330, Total=3422 [2023-02-16 00:38:18,445 INFO L87 Difference]: Start difference. First operand 86 states and 102 transitions. Second operand has 59 states, 59 states have (on average 1.6101694915254237) internal successors, (95), 59 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:38:26,042 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse9 (* |c_ULTIMATE.start_main_~i~0#1| 8)) (.cse11 (select .cse8 8)) (.cse10 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse12 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~b~0#1.base|))) (.cse13 (= |c_ULTIMATE.start_main_~b~0#1.offset| 0))) (and (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse8 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse9 8) 1)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse6 (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse1 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse7 (+ .cse1 .cse2))) (= (let ((.cse5 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (select (select (let ((.cse0 (store .cse3 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse4 (store .cse6 |c_ULTIMATE.start_main_~a~0#1.offset| .cse7))) (store .cse4 .cse5 (+ (select .cse6 .cse5) (select (select (store .cse3 |c_ULTIMATE.start_main_~a~0#1.base| .cse4) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))))))) (store .cse0 |c_ULTIMATE.start_main_~b~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ .cse1 .cse2 1)))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5)) .cse7)))))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (or (and (<= 2 c_~N~0) (or (and (<= .cse10 2) (<= 2 .cse10) (= .cse11 1) .cse12 .cse13) (< 2 c_~N~0))) (<= (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 |c_ULTIMATE.start_main_~i~0#1|) 1) (* 8 c_~N~0))) (= (select .cse8 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse9)) 1) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (or (and (= 2 c_~N~0) (<= .cse11 3) (<= 3 .cse11) .cse12 .cse13) (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) c_~N~0)) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (= .cse10 0) .cse12 .cse13))) is different from false [2023-02-16 00:38:32,321 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 8)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= (select .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse1 (- 8))) 1) (or (<= |c_ULTIMATE.start_main_~i~0#1| 1) (<= c_~N~0 2)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |c_ULTIMATE.start_main_~i~0#1| 1) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse1) 1)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse8 (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse3 (select .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse4 (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse9 (+ .cse3 .cse4))) (= (let ((.cse7 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (select (select (let ((.cse2 (store .cse5 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse6 (store .cse8 |c_ULTIMATE.start_main_~a~0#1.offset| .cse9))) (store .cse6 .cse7 (+ (select (select (store .cse5 |c_ULTIMATE.start_main_~a~0#1.base| .cse6) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse8 .cse7))))))) (store .cse2 |c_ULTIMATE.start_main_~b~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ .cse3 .cse4 1)))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7)) .cse9)))))) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select .cse0 0) 1) (<= 1 |c_ULTIMATE.start_main_~i~0#1|) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~b~0#1.base|)) (= |c_ULTIMATE.start_main_~b~0#1.offset| 0))) is different from false [2023-02-16 00:38:35,395 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= (select .cse0 .cse1) 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select .cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |c_ULTIMATE.start_main_~i~0#1| 8))) 1) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse7 (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse3 (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse4 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse8 (+ .cse3 .cse4))) (= (select (select (let ((.cse2 (store .cse5 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse6 (store .cse7 |c_ULTIMATE.start_main_~a~0#1.offset| .cse8))) (store .cse6 .cse1 (+ (select .cse7 .cse1) (select (select (store .cse5 |c_ULTIMATE.start_main_~a~0#1.base| .cse6) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))))))) (store .cse2 |c_ULTIMATE.start_main_~b~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ .cse3 .cse4 1)))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse8)))))) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (<= |c_ULTIMATE.start_main_~i~0#1| 1) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= (select .cse0 0) 1) (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) c_~N~0) (<= 1 |c_ULTIMATE.start_main_~i~0#1|) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~b~0#1.base|)) (= |c_ULTIMATE.start_main_~b~0#1.offset| 0))) is different from false [2023-02-16 00:38:41,240 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (and (= (select .cse0 .cse1) 1) (<= 2 c_~N~0) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (or (< 2 c_~N~0) (and (= (select .cse0 0) 1) (= (select .cse0 (+ (* c_~N~0 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 8))) 1) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~b~0#1.base|)) (= |c_ULTIMATE.start_main_~b~0#1.offset| 0))) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse7 (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse3 (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse4 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse8 (+ .cse3 .cse4))) (= (select (select (let ((.cse2 (store .cse5 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse6 (store .cse7 |c_ULTIMATE.start_main_~a~0#1.offset| .cse8))) (store .cse6 .cse1 (+ (select .cse7 .cse1) (select (select (store .cse5 |c_ULTIMATE.start_main_~a~0#1.base| .cse6) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))))))) (store .cse2 |c_ULTIMATE.start_main_~b~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ .cse3 .cse4 1)))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse8)))))) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|))) is different from false [2023-02-16 00:38:47,671 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 8))) (and (= (select .cse0 .cse1) 1) (<= 2 c_~N~0) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (or (< 2 c_~N~0) (and (= (select .cse0 0) 1) (= (select .cse0 (+ (* c_~N~0 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 8))) 1) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~b~0#1.base|)) (= |c_ULTIMATE.start_main_~b~0#1.offset| 0))) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_arrayElimArr_1))) (let ((.cse7 (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse3 (select v_arrayElimArr_1 |ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse4 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse8 (+ .cse3 .cse4))) (= (select (select (let ((.cse2 (store .cse5 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse6 (store .cse7 |c_ULTIMATE.start_main_~a~0#1.offset| .cse8))) (store .cse6 .cse1 (+ (select .cse7 .cse1) (select (select (store .cse5 |c_ULTIMATE.start_main_~a~0#1.base| .cse6) |c_ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|))))))) (store .cse2 |c_ULTIMATE.start_main_~b~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ .cse3 .cse4 1)))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) .cse8)))))) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (= |c_ULTIMATE.start_main_~i~0#1| 0))) is different from false [2023-02-16 00:39:38,439 WARN L233 SmtUtils]: Spent 8.92s on a formula simplification. DAG size of input: 127 DAG size of output: 116 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)